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 coinductive approach to proving reachability properties in logically constrained term rewriting systems"
  Abstract: We introduce a sound and complete coinductive proof system for reachability properties in transition systems generated by logically constrained term rewriting rules over an order-sorted signature modulo builtins. A key feature of the calculus is a circularity proof rule, which allows to obtain finite representations of the infinite coinductive proofs.

Connected through hyperedge HE-1 (induced by source paper "programming and symbolic computation in maude"):
  with members:
    - "formal verification of the yubikey and yubihsm apis in maude npa"
    - "cvc4 at the smt competition 2018"
    - "homeomorphic embedding modulo combinations of associativity and commutativity axioms"
    - "a constructor based reachability logic for rewrite theories"
    - "variant based decidable satisfiability in initial algebras with predicates"

Connected through hyperedge HE-2 (induced by source paper "operationally based program equivalence proofs using lctrss"):
  with members:
    - "a relational logic for higher order programs"
    - "verifying procedural programs via constrained rewriting induction"

Connected through hyperedge HE-3 (induced by source paper "co inductive proof systems for compositional proofs in reachability logic"):
  with members:
    - "a constructor based reachability logic for rewrite theories"

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)