Pages that link to "Item:Q1127538"
From MaRDI portal
The following pages link to Circumscribing DATALOG: expressive power and complexity (Q1127538):
Displaying 10 items.
- On the expressive power of Datalog: tools and a case study. (Q960526) (← links)
- Permutation dependency in datalog programs (Q1208139) (← links)
- Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
- The expressive powers of stable models for bound and unbound DATALOG queries (Q1362337) (← links)
- The expressiveness of DAC (Q1608890) (← links)
- Enhancing context knowledge repositories with justifiable exceptions (Q1749389) (← links)
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog (Q2302291) (← links)
- Compiling problem specifications into SAT (Q2457689) (← links)
- Directed st-Connectivity Is Not Expressible in Symmetric Datalog (Q3519500) (← links)
- The Expressive Power of Higher-Order Datalog (Q5108510) (← links)