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: "constraint programming viewed as rule based programming"
  Abstract: We study here a natural situation when constraint programming can be entirely reduced to rule-based programming. To this end we explain first how one can compute on constraint satisfaction problems using rules represented by simple first-order formulas. Then we consider constraint satisfaction problems that are based on predefined, explicitly given constraints. To solve them we first derive rules from these explicitly given constraints and limit the computation process to a repeated application of these rules, combined with labeling.We consider here two types of rules. The first type, that we call equality rules, leads to a new notion of local consistency, called {\em rule consistency} that turns out to be weaker than arc consistency for constraints of arbitrary arity (called hyper-arc consistency in \cite{MS98b}). For Boolean constraints rule consistency coincides with the closure under the well-known propagation rules for Boolean constraints. The second type of rules, that we call membership rules, yields a rule-based characterization of arc consistency. To show feasibility of this rule-based approach to constraint programming we show how both types of rules can be automatically generated, as {\tt CHR} rules of \cite{fruhwirth-constraint-95}. This yields an implementation of this approach to programming by means of constraint logic programming. We illustrate the usefulness of this approach to constraint programming by discussing various examples, including Boolean constraints, two typical examples of many valued logics, constraints dealing with Waltz's language for describing polyhedral scenes, and Allen's qualitative approach to temporal logic.

Connected through hyperedge HE-1 (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"
    - "automatic generation of chr constraint solvers"
    - "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"

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

Connected through hyperedge HE-3 (induced by source paper "schedulers and redundancy for a class of constraint propagation rules"):
  with members:
    - "the role of commutativity in constraint propagation algorithms"
    - "the essence of constraint propagation"

Connected through hyperedge HE-4 (induced by source paper "removing propagation redundant constraints in redundant modeling"):
  with members:
    - "dual modelling of permutation and injection problems"

Connected through hyperedge HE-5 (induced by source paper "schedulers for rule based constraint programming"):
  with members:
    - "the role of commutativity in constraint propagation algorithms"
    - "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.AI(Artificial Intelligence)