Incomplete deductive databases

DOI10.1007/BF01530927zbMath0875.68318MaRDI QIDQ1360679

Tomasz Imielinski

Publication date: 27 October 1997

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

zbMATH Keywords

query processingCoNP completeness

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (4)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Querying logical databases
• Inclusion dependencies and their interaction with functional dependencies
• The implication and finite implication problems for typed template dependencies
• Incomplete Information in Relational Databases
• A Proof Procedure for Data Dependencies
• Contributions to the Theory of Logic Programming
• A relational model of data for large shared data banks

This page was built for publication: Incomplete deductive databases