Datalog vs first-order logic
From MaRDI portal
Recommendations
- Datalog and logic databases
- On first-order-logic databases
- On Datalog vs. LFP
- First order data types and first order logic
- On temporal logic versus Datalog
- scientific article; zbMATH DE number 4145877
- scientific article; zbMATH DE number 1515860
- scientific article; zbMATH DE number 569773
- On datalog vs polynomial time
Cites work
Cited in
(24)- Bounded arity Datalog () queries on graphs
- Can datalog be approximated?
- A progression semantics for first-order logic programs
- On datalog vs polynomial time
- Query answering over inconsistent knowledge bases: a probabilistic approach
- On digraph coloring problems and treewidth duality
- Comparison of expressive power of some query languages for databases
- Database Theory, Yuri, and Me
- One Useful Logic That Defines Its Own Truth
- Tarski's influence on computer science
- Guarded Ontology-Mediated Queries
- The expressive power of higher-order Datalog
- Infinitary logic for computer science
- Expressiveness of logic programs under the general stable model semantics
- Loop-separable programs and their first-order definability
- A Logical Approach to Constraint Satisfaction
- Preservation theorems in finite model theory
- The expressive power of revised Datalog on problems with closure properties
- Preservation theorems through the Lens of topology
- When do homomorphism counts help in query algorithms?
- Inherent complexity of recursive queries
- Preservation theorems on sparse classes revisited
- Extension preservation on dense graph classes
- Homomorphism preservation on quasi-wide classes
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)
