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: "a cookbook for temporal conceptual data modelling with description logics"
  Abstract: We design temporal description logics suitable for reasoning about temporal conceptual data models and investigate their computational complexity. Our formalisms are based on DL-Lite logics with three types of concept inclusions (ranging from atomic concept inclusions and disjointness to the full Booleans), as well as cardinality constraints and role inclusions. In the temporal dimension, they capture future and past temporal operators on concepts, flexible and rigid roles, the operators `always' and `some time' on roles, data assertions for particular moments of time and global concept inclusions. The logics are interpreted over the Cartesian products of object domains and the flow of time (Z,<), satisfying the constant domain assumption. We prove that the most expressive of our temporal description logics (which can capture lifespan cardinalities and either qualitative or quantitative evolution constraints) turn out to be undecidable. However, by omitting some of the temporal operators on concepts/roles or by restricting the form of concept inclusions we obtain logics whose complexity ranges between PSpace and NLogSpace. These positive results were obtained by reduction to various clausal fragments of propositional temporal logic, which opens a way to employ propositional or first-order temporal provers for reasoning about temporal data models.

Connected through hyperedge HE-1 (induced by source paper "horn fragments of the halpern shoham interval temporal logic"):
  with members:
    - "undecidable propositional bimodal logics and one variable first order linear temporal logics with counting"
    - "the complexity of clausal fragments of ltl"
    - "interval temporal logics over strongly discrete linear orders the complete picture"
    - "two variable logic with two order relations"
    - "monodic temporal resolution"

Connected through hyperedge HE-2 (induced by source paper "querying log data with metric temporal logic"):
  with members:
    - "horn fragments of the halpern shoham interval temporal logic"
    - "on the decidability and complexity of some fragments of metric temporal logic"
    - "the complexity of clausal fragments of ltl"
    - "pspace reasoning for graded modal logics"

Connected through hyperedge HE-3 (induced by source paper "on sub propositional fragments of modal logic"):
  with members:
    - "horn fragments of the halpern shoham interval temporal logic"
    - "the complexity of clausal fragments of ltl"

Connected through hyperedge HE-4 (induced by source paper "on the expressive power of sub propositional fragments of modal logic"):
  with members:
    - "the complexity of clausal fragments of ltl"
    - "a pspace complete first order fragment of computability logic"

Connected through hyperedge HE-5 (induced by source paper "undecidable propositional bimodal logics and one variable first order linear temporal logics with counting"):
  with members:
    - "monodic temporal resolution"

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)