Incomplete deductive databases

DOI10.1007/BF01530927MaRDI QIDQ1360679zbMATH OpenFDO

Authors Tomasz Imielinski

Publication date 27 October 1997

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

Full work available at URL https://doi.org/10.1007/BF01530927

zbMATH Keywords

CoNP completenessquery processing

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• A Proof Procedure for Data Dependencies
• A relational model of data for large shared data banks
• Contributions to the Theory of Logic Programming
• scientific article; zbMATH DE number 3874667 (Why is no real title available?)
• scientific article; zbMATH DE number 3890770 (Why is no real title available?)
• scientific article; zbMATH DE number 3664336 (Why is no real title available?)
• scientific article; zbMATH DE number 3755910 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3032896 (Why is no real title available?)
• Inclusion dependencies and their interaction with functional dependencies
• Incomplete Information in Relational Databases
• Querying logical databases
• The implication and finite implication problems for typed template dependencies

Cited in

(4)

• Is intractability of nonmonotonic reasoning a real drawback?
• Dynamic maintenance of the transitive closure in disjunctive graphs
• Querying incomplete information in RDF with SPARQL
• Recursively indefinite databases

This page was built for publication: Incomplete deductive databases

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