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: "the ciff proof procedure for abductive logic programming with constraints theory implementation and experiments"
  Abstract: We present the CIFF proof procedure for abductive logic programming with constraints, and we prove its correctness. CIFF is an extension of the IFF proof procedure for abductive logic programming, relaxing the original restrictions over variable quantification (allowedness conditions) and incorporating a constraint solver to deal with numerical constraints as in constraint logic programming. Finally, we describe the CIFF system, comparing it with state of the art abductive systems and answer set solvers and showing how to use it to program some applications. (To appear in Theory and Practice of Logic Programming - TPLP).

Connected through hyperedge HE-1 (induced by source paper "programming in logic without logic programming"):
  with members:
    - "transaction logic with complex events"
    - "flux a logic programming method for reasoning agents"

Connected through hyperedge HE-2 (induced by source paper "abducing compliance of incomplete event logs"):
  with members:
    - "verification of relational data centric dynamic systems with external services"

Connected through hyperedge HE-3 (induced by source paper "modeling variations of first order horn abduction in answer set programming using on demand constraints and flexible value invention"):
  with members:
    - "a model building framework for answer set programming with external computations"
    - "modeling variations of first order horn abduction in answer set programming"
    - "asperix a first order forward chaining approach for answer set computing"
    - "lazy model expansion interleaving grounding with search"
    - "clingo asp control preliminary report"

Connected through hyperedge HE-4 (induced by source paper "towards a logic based unifying framework for computing"):
  with members:
    - "autonomous agents coordination action languages meet clp fd and linda"
    - "flux a logic programming method for reasoning agents"

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)