Affiliation:
1. Vienna University of Technology, Wien, Austria
2. RWTH Aachen, Aachen, Germany
Abstract
We present Datalog LITE, a new deductive query language with a linear-time model-checking algorithm, that is, linear time data complexity and program complexity. Datalog LITE is a variant of Datalog that uses stratified negation, restricted variable occurrences and a limited form of universal quantification in rule bodies.Despite linear-time evaluation, Datalog LITE is highly expressive: It encompasses popular modal and temporal logics such as CTL or the alternation-free μ-calculus. In fact, these formalisms have natural presentations as fragments of Datalog LITE. Further, Datalog LITE is equivalent to the alternation-free portion of guarded fixed-point logic. Consequently, linear-time model checking algorithms for all mentioned logics are obtained in a unified way.The results are complemented by inexpressibility proofs to the effect that linear-time fragments of
stratified
Datalog have too limited expressive power.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference68 articles.
1. Temporal logic programming
2. ABITEBOUL S. HULL R. AND VIANU V. 1995. Foundations of Databases. Addison-Wesley Reading Mass.]] ABITEBOUL S. HULL R. AND VIANU V. 1995. Foundations of Databases. Addison-Wesley Reading Mass.]]
3. Relational transducers for electronic commerce
4. Modal Languages and Bounded Fragments of Predicate Logic
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献