On temporal logic versus datalog

Guessarian, I; Foustoucos, E; Andronikos, T; Afrati, F

dc.contributor.author	Guessarian, I	en
dc.contributor.author	Foustoucos, E	en
dc.contributor.author	Andronikos, T	en
dc.contributor.author	Afrati, F	en
dc.date.accessioned	2014-03-01T02:42:18Z
dc.date.available	2014-03-01T02:42:18Z
dc.date.issued	2003	en
dc.identifier.issn	03043975	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/30927
dc.subject	Datalog	en
dc.subject	Temporal logic	en
dc.subject	Verification	en
dc.subject.other	Modal analysis	en
dc.subject.other	Semantics	en
dc.subject.other	Syntactics	en
dc.subject.other	Temporal logics	en
dc.subject.other	Computer science	en
dc.title	On temporal logic versus datalog	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1016/S0304-3975(02)00447-4	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0304-3975(02)00447-4	en
heal.publicationDate	2003	en
heal.abstract	We provide a direct and modular translation from the temporal logics CTL, ETL, FCTL (CTL extended with the ability to express fairness) and the Modal μ-calculus to Monadic inf-Datalog with built-in predicates. We call it inf-Datalog because the semantics we provide is a little different from the conventional Datalog least fixed point semantics, in that some recursive rules (corresponding to least fixed points) are allowed to unfold only finitely many times, whereas others (corresponding to greatest fixed points) are allowed to unfold infinitely many times. We characterize the fragments of Monadic inf-Datalog that have the same expressive power as Modal Logic (resp. CTL, alternation-free Modal μ-calculus and Modal μ-calculus). Our translation is interesting because it is direct and succinct. Moreover the fragments of Monadic inf-Datalog that we have exhibited have very simple syntactic characterizations as subsets of what we call Modal inf-Datalog programs. © 2002 Elsevier Science B.V. All rights reserved.	en
heal.journalName	Theoretical Computer Science	en
dc.identifier.doi	10.1016/S0304-3975(02)00447-4	en
dc.identifier.volume	303	en
dc.identifier.issue	1	en
dc.identifier.spage	103	en
dc.identifier.epage	133	en