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: "clausal temporal resolution"
  Abstract: In this article, we examine how clausal resolution can be applied to a specific, but widely used, non-classical logic, namely discrete linear temporal logic. Thus, we first define a normal form for temporal formulae and show how arbitrary temporal formulae can be translated into the normal form, while preserving satisfiability. We then introduce novel resolution rules that can be applied to formulae in this normal form, provide a range of examples and examine the correctness and complexity of this approach is examined and. This clausal resolution approach. Finally, we describe related work and future developments concerning this work.

Connected through hyperedge HE-1 (induced by source paper "timeline based planning expressiveness and complexity"):
  with members:
    - "a new rule for ltl tableaux"
    - "sat based explicit ltl reasoning"
    - "an on the fly tableau based decision procedure for pdl satisfiability"
    - "modelling mixed discrete continuous domains for planning"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "the ff planning system fast plan generation through heuristic search"
    - "the computational complexity of probabilistic planning"

Connected through hyperedge HE-2 (induced by source paper "extracting unsatisfiable cores for ltl via temporal resolution"):
  with members:
    - "computing minimal sets on propositional formulae i problems reductions"
    - "resolution proof transformation for compression and interpolation"
    - "enhancing unsatisfiable cores for ltl with information on temporal relevance"
    - "on the complexity of computing minimal unsatisfiable ltl formulas"
    - "computing small unsatisfiable cores in satisfiability modulo theories"
    - "handling conflicts in depth first search for ltl tableau to debug compliance based languages"
    - "linear encodings of bounded ltl model checking"

Connected through hyperedge HE-3 (induced by source paper "strong backdoors for linear temporal logic"):
  with members:
    - "ltl fragments are hard for standard parameterisations"
    - "backdoors to normality for disjunctive logic programs"
    - "satisfiability of acyclic and almost acyclic cnf formulas"
    - "the complexity of clausal fragments of ltl"
    - "backdoors to satisfaction"
    - "backdoors to tractable answer set programming"
    - "the complexity of generalized satisfiability for linear temporal logic"

Connected through hyperedge HE-4 (induced by source paper "enhancing unsatisfiable cores for ltl with information on temporal relevance"):
  with members:
    - "extracting unsatisfiable cores for ltl via temporal resolution"
    - "a fully automatic problem solver with human style output"
    - "on the complexity of computing minimal unsatisfiable ltl formulas"
    - "computing small unsatisfiable cores in satisfiability modulo theories"
    - "handling conflicts in depth first search for ltl tableau to debug compliance based languages"

Connected through hyperedge HE-5 (induced by source paper "the complexity of clausal fragments of ltl"):
  with members:
    - "the dl lite family and relations"
    - "the complexity of generalized satisfiability for linear temporal logic"
    - "unary finite automata vs arithmetic progressions"

Connected through hyperedge HE-6 (induced by source paper "reducing validity in epistemic atl to validity in epistemic ctl"):
  with members:
    - "model checking atl under imperfect information and perfect recall semantics is undecidable"

Connected through hyperedge HE-7 (induced by source paper "a cookbook for temporal conceptual data modelling with description logics"):
  with members:
    - "the dl lite family and relations"
    - "the complexity of generalized satisfiability for linear temporal logic"
    - "unary finite automata vs arithmetic progressions"
    - "monodic temporal resolution"
    - "unifying class based representation formalisms"
    - "a temporal description logic for reasoning about actions and plans"

Connected through hyperedge HE-8 (induced by source paper "linear temporal logic and propositional schemata back and forth extended version"):
  with members:
    - "decidability and undecidability results for propositional schemata"

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)