Datalog vs first-order logic
From MaRDI portal
Publication:1342861
DOI10.1016/S0022-0000(05)80071-6zbMath0824.68034MaRDI QIDQ1342861
Publication date: 15 January 1995
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items
Expressiveness of Logic Programs under the General Stable Model Semantics, Bounded arity Datalog \((\neq)\) queries on graphs, Can datalog be approximated?, A progression semantics for first-order logic programs, Preservation theorems in finite model theory, On digraph coloring problems and treewidth duality, Tarski’s Influence on Computer Science, Inherent complexity of recursive queries, Loop-separable programs and their first-order definability, Database Theory, Yuri, and Me, Homomorphism preservation on quasi-wide classes, One Useful Logic That Defines Its Own Truth, Comparison of expressive power of some query languages for databases, Infinitary logic for computer science, Query answering over inconsistent knowledge bases: a probabilistic approach, A Logical Approach to Constraint Satisfaction, Guarded Ontology-Mediated Queries
Uses Software
Cites Work
