The following pages link to On datalog vs polynomial time (Q1900923):
Displaying 15 items.
- Computing with infinitary logic (Q672337) (← links)
- Inherent complexity of recursive queries (Q696953) (← links)
- On the expressive power of Datalog: tools and a case study. (Q960526) (← links)
- Querying datalog programs with temporal logic (Q1323325) (← links)
- Datalog vs first-order logic (Q1342861) (← links)
- Bounded arity Datalog \((\neq)\) queries on graphs (Q1376404) (← links)
- On the complexity of single-rule datalog queries. (Q1401945) (← links)
- The expressiveness of DAC (Q1608890) (← links)
- Bounds in ontology-based data access via circuit complexity (Q2411040) (← links)
- Is there a logic for polynomial time? (Q4255975) (← links)
- A datalog-based computational model for coordination-free, data-parallel systems (Q4559834) (← links)
- Modern Datalog Engines (Q5101659) (← links)
- Preservation theorems in finite model theory (Q6064296) (← links)
- The expressive power of revised Datalog on problems with closure properties (Q6562535) (← links)
- On transformations into linear database logic programs (Q6570942) (← links)
