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: "automatic generation of chr constraint solvers"
  Abstract: In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tabled resolution for constraint logic programming, in order to check the validity of the rules. Compared to previous works where different methods for automatic generation of constraint solvers have been proposed, our approach enables the generation of more expressive rules (even recursive and splitting rules) that can be used directly as CHR solvers.

Connected through hyperedge HE-1 (induced by source paper "constraint handling rules what else"):
  with members:
    - "a complete and terminating execution model for constraint handling rules"
    - "linear logic based analysis of constraint handling rules with disjunction"

Connected through hyperedge HE-2 (induced by source paper "linear logic based analysis of constraint handling rules with disjunction"):
  with members:
    - "a complete and terminating execution model for constraint handling rules"

Connected through hyperedge HE-3 (induced by source paper "as time goes by constraint handling rules a survey of chr research from 1998 to 2007"):
  with members:
    - "linear logic based analysis of constraint handling rules with disjunction"
    - "a compositional semantics for chr"
    - "acd term rewriting"
    - "optimizing compilation of constraint handling rules in hal"
    - "a chr based implementation of known arc consistency"
    - "intelligent search strategies based on adaptive constraint handling rules"
    - "flux a logic programming method for reasoning agents"
    - "security policy consistency"

Connected through hyperedge HE-4 (induced by source paper "explaining constraint programming"):
  with members:
    - "schedulers and redundancy for a class of constraint propagation rules"
    - "the role of commutativity in constraint propagation algorithms"
    - "constraint programming viewed as rule based programming"
    - "some remarks on boolean constraint propagation"
    - "a proof theoretic view of constraint programming"
    - "the essence of constraint propagation"

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)