QUERYING DATALOG PROGRAMS WITH TEMPORAL LOGIC

Full metadata record

DC Field	Value	Language
dc.contributor.author	Tuzhilin, Alexander	-
dc.date.accessioned	2006-02-01T16:26:24Z	-
dc.date.available	2006-02-01T16:26:24Z	-
dc.date.issued	1993	-
dc.identifier.uri	http://hdl.handle.net/2451/14256	-
dc.description.abstract	Temporal logic queries on Datalog and negated Datalog programs are studied, and their relationship to Datalog queries on these programs is explored. It is shown that, in general, temporal logic queries have more expressive power than Datalog queries on Datalog and negated Datalog programs. It is also shown that an existential domain-independent fragment of temporal logic queries has the same expressive power as Datalog queries on negated Datalog programs with inflationary semantics. This means that for finite structures this class of queries has the power of the fixpoint logic.	en
dc.format.extent	4441044 bytes	-
dc.format.mimetype	application/pdf	-
dc.language	English	EN
dc.language.iso	en_US	-
dc.publisher	Stern School of Business, New York University	en
dc.relation.ispartofseries	IS-93-20	-
dc.subject	Datalog	en
dc.subject	temporal logic queries	en
dc.subject	expressive power	en
dc.title	QUERYING DATALOG PROGRAMS WITH TEMPORAL LOGIC	en
dc.type	Working Paper	en
dc.description.series	Information Systems Working Papers Series	EN
Appears in Collections:	IOMS: Information Systems Working Papers

Files in This Item:

File	Description	Size	Format
IS-93-20.pdf		4.34 MB	Adobe PDF	View/Open