Results 1  10
of
179
Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic
 ANNALS OF PURE AND APPLIED LOGIC
, 1994
"... We establish a general hierarchy theorem for quantifier classes in the infinitary logic L ! 1! on finite structures. In particular, it is shown that no infinitary formula with bounded number of universal quantifiers can express the negation of a transitive closure. This implies the solution of se ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
We establish a general hierarchy theorem for quantifier classes in the infinitary logic L ! 1! on finite structures. In particular, it is shown that no infinitary formula with bounded number of universal quantifiers can express the negation of a transitive closure. This implies the solution
Computing with Infinitary Logic
 Theoretical Computer Science
, 1995
"... Most recursive extensions of relational calculus converge around two central classes of queries: fixpoint and while. Infinitary logic (with finitely many variables) is a very powerful extension of these languages which provides an elegant unifying formalism for a wide variety of query languages. ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
style of these languages. Relational machines capture the kind of computation occurring when a query language is embedded in a host programming language, as in C+SQL. The main result of this paper is that relational machines correspond to the natural effective fragment of infinitary logic. Other
Linear Time Datalog and Branching Time Logic
"... We survey recent results about the relation between Datalog and temporal verification logics. Datalog is a wellknown database query language relying on the logic programming paradigm. We introduce Datalog LITE, a fragment of Datalog with wellfounded negation, which has an easy stratified semantic ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
We survey recent results about the relation between Datalog and temporal verification logics. Datalog is a wellknown database query language relying on the logic programming paradigm. We introduce Datalog LITE, a fragment of Datalog with wellfounded negation, which has an easy stratified
Defining Datalog in Rewriting Logic
 Proceedings of 19th International Symposium on LogicBased Program Synthesis and Transformation (LOPSTR’09
, 2009
"... Abstract. In recent work, the effectiveness of using declarative languages has been demonstrated for many problems in program analysis. Using a simple relational query language, like Datalog, complex interprocedural analyses involving dynamically created objects can be expressed in just a few lines. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
. By exploiting the power of the Rewriting Logic language Maude, we aim at transforming Datalog programs into efficient rewrite systems that compute the same answers. A prototype has been implemented and applied to some realworld Datalogbased analyses. Experimental results show that the performance of solving
Some Remarks on the Definability of Transitive Closure in Firstorder Logic and Datalog
, 2004
"... In the last WSML phone conference we had a brief discussion about the expressivity of Firstorder Logic and Datalog resp. the relation between the expressiveness of those two languages. In particular, there has been some confusion around the description of the transitive closure R + of some binary r ..."
Abstract
 Add to MetaCart
In the last WSML phone conference we had a brief discussion about the expressivity of Firstorder Logic and Datalog resp. the relation between the expressiveness of those two languages. In particular, there has been some confusion around the description of the transitive closure R + of some binary
Fixpoint logic vs. infinitary logic in finitemodel theory
 In Proc. 7th IEEE Symp. on Logic in Computer Science
, 1992
"... In recent years several extensions of firstorder logic have been investigated in the context of finitemodel theory. Fixpoint logic and the infinitary logic Lω∞ω with a finite number of variables have turned out to be of particular importance. The study of fixpoint logic generated interactions with ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
In recent years several extensions of firstorder logic have been investigated in the context of finitemodel theory. Fixpoint logic and the infinitary logic Lω∞ω with a finite number of variables have turned out to be of particular importance. The study of fixpoint logic generated interactions
Adding Disjunction to Datalog (Extended Abstract)
, 1994
"... ) Thomas Eiter Georg Gottlob Heikki Mannila Christian Doppler Laboratory for Expert Systems, Information Systems Department Technical University of Vienna, Paniglgasse 16, A1040 Wien, Austria (eitergottlobmannila)@vexpert.dbai.tuwien.ac.at Abstract We study the expressive power and comp ..."
Abstract
 Add to MetaCart
capture the complexity class \Sigma P 2 . The combined complexity of disjunctive datalog is shown to be NEXPTIME NP complete. 1 Introduction Strong interest in enhancing logic programs by the capability of disjunction emerged in the logic programming and databases community. This interest
Datalog LITE: Temporal versus deductive reasoning in verification
, 1998
"... In this paper we show that Datalog is wellsuited as a temporal verification language. Datalog is a wellknown database query language relying on the logic programming paradigm. We introduce Datalog LITE, a fragment of Datalog with negation, and present a linear time model checking algorithm for ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
In this paper we show that Datalog is wellsuited as a temporal verification language. Datalog is a wellknown database query language relying on the logic programming paradigm. We introduce Datalog LITE, a fragment of Datalog with negation, and present a linear time model checking algorithm
Results 1  10
of
179