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 program level approach to revising logic programs under the answer set semantics"
  Abstract: An approach to the revision of logic programs under the answer set semantics is presented. For programs P and Q, the goal is to determine the answer sets that correspond to the revision of P by Q, denoted P * Q. A fundamental principle of classical (AGM) revision, and the one that guides the approach here, is the success postulate. In AGM revision, this stipulates that A is in K * A. By analogy with the success postulate, for programs P and Q, this means that the answer sets of Q will in some sense be contained in those of P * Q. The essential idea is that for P * Q, a three-valued answer set for Q, consisting of positive and negative literals, is first determined. The positive literals constitute a regular answer set, while the negated literals make up a minimal set of naf literals required to produce the answer set from Q. These literals are propagated to the program P, along with those rules of Q that are not decided by these literals. The approach differs from work in update logic programs in two main respects. First, we ensure that the revising logic program has higher priority, and so we satisfy the success postulate; second, for the preference implicit in a revision P * Q, the program Q as a whole takes precedence over P, unlike update logic programs, since answer sets of Q are propagated to P. We show that a core group of the AGM postulates are satisfied, as are the postulates that have been proposed for update logic programs.

Connected through hyperedge HE-1 (induced by source paper "syntax preserving belief change operators for logic programs"):
  with members:
    - "characterization of logic program revision as an extension of propositional revision"
    - "the rise and fall of semantic rule updates based on se models"
    - "updates in answer set programming an approach based on basic structural properties"
    - "strong equivalence made easy nested expressions and weight constraints"
    - "a semantic framework for preference handling in answer set programming"
    - "a framework for compiling preferences in logic programs"
    - "on properties of update sequences based on causal rejection"

Connected through hyperedge HE-2 (induced by source paper "the rise and fall of semantic rule updates based on se models"):
  with members:
    - "splitting and updating hybrid knowledge bases"
    - "propositional theories are strongly equivalent to logic programs"
    - "updates in answer set programming an approach based on basic structural properties"
    - "an abductive framework for computing knowledge base updates"
    - "strong equivalence made easy nested expressions and weight constraints"
    - "on properties of update sequences based on causal rejection"

Connected through hyperedge HE-3 (induced by source paper "revision of defeasible logic preferences"):
  with members:
    - "embedding defeasible logic into logic programming"
    - "propositional defeasible logic has linear complexity"
    - "representation results for defeasible logic"
    - "well founded semantics for extended logic programs with dynamic preferences"

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)