Datalog vs first-order logic
From MaRDI portal
Publication:1342861
DOI10.1016/S0022-0000(05)80071-6zbMATH Open0824.68034MaRDI QIDQ1342861FDOQ1342861
Authors: Yuri Gurevich, Miklós Ajtai 
Publication date: 15 January 1995
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (20)
- The expressive power of revised Datalog on problems with closure properties
- A Logical Approach to Constraint Satisfaction
- One Useful Logic That Defines Its Own Truth
- Inherent complexity of recursive queries
- Loop-separable programs and their first-order definability
- On datalog vs polynomial time
- Infinitary logic for computer science
- Bounded arity Datalog \((\neq)\) queries on graphs
- Database Theory, Yuri, and Me
- Homomorphism preservation on quasi-wide classes
- Comparison of expressive power of some query languages for databases
- Expressiveness of logic programs under the general stable model semantics
- Guarded Ontology-Mediated Queries
- A progression semantics for first-order logic programs
- Preservation theorems in finite model theory
- Tarski's influence on computer science
- Query answering over inconsistent knowledge bases: a probabilistic approach
- On digraph coloring problems and treewidth duality
- The expressive power of higher-order Datalog
- Can datalog be approximated?
Uses Software
This page was built for publication: Datalog vs first-order logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342861)
