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 "consistency checking and querying in probabilistic databases under integrity constraints"):
  Abstract: We address the issue of incorporating a particular yet expressive form of integrity constraints (namely, denial constraints) into probabilistic databases. To this aim, we move away from the common way of giving semantics to probabilistic databases, which relies on considering a unique interpretation of the data, and address two fundamental problems: consistency checking and query evaluation. The former consists in verifying whether there is an interpretation which conforms to both the marginal probabilities of the tuples and the integrity constraints. The latter is the problem of answering queries under a "cautious" paradigm, taking into account all interpretations of the data in accordance with the constraints. In this setting, we investigate the complexity of the above-mentioned problems, and identify several tractable cases of practical relevance.

Includes members:
  Member "probabilistic description logics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "probabilistic dl reasoning with pinpointing formulas a prolog based approach")
  Member "consensus answers for queries over probabilistic databases":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "store location selection via mining search query logs of baidu maps")
  Member "conditioning probabilistic databases":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "infinite probabilistic databases")
  Member "the dichotomy of conjunctive queries on probabilistic structures":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "uncertainty annotated databases a lightweight approach for approximating certain answers extended version")
  Member "probabilistic deduction with conditional constraints over basic events":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "probabilistic reasoning in the description logic alcp with the principle of maximum entropy full version")

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)