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: "propositional defeasible logic has linear complexity"
  Abstract: Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts markedly with most other propositional nonmonotonic logics, in which inference is intractable.

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"
    - "representation results for defeasible logic"
    - "a flexible framework for defeasible logics"

Connected through hyperedge HE-2 (induced by source paper "applications of linear defeasible logic combining resource consumption and exceptions to energy management and business processes"):
  with members:
    - "resource driven substructural defeasible logic"
    - "the rationale behind the concept of goal"
    - "representation results for defeasible logic"

Connected through hyperedge HE-3 (induced by source paper "annotated defeasible logic"):
  with members:
    - "the rationale behind the concept of goal"
    - "relative expressiveness of defeasible logics"
    - "interdefinability of defeasible logic and logic programming under the well founded semantics"
    - "a model theoretic semantics for defeasible logic"

Connected through hyperedge HE-4 (induced by source paper "enabling reasoning with legalruleml"):
  with members:
    - "a general account of argumentation with preferences"
    - "representation results for defeasible logic"
    - "a flexible framework for defeasible logics"

Connected through hyperedge HE-5 (induced by source paper "the rationale behind the concept of goal"):
  with members:
    - "computing strong and weak permissions in defeasible logic"
    - "representation results for defeasible logic"

Connected through hyperedge HE-6 (induced by source paper "disarm a social distributed agent reputation model based on defeasible logic"):
  with members:
    - "a generic trust framework for large scale open systems using machine learning"
    - "representation results for defeasible logic"

Connected through hyperedge HE-7 (induced by source paper "strategic argumentation is np complete"):
  with members:
    - "revision of defeasible logic preferences"
    - "representation results for defeasible logic"

Connected through hyperedge HE-8 (induced by source paper "computing strong and weak permissions in 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)