The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases
From MaRDI portal
Recommendations
Cites work
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
- A closed form for datalog queries with integer order
- Constraint databases, data structures and efficient query evaluation
- Querying logical databases
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints
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)