The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases
From MaRDI portal
Publication:3839873
DOI10.1142/S0218196798000260zbMath0923.68046DBLPjournals/ijac/Revesz98OpenAlexW2041070750WikidataQ57641730 ScholiaQ57641730MaRDI QIDQ3839873
Publication date: 10 August 1998
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196798000260
Database theory (68P15) Knowledge representation (68T30) Boolean algebras (Boolean rings) (06E99) Information storage and retrieval of data (68P20)
Uses Software
Cites Work
This page was built for publication: The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases