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: "tight logic programs"
  Abstract: This note is about the relationship between two theories of negation as failure -- one based on program completion, the other based on stable models, or answer sets. Francois Fages showed that if a logic program satisfies a certain syntactic condition, which is now called ``tightness,'' then its stable models can be characterized as the models of its completion. We extend the definition of tightness and Fages' theorem to programs with nested expressions in the bodies of rules, and study tight logic programs containing the definition of the transitive closure of a predicate.

Connected through hyperedge HE-1 (induced by source paper "a formal framework for robot construction problems a hybrid planning approach"):
  with members:
    - "assembly sequence planning for motion planning"

Connected through hyperedge HE-2 (induced by source paper "technical report adjudication of coreference annotations via answer set optimization"):
  with members:
    - "asp core 2 input language format"
    - "marmara turkish coreference corpus and coreference resolution baseline"
    - "modeling variations of first order horn abduction in answer set programming"
    - "minimal change integrity maintenance using tuple deletions"

Connected through hyperedge HE-3 (induced by source paper "anthem transforming gringo programs into first order theories preliminary report"):
  with members:
    - "the dlv system for knowledge representation and reasoning"

Connected through hyperedge HE-4 (induced by source paper "solving stable matching problems using answer set programming"):
  with members:
    - "modeling stable matching problems with answer set programming"
    - "design and implementation of aggregate functions in the dlv system"

Connected through hyperedge HE-5 (induced by source paper "the design of the fifth answer set programming competition"):
  with members:
    - "preliminary report on wasp 2 0"
    - "translating answer set programs into bit vector logic"
    - "design and implementation of aggregate functions in the dlv system"
    - "the dlv system for knowledge representation and reasoning"
    - "unfolding partiality and disjunctions in stable model semantics"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-6 (induced by source paper "canonical logic programs are succinctly incomparable with propositional formulas"):
  with members:
    - "the succinctness of first order logic on linear orders"
    - "weight constraints as nested expressions"

Connected through hyperedge HE-7 (induced by source paper "lloyd topor completion and general stable models"):
  with members:
    - "first order stable model semantics and first order loop formulas"

Connected through hyperedge HE-8 (induced by source paper "reformulating the situation calculus and the event calculus in the general theory of stable models and in answer set programming"):
  with members:
    - "first order stable model semantics and first order loop formulas"
    - "propositional theories are strongly equivalent to logic programs"
    - "compiling causal theories to successor state axioms and strips like systems"
    - "stable models and an alternative logic programming paradigm"

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)