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: "properties and applications of programs with monotone and convex constraints"
  Abstract: We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of strong and uniform equivalence with their characterizations, tight programs and Fages Lemma, program completion and loop formulas. Our results provide an abstract account of properties of some recent extensions of logic programming with aggregates, especially the formalism of lparse programs. They imply a method to compute stable models of lparse programs by means of off-the-shelf solvers of pseudo-boolean constraints, which is often much faster than the smodels system.

Connected through hyperedge HE-1 (induced by source paper "rewriting recursive aggregates in answer set programming back to monotonicity"):
  with members:
    - "anytime computation of cautious consequences in answer set programming"
    - "vicious circle principle and logic programs with aggregates"
    - "conflict driven asp solving with external sources"
    - "unfounded sets and well founded semantics of answer set programs with aggregates"
    - "relating weight constraint and aggregate programs semantics and representation"
    - "logic programs with propositional connectives and aggregates"
    - "design and implementation of aggregate functions in the dlv system"
    - "well founded and stable semantics of logic programs with aggregates"

Connected through hyperedge HE-2 (induced by source paper "complexity and compilation of gz aggregates in answer set programming"):
  with members:
    - "anytime computation of cautious consequences in answer set programming"
    - "vicious circle principle and logic programs with aggregates"
    - "logic programs with propositional connectives and aggregates"
    - "design and implementation of aggregate functions in the dlv system"
    - "well founded and stable semantics of logic programs with aggregates"

Connected through hyperedge HE-3 (induced by source paper "semantics and compilation of answer set programming with generalized atoms"):
  with members:
    - "design and implementation of aggregate functions in the dlv system"
    - "a constructive semantic characterization of aggregates in asp"
    - "well founded and stable semantics of logic programs with aggregates"

Connected through hyperedge HE-4 (induced by source paper "properties of answer set programming with convex generalized atoms"):
  with members:
    - "unfounded sets and well founded semantics of answer set programs with aggregates"
    - "answer sets for logic programs with arbitrary abstract constraint atoms"
    - "a constructive semantic characterization of aggregates in asp"
    - "well founded and stable semantics of logic programs with aggregates"
    - "logic programs with monotone cardinality atoms"

Connected through hyperedge HE-5 (induced by source paper "unfounded sets and well founded semantics of answer set programs with aggregates"):
  with members:
    - "team building with answer set programming in the gioia tauro seaport"
    - "consistent query answering via asp from different perspectives theory and practice"
    - "xsb extending prolog with tabled logic programming"
    - "logic programs with propositional connectives and aggregates"
    - "answer sets for logic programs with arbitrary abstract constraint atoms"
    - "the dlv system for knowledge representation and reasoning"
    - "well founded and stable semantics of logic programs with aggregates"
    - "well founded semantics for extended logic programs with dynamic preferences"

Connected through hyperedge HE-6 (induced by source paper "relating weight constraint and aggregate programs semantics and representation"):
  with members:
    - "characterizations of stable model semantics for logic programs with arbitrary constraint atoms"
    - "answer sets for logic programs with arbitrary abstract constraint atoms"
    - "well founded and stable semantics of logic programs with aggregates"
    - "weight constraints as nested expressions"

Connected through hyperedge HE-7 (induced by source paper "first order stable model semantics and first order loop formulas"):
  with members:
    - "on elementary loops of logic programs"

Connected through hyperedge HE-8 (induced by source paper "on elementary loops of logic programs"):
  with members:
    - "modularity aspects of disjunctive stable models"
    - "on the complexity of identifying head elementary set free programs"
    - "the dlv system for knowledge representation and reasoning"
    - "tight logic programs"
    - "unfolding partiality and disjunctions in stable model semantics"

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)