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: "new polynomial classes for logic based abduction"
  Abstract: We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given propositional knowledge base. We give a general algorithm, based on the notion of projection; then we study restrictions over the representations of the knowledge base and of the query, and find new polynomial classes of abduction problems.

Connected through hyperedge HE-1 (induced by source paper "dynamics of belief abduction horn knowledge base and database updates"):
  with members:
    - "comparative study of view update algorithms in rational choice theory"
    - "on the complexity of second best abductive explanations"
    - "a new rational algorithm for view updating in relational databases"
    - "an abductive framework for horn knowledge base dynamics"
    - "a rational and efficient algorithm for view revision in databases"
    - "each normal logic program has a 2 valued minimal hypotheses semantics"
    - "admissible and restrained revision"
    - "coherent integration of databases by abductive logic programming"

Connected through hyperedge HE-2 (induced by source paper "an abductive framework for horn knowledge base dynamics"):
  with members:
    - "comparative study of view update algorithms in rational choice theory"
    - "on the complexity of second best abductive explanations"
    - "a new rational algorithm for view updating in relational databases"
    - "the view update problem for indefinite databases"
    - "each normal logic program has a 2 valued minimal hypotheses semantics"
    - "compilability of propositional abduction"
    - "an abductive framework for computing knowledge base updates"
    - "coherent integration of databases by abductive logic programming"

Connected through hyperedge HE-3 (induced by source paper "complexity classifications for propositional abduction in post s framework"):
  with members:
    - "the complexity of propositional implication"
    - "the complexity of reasoning for fragments of default logic"
    - "the complexity of generalized satisfiability for linear temporal logic"

Connected through hyperedge HE-4 (induced by source paper "complexity of propositional abduction for restricted sets of boolean functions"):
  with members:
    - "the complexity of propositional implication"
    - "the complexity of reasoning for fragments of default logic"
    - "generalized modal satisfiability"
    - "the complexity of generalized satisfiability for linear temporal logic"

Connected through hyperedge HE-5 (induced by source paper "compilability of propositional abduction"):
  with members:
    - "a knowledge compilation map"
    - "space efficiency of propositional knowledge representation formalisms"

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)