Results 1  10
of
161,289
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
The DLV System for Knowledge Representation and Reasoning
 ACM Transactions on Computational Logic
, 2002
"... Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believ ..."
Abstract

Cited by 444 (99 self)
 Add to MetaCart
language, functionfree disjunctive logic programs (also known as disjunctive datalog), extended by weak constraints, which are a powerful tool to express optimization problems. We then illustrate the usage of DLV as a tool for knowledge representation and reasoning, describing a new declarative
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
Hypothetical Datalog: Complexity and Expressibility
 Theoretical Computer Science
, 1988
"... We present an extension of Hornclause logic which can hypothetically add and delete tuples from a database. Such logics have been discussed in the literature, but their complexities and expressibilities have remained an open question. This paper examines two such logics in the functionfree, predic ..."
Abstract

Cited by 39 (14 self)
 Add to MetaCart
of stratified hypothetical rulebases. It is shown that negation does not increase complexity. To establish expressibility, we view the logic as a query language for relational databases. It is shown that any typed generic query that is computable in PSPACE can be expressed as a stratified rulebase
Complexity and Expressive Power of Logic Programming
, 1997
"... This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results ..."
Abstract

Cited by 358 (57 self)
 Add to MetaCart
This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical
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
Design of a rolebased trust management framework
 In Proceedings of the 2002 IEEE Symposium on Security and Privacy
, 2002
"... We introduce the RT framework, a family of Rolebased Trustmanagement languages for representing policies and credentials in distributed authorization. RT combines the strengths of rolebased access control and trustmanagement systems and is especially suitable for attributebased access control. Usi ..."
Abstract

Cited by 351 (41 self)
 Add to MetaCart
. Using a few simple credential forms, RT provides localized authority over roles, delegation in role definition, linked roles, and parameterized roles. RT also introduces manifold roles, which can be used to express threshold and separationofduty policies, and delegation of role activations. We
Discovery of frequent Datalog patterns
, 1999
"... Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent itemsets, i.e., all combinations of items that are found in a sufficient number of examples. The fundamental task of as ..."
Abstract

Cited by 150 (10 self)
 Add to MetaCart
of association rule and frequent set discovery has been extended in various directions, allowing more useful patterns to be discovered with special purpose algorithms. We present Warmr, a general purpose inductive logic programming algorithm that addresses frequent query discovery: a very general Datalog
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...
Results 1  10
of
161,289