Querying logical databases

DOI10.1016/0022-0000(86)90016-4zbMath0625.68079OpenAlexW2032728598MaRDI QIDQ579967

Moshe Y. Vardi

Publication date: 1986

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(86)90016-4

zbMATH Keywords

approximation algorithmrelational databasesdatabase managementclosed-world databases with unknown valuescomplexity of evaluating queries in logical databases

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (12)

The complexity of propositional closed world reasoning and circumscription ⋮ Intuitionistic interpretation of deductive databases with incomplete information ⋮ Querying disjunctive databases through nonmonotonic logics ⋮ Incomplete deductive databases ⋮ The complexity of query evaluation in indefinite temporal constraint databases ⋮ Simulating Dynamic Systems Using Linear Time Calculus Theories ⋮ Paraconsistent logic and query answering in inconsistent databases ⋮ On the representation and querying of sets of possible worlds ⋮ The complexity of querying indefinite data about linearly ordered domains ⋮ Recursively indefinite databases ⋮ Towards an algebraic theory of information integration ⋮ Tractable reasoning via approximation

Cites Work

• Unnamed Item
• In memoriam Witold Lipski, jun. (1949--1985)
• A logic for default reasoning
• The polynomial-time hierarchy
• Null values in a relational data base
• Structure and complexity of relational queries
• The Semantics of Predicate Logic as a Programming Language

This page was built for publication: Querying logical databases