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 complete and terminating execution model for constraint handling rules"
  Abstract: We observe that the various formulations of the operational semantics of Constraint Handling Rules proposed over the years fall into a spectrum ranging from the analytical to the pragmatic. While existing analytical formulations facilitate program analysis and formal proofs of program properties, they cannot be implemented as is. We propose a novel operational semantics, which has a strong analytical foundation, while featuring a terminating execution model. We prove its soundness and completeness with respect to existing analytical formulations and we provide an implementation in the form of a source-to-source transformation to CHR with rule priorities.

Connected through hyperedge HE-1 (induced by source paper "constraint handling rules what else"):
  with members:
    - "linear logic based analysis of constraint handling rules with disjunction"
    - "automatic generation of chr constraint solvers"

Connected through hyperedge HE-2 (induced by source paper "on proving confluence modulo equivalence for constraint handling rules"):
  with members:
    - "diagrammatic confluence for constraint handling rules"
    - "as time goes by constraint handling rules a survey of chr research from 1998 to 2007"

Connected through hyperedge HE-3 (induced by source paper "a linear logic programming language for concurrent programming over graph structures"):
  with members:
    - "linear logic based analysis of constraint handling rules with disjunction"
    - "robust vacuity for branching temporal logic"
    - "graphlab a new framework for parallel machine learning"
    - "least and greatest fixed points in linear logic"

Connected through hyperedge HE-4 (induced by source paper "co inductive semantics for constraint handling rules"):
  with members:
    - "a compositional semantics for chr"

Connected through hyperedge HE-5 (induced by source paper "creole a universal language for creating requesting updating and deleting resources"):
  with members:
    - "greedy algorithms in datalog"

Connected through hyperedge HE-6 (induced by source paper "linear logic based analysis of constraint handling rules with disjunction"):
  with members:
    - "automatic generation of chr constraint solvers"

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)