QUERYING DATALOG PROGRAMS WITH TEMPORAL LOGIC
|Keywords:||Datalog;temporal logic queries;expressive power|
|Publisher:||Stern School of Business, New York University|
|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.|
|Appears in Collections:||IOMS: Information Systems Working Papers|
Items in FDA are protected by copyright, with all rights reserved, unless otherwise indicated.