human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "repair based degrees of database inconsistency computation and complexity"):
  Abstract: We propose a generic numerical measure of the inconsistency of a database with respect to a set of integrity constraints. It is based on an abstract repair semantics. In particular, an inconsistency measure associated to cardinality-repairs is investigated in detail. More specifically, it is shown that it can be computed via answer-set programs, but sometimes its computation can be intractable in data complexity. However, polynomial-time deterministic and randomized approximations are exhibited. The behavior of this measure under small updates is analyzed, obtaining fixed-parameter tractability results. Furthermore, alternative inconsistency measures are proposed and discussed.

Includes members:
  Member "computing optimal repairs for functional dependencies":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complexity and efficient algorithms for data inconsistency evaluating and repairing")
  Member "consistency and trust in peer data exchange systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a logic framework for p2p deductive databases")
  Member "juggling functions inside a database":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rk means fast clustering for relational data")
  Member "achieving data privacy through secrecy views and null based virtual updates":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the causality repair connection in databases causality programs")
  Member "the complexity of causality and responsibility for query answers and non answers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "causality based explanation of classification outcomes")
  Member "prioritized repairing and consistent query answering in relational databases":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "querying and repairing inconsistent prioritized knowledge bases complexity analysis and links with abstract argumentation")
  Member "the dlv system for knowledge representation and reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the seventh answer set programming competition design and results")
  Member "complexity of consistent query answering in databases under cardinality based and incremental repair semantics":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "querying and repairing inconsistent prioritized knowledge bases complexity analysis and links with abstract argumentation")

Question: Please tell me which class the source paper 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)