human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "a polynomial translation of logic programs with nested expressions into disjunctive logic programs preliminary report"
  Abstract: Nested logic programs have recently been introduced in order to allow for arbitrarily nested formulas in the heads and the bodies of logic program rules under the answer sets semantics. Nested expressions can be formed using conjunction, disjunction, as well as the negation as failure operator in an unrestricted fashion. This provides a very flexible and compact framework for knowledge representation and reasoning. Previous results show that nested logic programs can be transformed into standard (unnested) disjunctive logic programs in an elementary way, applying the negation as failure operator to body literals only. This is of great practical relevance since it allows us to evaluate nested logic programs by means of off-the-shelf disjunctive logic programming systems, like DLV. However, it turns out that this straightforward transformation results in an exponential blow-up in the worst-case, despite the fact that complexity results indicate that there is a polynomial translation among both formalisms. In this paper, we take up this challenge and provide a polynomial translation of logic programs with nested expressions into disjunctive logic programs. Moreover, we show that this translation is modular and (strongly) faithful. We have implemented both the straightforward as well as our advanced transformation; the resulting compiler serves as a front-end to DLV and is publicly available on the Web.

Connected through hyperedge HE-1 (induced by source paper "characterising equilibrium logic and nested logic programs reductions and complexity1 2"):
  with members:
    - "embedding non ground logic programs into autoepistemic logic for knowledge base combination"
    - "propositional theories are strongly equivalent to logic programs"
    - "a common view on strong uniform and other notions of equivalence in answer set programming"
    - "the dlv system for knowledge representation and reasoning"
    - "semantical characterizations and complexity of equivalences in answer set programming"
    - "tight logic programs"
    - "strong equivalence made easy nested expressions and weight constraints"
    - "characterization of strongly equivalent logic programs in intermediate logics"

Connected through hyperedge HE-2 (induced by source paper "the dlv system for knowledge representation and reasoning"):
  with members:
    - "unfolding partiality and disjunctions in stable model semantics"
    - "answer set planning under action costs"
    - "a logic programming approach to knowledge state planning ii the dlv k system"
    - "computing preferred answer sets by meta interpretation in answer set programming"
    - "disjunctive logic programs with inheritance"
    - "on properties of update sequences based on causal rejection"
    - "propositional satisfiability in answer set programming"
    - "dlv a system for declarative problem solving"

Connected through hyperedge HE-3 (induced by source paper "weight constraints as nested expressions"):
  with members:
    - "tight logic programs"
    - "strong equivalence made easy nested expressions and weight constraints"
    - "fages theorem and answer set programming"

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