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: "an abductive framework for computing knowledge base updates"
  Abstract: This paper introduces an abductive framework for updating knowledge bases represented by extended disjunctive programs. We first provide a simple transformation from abductive programs to update programs which are logic programs specifying changes on abductive hypotheses. Then, extended abduction, which was introduced by the same authors as a generalization of traditional abduction, is computed by the answer sets of update programs. Next, different types of updates, view updates and theory updates are characterized by abductive programs and computed by update programs. The task of consistency restoration is also realized as special cases of these updates. Each update problem is comparatively assessed from the computational complexity viewpoint. The result of this paper provides a uniform framework for different types of knowledge base updates, and each update is computed using existing procedures of logic programming.

Connected through hyperedge HE-1 (induced by source paper "exception based knowledge updates"):
  with members:
    - "the rise and fall of semantic rule updates based on se models"
    - "on the evolution of the instance level of dl lite knowledge bases"
    - "splitting and updating hybrid knowledge bases"
    - "updates in answer set programming an approach based on basic structural properties"
    - "strong equivalence made easy nested expressions and weight constraints"
    - "on properties of update sequences based on causal rejection"

Connected through hyperedge HE-2 (induced by source paper "when you must forget beyond strong persistence when forgetting in answer set programming"):
  with members:
    - "the rise and fall of semantic rule updates based on se models"
    - "the logical difference for the lightweight description logic el"
    - "a system of interaction and structure"
    - "on the practical use of variable elimination in constraint optimization problems still life as a case study"
    - "semantical characterizations and complexity of equivalences in answer set programming"
    - "propositional independence formula variable independence and forgetting"

Connected through hyperedge HE-3 (induced by source paper "characterization of logic program revision as an extension of propositional revision"):
  with members:
    - "the rise and fall of semantic rule updates based on se models"
    - "linear logic based analysis of constraint handling rules with disjunction"
    - "propositional theories are strongly equivalent to logic programs"
    - "strong equivalence made easy nested expressions and weight constraints"
    - "on properties of update sequences based on causal rejection"

Connected through hyperedge HE-4 (induced by source paper "propositional abduction with implicit hitting sets"):
  with members:
    - "efficient mus enumeration of horn formulae with applications to axiom pinpointing"
    - "algorithms for implicit hitting set problems"

Connected through hyperedge HE-5 (induced by source paper "a new rational algorithm for view updating in relational databases"):
  with members:
    - "comparative study of view update algorithms in rational choice theory"
    - "an abductive framework for horn knowledge base dynamics"
    - "a rational and efficient algorithm for view revision in databases"
    - "the view update problem for indefinite databases"
    - "on the abductive or deductive nature of database schema validation and update processing problems"

Connected through hyperedge HE-6 (induced by source paper "comparative study of view update algorithms in rational choice theory"):
  with members:
    - "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"
    - "the view update problem for indefinite databases"

Connected through hyperedge HE-7 (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"
    - "coherent integration of databases by abductive logic programming"
    - "new polynomial classes for logic based abduction"

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

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.DB(Databases)