Properties of Stable Model Semantics Extensions

05/15/2014
by   Mário Abrantes, et al.
0

The stable model (SM) semantics lacks the properties of existence, relevance and cumulativity. If we prospectively consider the class of conservative extensions of SM semantics (i.e., semantics that for each normal logic program P retrieve a superset of the set of stable models of P), one may wander how do the semantics of this class behave in what concerns the aforementioned properties. That is the type of issue dealt with in this paper. We define a large class of conservative extensions of the SM semantics, dubbed affix stable model semantics, ASM, and study the above referred properties into two non-disjoint subfamilies of the class ASM, here dubbed ASMh and ASMm. From this study a number of results stem which facilitate the assessment of semantics in the class ASMh U ASMm with respect to the properties of existence, relevance and cumulativity, whilst unveiling relations among these properties. As a result of the approach taken in our work, light is shed on the characterization of the SM semantics, as we show that the properties of (lack of) existence and (lack of) cautious monotony are equivalent, which opposes statements on this issue that may be found in the literature; we also characterize the relevance failure of SM semantics in a more clear way than usually stated in the literature.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/17/2002

On the existence and multiplicity of extensions in dialectical argumentation

In the present paper, the existence and multiplicity problems of extensi...
research
07/22/2019

On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs

Abstract Dialectical Frameworks (ADFs) are argumentation frameworks wher...
research
04/30/2009

Characterizations of Stable Model Semantics for Logic Programs with Arbitrary Constraint Atoms

This paper studies the stable model semantics of logic programs with (ab...
research
07/22/2019

Paracoherent Answer Set Semantics meets Argumentation Frameworks

In the last years, abstract argumentation has met with great success in ...
research
05/08/2000

Extending and Implementing the Stable Model Semantics

An algorithm for computing the stable model semantics of logic programs ...
research
12/20/2013

An Algebra of Causal Chains

In this work we propose a multi-valued extension of logic programs under...
research
07/20/2017

A monadic solution to the Cartwright-Felleisen-Wadler conjecture

Given a programming language, can we give a monadic denotational semanti...

Please sign up or login with your details

Forgot password? Click here to reset