human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "answer sets for logic programs with arbitrary abstract constraint atoms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "vicious circle principle and logic programs with aggregates")
  Member "well founded and stable semantics of logic programs with aggregates":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "selp a single shot epistemic logic program solver")
  Member "weight constraints as nested expressions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "strong equivalence and program s structure in arguing essential equivalence between logic programs")
  Member "tight logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a formal framework for robot construction problems a hybrid planning approach")
  Member "strong equivalence made easy nested expressions and weight constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on uniform equivalence of epistemic logic programs")
  Member "local search techniques for propositional logic extended with cardinality constraints":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "logic programs with monotone cardinality atoms")

Question: Please tell me which class the source paper 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)