Results 1  10
of
97
Semantics of disjunctive programs with monotone aggregates  an operatorbased approach
 In: NMR
, 2004
"... All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the onestep provability operator or of operators that can be derived from it. No such systematic operatorbased approach to semantics of disjunctive logic programs has been develo ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the onestep provability operator or of operators that can be derived from it. No such systematic operatorbased approach to semantics of disjunctive logic programs has been
Semantics of Disjunctive Programs with Monotone Aggregates 
"... All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the onestep provability operator or of operators that can be derived from it. No such systematic operatorbased approach to semantics of disjunctive logic programs has been d ..."
Abstract
 Add to MetaCart
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the onestep provability operator or of operators that can be derived from it. No such systematic operatorbased approach to semantics of disjunctive logic programs has been
Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity
 In Proceedings of European Conference on Logics in Artificial Intelligence (JELIA
, 2004
"... Abstract. The addition of aggregates has been one of the most relevant enhancements to the language of answer set programming (ASP). They strengthen the modeling power of ASP, in terms of concise problem representations. While many important problems can be encoded using nonrecursive aggregates, som ..."
Abstract

Cited by 115 (15 self)
 Add to MetaCart
desirable criteria, such as minimality or coincidence with answer sets in the aggregatefree case. In this paper we define a semantics for disjunctive programs with arbitrary aggregates (including monotone, antimonotone, and nonmonotone aggregates). This semantics is a fully declarative, genuine
Monotonic Aggregation in Deductive Databases
 Journal of Computer and System Sciences
, 1992
"... We propose a semantics for aggregates in deductive databases based on a notion of minimality. Unlike some previous approaches, we form a minimal model of a program component including aggregate operators, rather than insisting that the aggregate apply to atoms that have been fully determined, or tha ..."
Abstract

Cited by 66 (3 self)
 Add to MetaCart
We propose a semantics for aggregates in deductive databases based on a notion of minimality. Unlike some previous approaches, we form a minimal model of a program component including aggregate operators, rather than insisting that the aggregate apply to atoms that have been fully determined
Aggregate Functions in Disjunctive Logic Programming: Semantics, . . .
"... Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of nite structures that is decidable in the complexity class ). Despite the high expressiveness of DLP, there are some simple properties, often arising in realworld applications, which ..."
Abstract

Cited by 44 (4 self)
 Add to MetaCart
functions. We formally de ne the semantics of the new language, named DLP . We show the usefulness of the new constructs on relevant knowledgebased problems. We analyze the computational complexity of DLP , showing that the addition of aggregates does not bring a higher cost in that respect. We
Semantics of Logic Programs with Aggregates
 In Proceedings of the International Logic Programming Symposium
, 1991
"... We investigate the semantics of aggregates (count, sum, : : :) in logic programs with function symbols and negation. In particular we address the meaning of programs with recursion through aggregation. We extend the two most successful semantic approaches to the problem of recursion through negation ..."
Abstract

Cited by 68 (2 self)
 Add to MetaCart
We investigate the semantics of aggregates (count, sum, : : :) in logic programs with function symbols and negation. In particular we address the meaning of programs with recursion through aggregation. We extend the two most successful semantic approaches to the problem of recursion through
Aggregation in Disjunctive Deductive Databases
 In International Conference on Applications of Prolog (INAP'99
, 1999
"... Practical applications of deductive databases often require the use of extended features like disjunctive information, aggregation operators or default negation. But it has been unclear how one could deal with aggregation in the presense of recursion and disjunction. Usually, there is the requiremen ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
negation, and function symbols. 1 There are practical examples that require non stratified aggregation in disjunctive deductive databases. We will present a clear declarative set semantics for disjunctive deductive databases P with aggregation. The semantics is based on a special program
Characterizations of the Disjunctive Wellfounded Semantics: Confluent Calculi and Iterated GCWA
 Journal of Automated Reasoning
, 1997
"... . Recently Brass and Dix have introduced the semantics DWFS for general disjunctive logic programs. The interesting feature of this approach is that it is both semantically and prooftheoretically founded. Any program \Phi is associated a normalform res(\Phi), called the residual program, by a non ..."
Abstract

Cited by 37 (9 self)
 Add to MetaCart
. Recently Brass and Dix have introduced the semantics DWFS for general disjunctive logic programs. The interesting feature of this approach is that it is both semantically and prooftheoretically founded. Any program \Phi is associated a normalform res(\Phi), called the residual program, by a non
Disjunctive Semantics based upon Partial and BottomUp Evaluation
 Proceedings of the 12th Int. Conf. on Logic Programming
, 1995
"... We present a new and general approach of defining semantics for disjunctive logic programs. Our framework consists of two parts: (1) a semantical , where semantics are defined in an abstract way as the weakest semantics satisfying certain properties, and (2) a procedural, namely a bottomup queryeva ..."
Abstract

Cited by 45 (12 self)
 Add to MetaCart
We present a new and general approach of defining semantics for disjunctive logic programs. Our framework consists of two parts: (1) a semantical , where semantics are defined in an abstract way as the weakest semantics satisfying certain properties, and (2) a procedural, namely a bottom
On the Declarative and Procedural Semantics of Logic Programs
 Journal of Automated Reasoning
, 1995
"... One of the most important and difficult problems in logic programming is the problem of finding a suitable declarative or intended semantics for logic programs. The importance of this problem stems from the declarative character of logic programming, whereas its difficulty can be largely attributed ..."
Abstract

Cited by 65 (8 self)
 Add to MetaCart
to the nonmonotonic character of the negation operator used in logic programs. The problem can therefore be viewed as the problem of finding a suitable formalization of the type of nonmonotonic reasoning used in logic programming. In this paper we introduce a semantics of logic programs based on the class
Results 1  10
of
97