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: "bounded reachability for temporal logic over constraint systems"
  Abstract: We present CLTLB(D), an extension of PLTLB (PLTL with both past and future operators) augmented with atomic formulae built over a constraint system D. Even for decidable constraint systems, satisfiability and Model Checking problem of such logic can be undecidable. We introduce suitable restrictions and assumptions that are shown to make the satisfiability problem for the extended logic decidable. Moreover for a large class of constraint systems we propose an encoding that realize an effective decision procedure for the Bounded Reachability problem.

Connected through hyperedge HE-1 (induced by source paper "reactive integrated mission and motion planning"):
  with members:
    - "formal verification of obstacle avoidance and navigation of ground robots"

Connected through hyperedge HE-2 (induced by source paper "combined top down and bottom up approaches to performance guaranteed integrated task and motion planning of cooperative multi agent systems"):
  with members:
    - "formal design of robot integrated task and motion planning"
    - "multi agent planning under local ltl specifications and event based synchronization"
    - "sampling based algorithms for optimal motion planning"

Connected through hyperedge HE-3 (induced by source paper "deciding the satisfiability of mitl specifications"):
  with members:
    - "constraint ltl satisfiability checking without automata"
    - "on timed automata with input determined guards"

Connected through hyperedge HE-4 (induced by source paper "non null infinitesimal micro steps a metric temporal logic approach"):
  with members:
    - "a theory of sampling for continuous time metric temporal logic"
    - "modeling time in computing a taxonomy and a comparative survey"

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)