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: "separation logic modulo theories"
  Abstract: Logical reasoning about program data often requires dealing with heap structures as well as scalar data types. Recent advances in Satisfiability Modular Theory (SMT) already offer efficient procedures for dealing with scalars, yet they lack any support for dealing with heap structures. In this paper, we present an approach that integrates Separation Logic---a prominent logic for reasoning about list segments on the heap---and SMT. We follow a model-based approach that communicates aliasing among heap cells between the SMT solver and the Separation Logic reasoning part. An experimental evaluation using the Z3 solver indicates that our approach can effectively put to work the advances in SMT for dealing with heap structures. This is the first decision procedure for the combination of separation logic with SMT theories.

Connected through hyperedge HE-1 (induced by source paper "automated lemma synthesis in symbolic heap separation logic"):
  with members:
    - "automated mutual explicit induction proof in separation logic"
    - "on automated lemma generation for separation logic with inductive definitions"
    - "deciding entailments in inductive separation logic with tree automata"
    - "the tree width of separation logic with recursive definitions"

Connected through hyperedge HE-2 (induced by source paper "unified reasoning about robustness properties of symbolic heap separation logic"):
  with members:
    - "deciding entailments in inductive separation logic with tree automata"
    - "inference of field sensitive reachability and cyclicity"
    - "the tree width of separation logic with recursive definitions"

Connected through hyperedge HE-3 (induced by source paper "automated mutual explicit induction proof in separation logic"):
  with members:
    - "on automated lemma generation for separation logic with inductive definitions"
    - "deciding entailments in inductive separation logic with tree automata"
    - "the tree width of separation logic with recursive definitions"

Connected through hyperedge HE-4 (induced by source paper "deciding entailments in inductive separation logic with tree automata"):
  with members:
    - "the tree width of separation logic with recursive definitions"

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)