Programming with non-determinism in deductive databases

DOI10.1023/A:1018999404360MaRDI QIDQ1370628zbMATH OpenFDO

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

Publication date 26 October 1997

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

Full work available at URL https://doi.org/10.1023/A:1018999404360

zbMATH Keywords

deductive databases

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Semantics and expressive power of nondeterministic constructs in deductive databases
• Non-determinism in databases
• Nondeterminism through well-founded choice
• The deductive database system [Lscr ][Dscr ][Lscr ]++

Cited in

(14)

• Reasoning with minimal models: efficient algorithms and applications
• Non-determinism in databases
• Scalar aggregation in inconsistent databases.
• Minimal-change integrity maintenance using tuple deletions
• Deductive databases for computing certain and consistent answers from mediated data integration systems
• Nonmonotonic inheritance in object-oriented deductive database languages
• scientific article; zbMATH DE number 3876562 (Why is no real title available?)
• scientific article; zbMATH DE number 1406215 (Why is no real title available?)
• Foundations of Information and Knowledge Systems
• Semantics and expressive power of nondeterministic constructs in deductive databases
• 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
• The Choice Construct in the Soufflé Language
• Declarative approaches to counterfactual explanations for classification

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)