Querying logical databases
From MaRDI portal
Publication:579967
DOI10.1016/0022-0000(86)90016-4zbMath0625.68079MaRDI QIDQ579967
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
approximation algorithm; relational databases; database management; closed-world databases with unknown values; complexity of evaluating queries in logical databases
68P20: Information storage and retrieval of data
Related Items
The complexity of querying indefinite data about linearly ordered domains, Recursively indefinite databases, Towards an algebraic theory of information integration, On the representation and querying of sets of possible worlds, 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, Tractable reasoning via approximation
Cites Work