human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on bisimulations for description logics"
  Abstract: We study bisimulations for useful description logics. The simplest among the considered logics is ALC reg (a variant of PDL). The others extend that logic with the features: inverse roles, nominals, qualified number restrictions, the universal role, and/or the concept constructor for expressing the local reflexivity of a role. They also allow role axioms. Our contributions are as follows. We propose to treat named individuals as initial states and give an appropriate bisimulation condition for that. We also give bisimulation conditions for the universal role and the concept constructor ? r . Self . We prove that all of the bisimulation conditions for the features can be combined together to guarantee invariance of concepts and the Hennessy-Milner property for the whole class of studied description logics. We address and give results on invariance or preservation of ABoxes, RBoxes and knowledge bases in description logics. Independently from Lutz et al. 26,27 we also give results on invariance of TBoxes. We introduce a new notion called QS-interpretation, which is needed for dealing with minimizing interpretations in description logics with qualified number restrictions and/or the concept constructor ? r . Self . We formulate and prove results on minimality of quotient interpretations w.r.t. the largest auto-bisimulations. We adapt Hopcroft's automaton minimization algorithm to give an efficient algorithm for computing the partition corresponding to the largest auto-bisimulation of a finite interpretation in any description logic of the considered family. Using the invariance results we compare the expressiveness of the considered description logics w.r.t. concepts, TBoxes and ABoxes. Our results about separating the expressiveness of description logics are naturally extended to the case when instead of ALC reg we have any sublogic of ALC reg that extends ALC .

Connected through hyperedge HE-1 (induced by source paper "bisimulation based comparisons for interpretations in description logics"):
  with members:
    - "simulations and bisimulations for coalgebraic modal logics"
    - "model theoretic characterisations of description logics"
    - "description logic tboxes model theoretic characterizations and rewritability"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.LO(Logic in Computer Science)