Assumption-free Semantics for Ordered Logic Programs: On the Relationship Between Well-founded and Stable Partial Models

Laenens, Els; Vermeir, Dirk

doi:10.1093/logcom/2.2.133

Cited by 19 publications

(34 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Prioritization of rules is also investigated in [9,18]. An ordered logic program is a partiallyordered set of rules without negation by default.…”

Section: Proposition 41 Implies That the Reliable Model Of A Normal mentioning

confidence: 99%

“…An ordered logic program is a partiallyordered set of rules without negation by default. Even though the c-assumption-free semantics [9] and assumption-free semantics [18] are defined for all ordered logic programs, negation by default is not supported and only the basic constraints are considered. The skeptical c-partial model of an ordered logic program P is defined in [9] as follows: A literal set S is c-unfounded w.r.t.…”

Section: Proposition 41 Implies That the Reliable Model Of A Normal mentioning

confidence: 99%

“…Prioritization of defaults is investigated in [17,9,10,2,3,18,19,28,29,30]. Yet, negation by default is not considered in these works.…”

Section: Introductionmentioning

confidence: 99%

“…Yet, negation by default is not considered in these works. In [17,9,10,18,19], alternative semantics for ordered logic programs are presented. A default in an ordered logic program is a unidirectional rule.…”

Section: Introductionmentioning

confidence: 99%

“…An ordered logic program can be seen as an EP P which is free of default literals, S r = {} for every rule r, and all constraints are of the form: ⊥ ← L, ¬L. If P is an ordered logic program then the RS of P coincides with the skeptical c-partial model of P [9] and is a subset of the well-founded partial model of P [18]. When the Herbrand base of an EP P is finite, the complexity of computing RS is polynomial w.r.t.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Reliable Semantics for Extended Logic Programs with Rule Prioritization

Analyti¹,

Pramanik²

1995

J Logic Computation

View full text Add to dashboard Cite

We present a new semantics for extended logic programs with rule prioritization (EP P ). The semantics, called reliable semantics (RS), generalizes the well-founded semantics which is defined for normal programs [34]. It also generalizes the extended well-founded semantics which is defined for non-contradictory extended programs [24]. Because of the classical negation in the head of the rules, the well-founded model of a program can be contradictory. RS is contradiction-free and defined for all EP P s. To avoid contradictions, only reliable rules and reliable closed world assumptions are used in the fixpoint computation of RS. A closed world assumption (CW A) is considered reliable if it is not "suspect" for any constraint violation. A rule r is considered reliable if it is not "suspect" for any constraint violation caused by rules with priority no lower than r. We define the stable r-models of an EP P and we show that the RS of a program coincides with its least stable r-model. The RS of an EP P , P , represents the skeptical "meaning" of P whereas stable r-models of P represent the possible "meanings" of P .

show abstract

“…Prioritization of rules is also investigated in [9,18]. An ordered logic program is a partiallyordered set of rules without negation by default.…”

Section: Proposition 41 Implies That the Reliable Model Of A Normal mentioning

confidence: 99%

Section: Proposition 41 Implies That the Reliable Model Of A Normal mentioning

confidence: 99%

“…Prioritization of defaults is investigated in [17,9,10,2,3,18,19,28,29,30]. Yet, negation by default is not considered in these works.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Reliable Semantics for Extended Logic Programs with Rule Prioritization

Analyti¹,

Pramanik²

1995

J Logic Computation

View full text Add to dashboard Cite

show abstract

Preferred Answer Sets for Ordered Logic Programs

Nieuwenborgh

Vermeir

2002

Logics in Artificial Intelligence

View full text Add to dashboard Cite

Declarative semantics for contradictory modular logic programs

Analyti

Pramanik

1994

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.A complex reasoning system can be designed as an interaction between reasoning modules. A module consists of a declaration of exported/imported predicates and a set of rules containing both negation by default and classical negation. A prioritized modular logic program (PMP) consists of a set of modules and a partial order < def on the predicate definitions (M, p), where M is a module and p is a predicate exported by M. Because of the classical negation, conflicts may arise within and among modules. The partial order < def denotes the relative reliability of the predicate definitions contributing to the conflict. We present the reliable semantics for PMPs . The goal of the reliable semantics is to draw reliable conclusions from possibly contradictory PMPs.

show abstract

Assumption-free Semantics for Ordered Logic Programs: On the Relationship Between Well-founded and Stable Partial Models

Cited by 19 publications

References 0 publications

Reliable Semantics for Extended Logic Programs with Rule Prioritization

Reliable Semantics for Extended Logic Programs with Rule Prioritization

Preferred Answer Sets for Ordered Logic Programs

Declarative semantics for contradictory modular logic programs

Contact Info

Product

Resources

About