On relating 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-01T01:54:18Z
dc.date.available	2014-03-01T01:54:18Z
dc.date.issued	2005	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/27308
dc.relation.uri	http://arxiv.org/abs/cs/0510012	en
dc.relation.uri	http://www.informatik.uni-trier.de/~ley/db/journals/corr/corr0510.html#abs-cs-0510012	en
dc.subject	Database Query	en
dc.subject	Efficient Algorithm	en
dc.subject	Linear Time	en
dc.subject	Model Checking	en
dc.subject	Query Evaluation	en
dc.subject	Satisfiability	en
dc.subject	Specification Language	en
dc.subject	Linear Time Logic	en
dc.title	On relating CTL to Datalog	en
heal.type	journalArticle	en
heal.publicationDate	2005	en
heal.abstract	CTL is the dominant temporal specification language in practice mainly due to the fact that it admits model checking in linear time. Logic programming and the database query language Datalog are often used as an implementation platform for logic languages. In this paper we present the exact relation between CTL and Datalog and moreover we build on this relation and	en
heal.journalName	Computing Research Repository	en