The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases

DOI10.1142/S0218196798000260zbMath0923.68046DBLPjournals/ijac/Revesz98OpenAlexW2041070750WikidataQ57641730 ScholiaQ57641730MaRDI QIDQ3839873

Peter Z. Revesz

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

zbMATH Keywords

computational complexityconstraint databasesDatalogboolean algebrasstratified Datalog

Mathematics Subject Classification ID

Database theory (68P15) Knowledge representation (68T30) Boolean algebras (Boolean rings) (06E99) Information storage and retrieval of data (68P20)

Uses Software

• Datalog

Cites Work

• Embedding Boolean expressions into logic programming
• Complexity of Boolean algebras
• Negative Boolean constraints
• Boolean unification - the story so far
• Structure and complexity of relational queries

This page was built for publication: The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases