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 "unfounded sets and well founded semantics of answer set programs with aggregates"):
  Abstract: Logic programs with aggregates (LPA) are one of the major linguistic extensions to Logic Programming (LP). In this work, we propose a generalization of the notions of unfounded set and well-founded semantics for programs with monotone and antimonotone aggregates (LPm,aA programs). In particular, we present a new notion of unfounded set for LPm,aA programs, which is a sound generalization of the original definition for standard (aggregate-free) LP. On this basis, we define a well-founded operator for LPm,aA programs, the fixpoint of which is called well-founded model (or well-founded semantics) for LPm,aA programs. The most important properties of unfounded sets and the well-founded semantics for standard LP are retained by this generalization, notably existence and uniqueness of the well-founded model, together with a strong relationship to the answer set semantics for LPm,aA programs. We show that one of the D-well-founded semantics, defined by Pelov, Denecker, and Bruynooghe for a broader class of aggregates using approximating operators, coincides with the well-founded model as defined in this work on LPm,aA programs. We also discuss some complexity issues, most importantly we give a formal proof of tractable computation of the well-founded model for LPm,aA programs. Moreover, we prove that for general LPA programs, which may contain aggregates that are neither monotone nor antimonotone, deciding satisfaction of aggregate expressions with respect to partial interpretations is coNP-complete. As a consequence, a well-founded semantics for general LPA programs that allows for tractable computation is unlikely to exist, which justifies the restriction on LPm,aA programs. Finally, we present a prototype system extending DLV, which supports the well-founded semantics for LPm,aA programs, at the time of writing the only implemented system that does so. Experiments with this prototype show significant computational advantages of aggregate constructs over equivalent aggregate-free encodings.

Includes members:
  Member "team building with answer set programming in the gioia tauro seaport":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficiently coupling the i dlv grounder with asp solvers")
  Member "consistent query answering via asp from different perspectives theory and practice":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the external interface for extending wasp")
  Member "xsb extending prolog with tabled logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tabled typeclass resolution")
  Member "logic programs with propositional connectives and aggregates":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an asp semantics for constraints involving conditional aggregates")
  Member "answer sets for logic programs with arbitrary abstract constraint atoms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "vicious circle principle and logic programs with aggregates")
  Member "properties and applications of programs with monotone and convex constraints":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "rewriting recursive aggregates in answer set programming back to monotonicity")
  Member "the dlv system for knowledge representation and reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the seventh answer set programming competition design and results")
  Member "well founded and stable semantics of logic programs with aggregates":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "selp a single shot epistemic logic program solver")

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.LO(Logic in Computer Science)