Results 1  10
of
72
On Expressing Stratified Datalog
, 1994
"... 1 Introduction Tiziana Catarci Isabel F. Cruz On Expressing Stratified Datalog catarci@infokit.dis.uniroma1.it ifc@cs.brown.edu ongate x; y; z in x ; in y ; gate x; y; z : ongate x; y; z ongate a; b; x ; gate x; y; z ; ongate c; d; y : Dipartimento di Informatica e Sistemistica Universit`a di Rom ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
1 Introduction Tiziana Catarci Isabel F. Cruz On Expressing Stratified Datalog catarci@infokit.dis.uniroma1.it ifc@cs.brown.edu ongate x; y; z in x ; in y ; gate x; y; z : ongate x; y; z ongate a; b; x ; gate x; y; z ; ongate c; d; y : Dipartimento di Informatica e Sistemistica Universit`a di
Multi Dimensional CTL and Stratified Datalog
"... In this work we define Multi Dimensional CTL (MDCTL in short) by extending CTL which is the dominant temporal specification language in practice. The need for Multi Dimensional CTL is mainly due to the advent of semistructured data. The common path nature of CTL and XPath which provides a suitable ..."
Abstract
 Add to MetaCart
of this work is twofold; a) we define MDCTL and prove that the “nice ” properties of CTL (linear model checking and bounded model property) transfer also to MDCTL, b) we establish new results on stratified Datalog. In particular, we define a fragment of stratified Datalog called Multi Branching Temporal (MBT
Safe Stratified Datalog with Integer Order Programs
 In International Conference on Constraint Programming
, 1995
"... . Guaranteeing termination of programs on all valid inputs is important for database applications. Termination cannot be guaranteed in Stratified Datalog with integer (gap)order, or Datalog :;! Z , programs on generalized databases because they can express any Turingcomputable function [23]. This ..."
Abstract

Cited by 17 (4 self)
 Add to MetaCart
. Guaranteeing termination of programs on all valid inputs is important for database applications. Termination cannot be guaranteed in Stratified Datalog with integer (gap)order, or Datalog :;! Z , programs on generalized databases because they can express any Turingcomputable function [23
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
the expressive power of several extensions of Datalog, giving new insight in the fine structure of stratified Datalog.
Extending Stratified Datalog to Capture Complexity Classes Ranging from P to QH
 In Acta Informatica
, 2001
"... This paper presents a unified solution to the problem of extending stratified DATALOG to express database complexity classes ranging from P to QH; QH is the query hierarchy containing the decision problems that can be solved in polynomial time by a deterministic Turing machine using a constant numbe ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
This paper presents a unified solution to the problem of extending stratified DATALOG to express database complexity classes ranging from P to QH; QH is the query hierarchy containing the decision problems that can be solved in polynomial time by a deterministic Turing machine using a constant
Safe Stratified Datalog With Integer Order Does not Have Syntax
, 1997
"... Stratified Datalog with integer (gap)order (or Datalog :;!z ) is considered. A Datalog :;!z program is said to be safe iff its bottomup processing terminates on all valid inputs. We prove that safe Datalog :;!z  programs do not have effective syntax in the sense that there is no recursivel ..."
Abstract
 Add to MetaCart
Stratified Datalog with integer (gap)order (or Datalog :;!z ) is considered. A Datalog :;!z program is said to be safe iff its bottomup processing terminates on all valid inputs. We prove that safe Datalog :;!z  programs do not have effective syntax in the sense
Safe Stratified Datalog With Integer Order Does not Have Syntax
, 1997
"... Stratied Datalog with integer (gap)order (or Datalog :;<z ) is considered. A Datalog :;<z program is said to be safe i its bottomup processing terminates on all valid inputs. We prove that safe Datalog :;<z  programs do not have eective syntax in the sense that there is no rec ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Stratied Datalog with integer (gap)order (or Datalog :;<z ) is considered. A Datalog :;<z program is said to be safe i its bottomup processing terminates on all valid inputs. We prove that safe Datalog :;<z  programs do not have eective syntax in the sense
DATALOG Queries with Stratified Negation and Choice: from P to D^P
, 1995
"... This paper introduces a unified solution to the problem of extending stratified DATALOG to express DBcomplexity classes ranging from P to D^P. The solution... ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
This paper introduces a unified solution to the problem of extending stratified DATALOG to express DBcomplexity classes ranging from P to D^P. The solution...
On relating CTL to Datalog
, 2008
"... 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 ..."
Abstract
 Add to MetaCart
relation between CTL and Datalog and moreover we build on this relation and known efficient algorithms for CTL to obtain efficient algorithms for fragments of stratified Datalog. The contributions of this paper are: a) We embed CTL into STD which is a proper fragment of stratified Datalog. Moreover we show
Modelling the Future with Event Choice DATALOG
 Proc. AGP Conference
, 2002
"... This paper presents a rulebased declarative database language which extends stratified DATALOG to express events and nondeterministic state transitions, by using various types of choice to model uncertainty in dynamic rules. The proposed language, called Event Choice DATALOG (DATALOG for sho ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This paper presents a rulebased declarative database language which extends stratified DATALOG to express events and nondeterministic state transitions, by using various types of choice to model uncertainty in dynamic rules. The proposed language, called Event Choice DATALOG (DATALOG
Results 1  10
of
72