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 "the power of non ground rules in answer set programming"):
  Abstract: Answer set programming (ASP) is a well-established logic programming language that offers an intuitive, declarative syntax for problem solving. In its traditional application, a fixed ASP program for a given problem is designed and the actual instance of the problem is fed into the program as a set of facts. This approach typically results in programs with comparably short and simple rules. However, as is known from complexity analysis, such an approach limits the expressive power of ASP; in fact, an entire NP-check can be encoded into a single large rule body of bounded arity that performs both a guess and a check within the same rule. #R##N#Here, we propose a novel paradigm for encoding hard problems in ASP by making explicit use of large rules which depend on the actual instance of the problem. We illustrate how this new encoding paradigm can be used, providing examples of problems from the first, second, and even third level of the polynomial hierarchy. As state-of-the-art solvers are tuned towards short rules, rule decomposition is a key technique in the practical realization of our approach. We also provide some preliminary benchmarks which indicate that giving up the convenient way of specifying a fixed program can lead to a significant speed-up. #R##N#This paper is under consideration for acceptance into TPLP.

Includes members:
  Member "asperix a first order forward chaining approach for answer set computing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the seventh answer set programming competition design and results")
  Member "rewriting ontological queries into small nonrecursive datalog programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polynomial rewritings from expressive description logics with closed predicates to variants of datalog")
  Member "complex optimization in answer set programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "beyond np quantifying over answer sets")
  Member "towards automated integration of guess and check programs in answer set programming a meta interpreter and applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "plasp 3 towards effective asp planning")
  Member "unfolding partiality and disjunctions in stable model semantics":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards generating explanations for asp based link analysis using declarative program transformations")
  Member "stable models and an alternative logic programming paradigm":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)