On the first-order expressibility of recursive queries
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
On Datalog vs. polynomial time (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Datalog expressiveness of chain queries: grammar tools and characterizations
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bonded arity Datalog (≠) queries on graphs
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the expressive power of datalog: tools and a case study
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Inherent complexity of recursive queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
DATALOG SIRUPs uniform boundedness is undecidable
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On preservation under homomorphisms and unions of conjunctive queries
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On preservation under homomorphisms and unions of conjunctive queries
Journal of the ACM (JACM)
On digraph coloring problems and treewidth duality
European Journal of Combinatorics
Homomorphism preservation theorems
Journal of the ACM (JACM)
One Useful Logic That Defines Its Own Truth
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Homomorphism preservation on quasi-wide classes
Journal of Computer and System Sciences
Loop-separable programs and their first-order definability
Artificial Intelligence
Fields of logic and computation
Finite model theory on tame classes of structures
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Datalog: a perspective and the potential
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
First-order expressibility and boundedness of disjunctive logic programs
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Our main result is that every datalog query expressible in first-order logic is bounded; in terms of classical model theory it is a kind of compactness theorem for finite structures. In addition, we give some counter-examples delimiting the main result.