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 new rule for ltl tableaux"
  Abstract: Propositional linear time temporal logic (LTL) is the standard temporal logic for computing applications and many reasoning techniques and tools have been developed for it. Tableaux for deciding satisfiability have existed since the 1980s. However, the tableaux for this logic do not look like traditional tree-shaped tableau systems and their processing is often quite complicated. #R##N#In this paper, we introduce a novel style of tableau rule which supports a new simple traditional-style tree-shaped tableau for LTL. We prove that it is sound and complete. As well as being simple to understand, to introduce to students and to use, it is also simple to implement and is competitive against state of the art systems. It is particularly suitable for parallel implementations.

Connected through hyperedge HE-1 (induced by source paper "timeline based planning expressiveness and complexity"):
  with members:
    - "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"
    - "clausal temporal resolution"
    - "the computational complexity of probabilistic planning"

Connected through hyperedge HE-2 (induced by source paper "one pass and tree shaped tableau systems for tptl and tptlb past"):
  with members:
    - "a parallel linear temporal logic tableau"

Connected through hyperedge HE-3 (induced by source paper "a parallel linear temporal logic tableau"):
  with members:
    - "sat based explicit ltl reasoning"
    - "fast ltl satisfiability checking by sat solvers"
    - "polsat a portfolio ltl satisfiability solver"

Connected through hyperedge HE-4 (induced by source paper "tableaux for policy synthesis for mdps with pctl constraints"):
  with members:
    - "a traditional tree style tableau for ltl"
    - "optimal control of mdps with temporal logic constraints"

Connected through hyperedge HE-5 (induced by source paper "ltl semantic tableaux and alternating omega automata via linear factors"):
  with members:
    - "partial derivative automaton for regular expressions with shuffle"
    - "from ltl to deterministic automata a safraless compositional approach"

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)