From CTL to Datalog

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

dc.contributor.author	Afrati, F	en
dc.contributor.author	Andronikos, T	en
dc.contributor.author	Pavlaki, V	en
dc.contributor.author	Foustoucos, E	en
dc.contributor.author	Guessarian, I	en
dc.date.accessioned	2014-03-01T02:42:15Z
dc.date.available	2014-03-01T02:42:15Z
dc.date.issued	2003	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/30893
dc.subject	Datalog	en
dc.subject	Temporal logic	en
dc.subject	Verification	en
dc.subject.other	Computational complexity	en
dc.subject.other	Formal languages	en
dc.subject.other	Logic programming	en
dc.subject.other	Theorem proving	en
dc.subject.other	Datalog	en
dc.subject.other	Formal logic	en
dc.title	From CTL to Datalog	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/778348.778359	en
heal.identifier.secondary	http://dx.doi.org/10.1145/778348.778359	en
heal.publicationDate	2003	en
heal.abstract	We provide a translation from CTL to Datalog¬Succ. The translation has the following advantages: a) It is natural, b) It provides intuition to the expressive power of CTL and its various fragments, c) It uses a fragment of Datalog¬Succ which is close to the expressive power of CTL.	en
heal.journalName	Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop	en
dc.identifier.doi	10.1145/778348.778359	en
dc.identifier.spage	72	en
dc.identifier.epage	85	en