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 flexible framework for defeasible logics"
  Abstract: Logics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution to this problem is to choose from several logics and, when necessary, combine the representations. In general, such an approach results in a very difficult problem of combination. However, if we can choose the logics from a uniform framework then the problem of combining them is greatly simplified. In this paper, we develop such a framework for defeasible logics. It supports all defeasible logics that satisfy a strong negation principle. We use logic meta-programs as the basis for the framework.

Connected through hyperedge HE-1 (induced by source paper "rethinking defeasible reasoning a scalable approach"):
  with members:
    - "annotated defeasible logic"
    - "efficient computation of the well founded semantics over big data"
    - "computing strong and weak permissions in defeasible logic"
    - "relative expressiveness of defeasible logics"
    - "propositional defeasible logic has linear complexity"
    - "representation results for defeasible logic"

Connected through hyperedge HE-2 (induced by source paper "enabling reasoning with legalruleml"):
  with members:
    - "a general account of argumentation with preferences"
    - "propositional defeasible logic has linear complexity"
    - "representation results for defeasible logic"

Connected through hyperedge HE-3 (induced by source paper "relative expressiveness of defeasible logics"):
  with members:
    - "embedding defeasible logic into logic programming"
    - "propositional defeasible logic has linear complexity"
    - "representation results for defeasible logic"

Connected through hyperedge HE-4 (induced by source paper "embedding defeasible logic into logic programming"):
  with members:
    - "propositional defeasible logic has linear complexity"
    - "a model theoretic semantics for defeasible logic"
    - "representation results for defeasible logic"

Connected through hyperedge HE-5 (induced by source paper "propositional defeasible logic has linear complexity"):
  with members:
    - "representation results for defeasible logic"

Connected through hyperedge HE-6 (induced by source paper "preferred well founded semantics for logic programming by alternating fixpoints preliminary report"):
  with members:
    - "disjunctive logic programs with inheritance"
    - "logic programs with compiled preferences"
    - "representation results for defeasible logic"
    - "well founded semantics for extended logic programs with dynamic preferences"

Connected through hyperedge HE-7 (induced by source paper "a model theoretic semantics for defeasible logic"):
  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)