Programming with non-determinism in deductive databases

DOI10.1023/A:1018999404360zbMATH Open0880.68030MaRDI QIDQ1370628

Carlo Zaniolo, Domenico Saccà, F. Giannotti, Sergio Greco

Publication date: 26 October 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

deductive databases

Mathematics Subject Classification ID

Database theory (68P15)

Cited In (10)

• Nonmonotonic inheritance in object-oriented deductive database languages
• Title not available (Why is that?)
• Semantics and expressive power of nondeterministic constructs in deductive databases
• Reasoning with minimal models: efficient algorithms and applications
• Minimal-change integrity maintenance using tuple deletions
• Deductive databases for computing certain and consistent answers from mediated data integration systems
• The Choice Construct in the Soufflé Language
• Answer-set programs for reasoning about counterfactual interventions and responsibility scores for classification
• Score-based explanations in data management and machine learning: an answer-set programming approach to counterfactual analysis
• Scalar aggregation in inconsistent databases.

This page was built for publication: Programming with non-determinism in deductive databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370628)