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: "consistent query answering via asp from different perspectives theory and practice"
  Abstract: A data integration system provides transparent access to different data sources by suitably combining their data, and providing the user with a unified view of them, called global schema. However, source data are generally not under the control of the data integration process, thus integrated data may violate global integrity constraints even in presence of locally-consistent data sources. In this scenario, it may be anyway interesting to retrieve as much consistent information as possible. The process of answering user queries under global constraint violations is called consistent query answering (CQA). Several notions of CQA have been proposed, e.g., depending on whether integrated information is assumed to be sound, complete, exact or a variant of them. This paper provides a contribution in this setting: it uniforms solutions coming from different perspectives under a common ASP-based core, and provides query-driven optimizations designed for isolating and eliminating inefficiencies of the general approach for computing consistent answers. Moreover, the paper introduces some new theoretical results enriching existing knowledge on decidability and complexity of the considered problems. The effectiveness of the approach is evidenced by experimental results. #R##N#To appear in Theory and Practice of Logic Programming (TPLP).

Connected through hyperedge HE-1 (induced by source paper "the external interface for extending wasp"):
  with members:
    - "shared aggregate sets in answer set programming"
    - "constraint answer set solver ezcsp and why integration schemas matter"
    - "constraints lazy constraints or propagators in asp solving an empirical analysis"
    - "combining answer set programming and domain heuristics for solving hard industrial problems application paper"
    - "modeling variations of first order horn abduction in answer set programming"
    - "optimizing phylogenetic supertrees using answer set programming"
    - "generating explanations for biomedical queries"
    - "clingo asp control preliminary report"

Connected through hyperedge HE-2 (induced by source paper "abstract solvers for computing cautious consequences of asp programs"):
  with members:
    - "cautious reasoning in asp via minimal models and unsatisfiable cores"
    - "anytime answer set optimization via unsatisfiable core shrinking"
    - "anytime computation of cautious consequences in answer set programming"
    - "the third open answer set programming competition"
    - "transition systems for model generators a unifying approach"
    - "the dlv system for knowledge representation and reasoning"
    - "flux a logic programming method for reasoning agents"
    - "answer sets for consistent query answering in inconsistent databases"

Connected through hyperedge HE-3 (induced by source paper "a sat based system for consistent query answering"):
  with members:
    - "holoclean holistic data repairs with probabilistic inference"
    - "charting the tractability frontier of certain conjunctive query answering"
    - "answer sets for consistent query answering in inconsistent databases"

Connected through hyperedge HE-4 (induced by source paper "cautious reasoning in asp via minimal models and unsatisfiable cores"):
  with members:
    - "on the computation of paracoherent answer sets"
    - "model enumeration in propositional circumscription via unsatisfiable core analysis"
    - "combining answer set programming and domain heuristics for solving hard industrial problems application paper"
    - "anytime answer set optimization via unsatisfiable core shrinking"
    - "anytime computation of cautious consequences in answer set programming"
    - "the third open answer set programming competition"
    - "disjunctive asp with functions decidable queries and effective computation"
    - "the dlv system for knowledge representation and reasoning"

Connected through hyperedge HE-5 (induced by source paper "anytime computation of cautious consequences in answer set programming"):
  with members:
    - "the third open answer set programming competition"
    - "multi threaded asp solving with clasp"
    - "the dlv system for knowledge representation and reasoning"
    - "answer sets for consistent query answering in inconsistent databases"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-6 (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"
    - "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"
    - "well founded semantics for extended logic programs with dynamic preferences"

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)