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

DOI10.1142/S0218196798000260MaRDI QIDQ3839873zbMATH OpenOpenAlexDBLPWikidataFDO

Authors P. 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

boolean algebrascomputational complexityconstraint databasesDatalogstratified Datalog

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 219205
• A closed-form evaluation for Datalog queries with integer (gap)-order constraints
• scientific article; zbMATH DE number 1515855

Cites work

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

Cited in

(8)

• The complexity of query evaluation in indefinite temporal constraint databases
• Memoing evaluation for constraint extensions of datalog
• Efficient evaluation of specific queries in constraint databases
• Datalog with integer periodicity constraints
• scientific article; zbMATH DE number 219205 (Why is no real title available?)
• Constraint Databases
• Querying logical databases
• A closed-form evaluation for Datalog queries with integer (gap)-order constraints

Describes a project that uses

Uses Software

• Datalog

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3839873)