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)
68P15: Database theory
Related Items
Tarski’s Influence on Computer Science, Infinitary logic for computer science, Expressiveness of Logic Programs under the General Stable Model Semantics, A Logical Approach to Constraint Satisfaction, Loop-separable programs and their first-order definability, Inherent complexity of recursive queries, Homomorphism preservation on quasi-wide classes, Bounded arity Datalog \((\neq)\) queries on graphs, Can datalog be approximated?, A progression semantics for first-order logic programs, 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
Uses Software
Cites Work