Results 1  10
of
1,044
T.: Justifications for logic programs under answer set semantics
 Proceedings of the 22nd International Conference on Logic Programming (ICLP’06). SpringerVerlag (2006) 196–210
, 2006
"... Abstract. The paper introduces the notion of offline justification for Answer Set Programming (ASP). Justifications provide a graphbased explanation of the truth value of an atom w.r.t. a given answer set. The notion of justification accounts for the specifics of answer set semantics. The paper ex ..."
Abstract

Cited by 33 (0 self)
 Add to MetaCart
Abstract. The paper introduces the notion of offline justification for Answer Set Programming (ASP). Justifications provide a graphbased explanation of the truth value of an atom w.r.t. a given answer set. The notion of justification accounts for the specifics of answer set semantics. The paper
A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web
 IN PROC. KR2004
, 2004
"... Abstract. We present a novel combination of disjunctive logic programs under the answer set semantics with description logics for the Semantic Web. The combination is based on a wellbalanced interface between disjunctive logic programs and description logics, which guarantees the decidability of th ..."
Abstract

Cited by 288 (60 self)
 Add to MetaCart
Abstract. We present a novel combination of disjunctive logic programs under the answer set semantics with description logics for the Semantic Web. The combination is based on a wellbalanced interface between disjunctive logic programs and description logics, which guarantees the decidability
Extending and Implementing the Stable Model Semantics
, 2002
"... A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization capabilities ..."
Abstract

Cited by 396 (9 self)
 Add to MetaCart
A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization
ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers
 Artificial Intelligence
, 2002
"... We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program’s completion, we obtain a onetoone corresp ..."
Abstract

Cited by 260 (7 self)
 Add to MetaCart
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program’s completion, we obtain a one
Splitting a Logic Program
 Principles of Knowledge Representation
, 1994
"... In many cases, a logic program can be divided into two parts, so that one of them, the \bottom " part, does not refer to the predicates de ned in the \top " part. The \bottom " rules can be used then for the evaluation of the predicates that they de ne, and the computed va ..."
Abstract

Cited by 294 (16 self)
 Add to MetaCart
values can be used to simplify the \top " de nitions. We discuss this idea of splitting a program in the context of the answer set semantics. The main theorem shows how computing the answer sets for a program can be simpli ed when the program is split into parts. The programs covered
Strongly Equivalent Logic Programs
 ACM Transactions on Computational Logic
, 2000
"... A logic program 1 is said to be equivalent to a logic program 2 in the sense of the answer set semantics if 1 and 2 have the same answer sets. We are interested in the following stronger condition: for every logic program , 1 [ has the same answer sets as 2 [ . The study of strong equival ..."
Abstract

Cited by 231 (36 self)
 Add to MetaCart
andthere, which is intermediate between classical logic and intuitionistic logic. 1 Introduction This paper is about logic programs with negation as failure under the answer set (\stable model") semantics [ Gelfond and Lifschitz, 1988 ] . A program 1 is said to be equivalent to a program 2 if 1 and 2
Semantic foundations of concurrent constraint programming
, 1990
"... Concurrent constraint programming [Sar89,SR90] is a simple and powerful model of concurrent computation based on the notions of storeasconstraint and process as information transducer. The storeasvaluation conception of von Neumann computing is replaced by the notion that the store is a constr ..."
Abstract

Cited by 276 (27 self)
 Add to MetaCart
(augment the store with a new constraint). This is a very general paradigm which subsumes (among others) nondeterminate dataflow and the (concurrent) (constraint) logic programming languages. This paper develops the basic ideas involved in giving a coherent semantic account of these languages. Our first
Merging Logic Programs under Answer Set Semantics
"... This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1,..., Pn, the goal is to provide characterisations of the merging of these programs. Our formal techniques are based on notions of relative distance between the underlying SE models ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1,..., Pn, the goal is to provide characterisations of the merging of these programs. Our formal techniques are based on notions of relative distance between the underlying SE
Preferred Answer Sets for Extended Logic Programs
 ARTIFICIAL INTELLIGENCE
, 1998
"... In this paper, we address the issue of how Gelfond and Lifschitz's answer set semantics for extended logic programs can be suitably modified to handle prioritized programs. In such programs an ordering on the program rules is used to express preferences. We show how this ordering can be used ..."
Abstract

Cited by 158 (20 self)
 Add to MetaCart
In this paper, we address the issue of how Gelfond and Lifschitz's answer set semantics for extended logic programs can be suitably modified to handle prioritized programs. In such programs an ordering on the program rules is used to express preferences. We show how this ordering can be used
Results 1  10
of
1,044