The following pages link to Datalog vs first-order logic (Q1342861):
Displayed 17 items.
- Loop-separable programs and their first-order definability (Q543631) (← links)
- Inherent complexity of recursive queries (Q696953) (← links)
- Homomorphism preservation on quasi-wide classes (Q980940) (← links)
- Bounded arity Datalog \((\neq)\) queries on graphs (Q1376404) (← links)
- Can datalog be approximated? (Q1376415) (← links)
- A progression semantics for first-order logic programs (Q1680677) (← links)
- Query answering over inconsistent knowledge bases: a probabilistic approach (Q2084950) (← links)
- On digraph coloring problems and treewidth duality (Q2427534) (← links)
- Comparison of expressive power of some query languages for databases (Q2510772) (← links)
- Database Theory, Yuri, and Me (Q3585996) (← links)
- One Useful Logic That Defines Its Own Truth (Q3599112) (← links)
- Tarski’s Influence on Computer Science (Q4611682) (← links)
- Guarded Ontology-Mediated Queries (Q5015964) (← links)
- Infinitary logic for computer science (Q5204339) (← links)
- Expressiveness of Logic Programs under the General Stable Model Semantics (Q5278207) (← links)
- A Logical Approach to Constraint Satisfaction (Q5504702) (← links)
- Preservation theorems in finite model theory (Q6064296) (← links)