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: "well founded semantics for extended logic programs with dynamic preferences"
  Abstract: The paper describes an extension of well-founded semantics for logic programs with two types of negation. In this extension information about preferences between rules can be expressed in the logical language and derived dynamically. This is achieved by using a reserved predicate symbol and a naming technique. Conflicts among rules are resolved whenever possible on the basis of derived preference information. The well-founded conclusions of prioritized logic programs can be computed in polynomial time. A legal reasoning example illustrates the usefulness of the approach.

Connected through hyperedge HE-1 (induced by source paper "a family of descriptive approaches to preferred answer sets"):
  with members:
    - "computing preferred answer sets by meta interpretation in answer set programming"
    - "a semantic framework for preference handling in answer set programming"
    - "a framework for compiling preferences in logic programs"

Connected through hyperedge HE-2 (induced by source paper "revision of defeasible logic preferences"):
  with members:
    - "a program level approach to revising logic programs under the answer set semantics"
    - "embedding defeasible logic into logic programming"
    - "propositional defeasible logic has linear complexity"
    - "representation results for defeasible logic"

Connected through hyperedge HE-3 (induced by source paper "unfounded sets and well founded semantics of answer set programs with aggregates"):
  with members:
    - "team building with answer set programming in the gioia tauro seaport"
    - "consistent query answering via asp from different perspectives theory and practice"
    - "xsb extending prolog with tabled logic programming"
    - "logic programs with propositional connectives and aggregates"
    - "answer sets for logic programs with arbitrary abstract constraint atoms"
    - "properties and applications of programs with monotone and convex constraints"
    - "the dlv system for knowledge representation and reasoning"
    - "well founded and stable semantics of logic programs with aggregates"

Connected through hyperedge HE-4 (induced by source paper "interdefinability of defeasible logic and logic programming under the well founded semantics"):
  with members:
    - "embedding defeasible logic into logic programming"
    - "preferred well founded semantics for logic programming by alternating fixpoints preliminary report"
    - "representation results for defeasible logic"

Connected through hyperedge HE-5 (induced by source paper "computing preferred answer sets by meta interpretation in answer set programming"):
  with members:
    - "on the expressibility of stable logic programming"
    - "answer set planning under action costs"
    - "logic programs with compiled preferences"
    - "smodels a system for answer set programming"

Connected through hyperedge HE-6 (induced by source paper "a semantic framework for preference handling in answer set programming"):
  with members:
    - "a framework for compiling preferences in logic programs"
    - "disjunctive logic programs with inheritance"
    - "preferred well founded semantics for logic programming by alternating fixpoints preliminary report"
    - "logic programs with compiled preferences"

Connected through hyperedge HE-7 (induced by source paper "a parameterised hierarchy of argumentation semantics for extended logic programming and its application to the well founded semantics"):
  with members:
    - "defeasible logic programming an argumentative approach"

Connected through hyperedge HE-8 (induced by source paper "defeasible logic programming an argumentative approach"):
  with members:
    - "representation results for defeasible logic"

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)