Pages that link to "Item:Q3839873"
From MaRDI portal
The following pages link to The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases (Q3839873):
Displaying 8 items.
- Querying logical databases (Q579967) (← links)
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints (Q688670) (← links)
- On the complexity of database queries (Q1307689) (← links)
- The complexity of query evaluation in indefinite temporal constraint databases (Q1369238) (← links)
- Can datalog be approximated? (Q1376415) (← links)
- Memoing evaluation for constraint extensions of datalog (Q1378383) (← links)
- Efficient evaluation of specific queries in constraint databases (Q1944172) (← links)
- Constraint Databases (Q5717745) (← links)