Corpus ID: 17263537

Some Remarks on the Definability of Transitive Closure in First-order Logic and Datalog

  title={Some Remarks on the Definability of Transitive Closure in First-order Logic and Datalog},
  author={Uwe Keller June},
  • Uwe Keller June
  • Published 2004
In the last WSML phone conference we had a brief discussion about the expressivity of First-order Logic and Datalog resp. the relation between the expressiveness of those two languages. In particular, there has been some confusion around the description of the transitive closure R of some binary relation R. In this short document, we want to clarify the situation and hope to remedy the confusion. 
6 Citations

Figures from this paper

The Herbrand Manifesto - Thinking Inside the Box
  • 3
  • PDF
Verifying Alloy Models Using KeY
  • 3
  • PDF
Configuration Logics: Modelling Architecture Styles
  • 20
  • PDF
A Semantic Framework for Architecture Modelling
  • 1
Rule Technologies: Foundations, Tools, and Applications
  • 1
Modelling Architecture Styles
  • PDF


Datalog vs. first-order logic
  • M. Ajtai, Y. Gurevich
  • Computer Science
  • 30th Annual Symposium on Foundations of Computer Science
  • 1989
  • 61
  • Highly Influential
  • PDF
The Well-Founded Semantics Is the Principle of Inductive Definition
  • 98
  • PDF
Transitive Closure and the Mechanization of Mathematics
  • 45
  • PDF
Extending Classical Logic with Inductive Definitions
  • 104
  • PDF
Infinitary Logic and Inductive Definability over Finite Structures
  • 101
  • PDF
Finite model theory
  • 899
Logic programming revisited: logic programs as inductive definitions
  • 73
  • PDF
On the Expressive Power of Datalog: Tools and a Case Study
  • 41
Vardi . On the expressive power of datalog : tools and a case study
  • Proceedings of the ninth ACM SIGACTSIGMODSIGART symposium on Principles of database systems
  • 1990
Logic Programming, Functional Programming, and Inductive Definitions
  • 24
  • PDF