The following pages link to On datalog vs polynomial time (Q1900923):
Displayed 7 items.
- Computing with infinitary logic (Q672337) (← links)
- Inherent complexity of recursive queries (Q696953) (← links)
- The expressiveness of DAC (Q1608890) (← links)
- Bounds in ontology-based data access via circuit complexity (Q2411040) (← 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)