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 "logic programs with propositional connectives and aggregates"):
  Abstract: Answer set programming (ASP) is a logic programming paradigm that can be used to solve complex combinatorial search problems. Aggregates are an ASP construct that plays an important role in many applications. Defining a satisfactory semantics of aggregates turned out to be a difficult problem, and in this paper we propose a new approach, based on an analogy between aggregates and propositional connectives. First, we extend the definition of an answer set/stable model to cover arbitrary propositional theories; then we define aggregates on top of them both as primitive constructs and as abbreviations for formulas. Our definition of an aggregate combines expressiveness and simplicity, and it inherits many theorems about programs with nested expressions, such as theorems about strong equivalence and splitting.

Includes members:
  Member "propositional theories are strongly equivalent to logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "implementing dynamic answer set programming")
  Member "answer sets for logic programs with arbitrary abstract constraint atoms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (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-4 (induced by source paper "strong equivalence and program s structure in arguing essential equivalence between logic programs")
  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 "ultimate approximations in nonmonotonic knowledge representation systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "from fuzzy to annotated semantic web languages")
  Member "des a challenge problem for nonmonotonic reasoning systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "smodels a system for answer set programming")
  Member "stable models and an alternative logic programming paradigm":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the seventh answer set programming competition design and results")

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)