You are currently offline. Some features of the site may not work correctly.

Corpus ID: 17263537

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

@inproceedings{June2004SomeRO,
title={Some Remarks on the Definability of Transitive Closure in First-order Logic and Datalog},
author={Uwe Keller June},
year={2004}
}

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.