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 "enhancing magic sets with an application to ontological reasoning"):
  Abstract: Magic sets are a Datalog to Datalog rewriting technique to optimize query answering. The rewritten program focuses on a portion of the stable model(s) of the input program which is sufficient to answer the given query. However, the rewriting may introduce new recursive definitions, which can involve even negation and aggregations, and may slow down program evaluation. This paper enhances the magic set technique by preventing the creation of (new) recursive definitions in the rewritten program. It turns out that the new version of magic sets is closed for Datalog programs with stratified negation and aggregations, which is very convenient to obtain efficient computation of the stable model of the rewritten program. Moreover, the rewritten program is further optimized by the elimination of subsumed rules and by the efficient handling of the cases where binding propagation is lost. The research was stimulated by a challenge on the exploitation of Datalog/\textsc{dlv} for efficient reasoning on large ontologies. All proposed techniques have been hence implemented in the \textsc{dlv} system, and tested for ontological reasoning, confirming their effectiveness. #R##N#Under consideration for publication in Theory and Practice of Logic Programming.

Includes members:
  Member "shared aggregate sets in answer set programming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the external interface for extending wasp")
  Member "cautious reasoning in asp via minimal models and unsatisfiable cores":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "abstract solvers for computing cautious consequences of asp programs")
  Member "anytime answer set optimization via unsatisfiable core shrinking":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficiently coupling the i dlv grounder with asp solvers")
  Member "rewriting recursive aggregates in answer set programming back to monotonicity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an asp semantics for constraints involving conditional aggregates")
  Member "anytime computation of cautious consequences in answer set programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "abstract solvers for computing cautious consequences of asp programs")
  Member "vicious circle principle and logic programs with aggregates":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an asp semantics for constraints involving conditional aggregates")
  Member "complexity of super coherence problems in asp":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "shared aggregate sets in answer set programming")
  Member "logic programs with propositional connectives and aggregates":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "an asp semantics for constraints involving conditional aggregates")

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)