Querying logical databases
From MaRDI portal
Publication:579967
DOI10.1016/0022-0000(86)90016-4zbMATH Open0625.68079OpenAlexW2032728598MaRDI QIDQ579967FDOQ579967
Authors: 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
Recommendations
approximation algorithmrelational databasesdatabase managementclosed-world databases with unknown valuescomplexity of evaluating queries in logical databases
Cites Work
Cited In (16)
- Querying disjunctive databases through nonmonotonic logics
- Title not available (Why is that?)
- Towards an algebraic theory of information integration
- The complexity of querying indefinite data about linearly ordered domains
- Title not available (Why is that?)
- On the representation and querying of sets of possible worlds
- Intuitionistic interpretation of deductive databases with incomplete information
- Incomplete deductive databases
- The complexity of query evaluation in indefinite temporal constraint databases
- Tractable reasoning via approximation
- Simulating Dynamic Systems Using Linear Time Calculus Theories
- Dynamic query interpretation in relational databases
- Paraconsistent logic and query answering in inconsistent databases
- The complexity of propositional closed world reasoning and circumscription
- Title not available (Why is that?)
- Recursively indefinite databases
This page was built for publication: Querying logical databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579967)