paper-with-me

홈 › Papers

Properties of Stable Model Semantics Extensions

2014-05-15 · Mário Abrantes, Luís Moniz Pereira

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.

📄 PDF Abstract BibTeX arXiv:1405.3896

Code (0)

등록된 구현이 없습니다.

Tasks

model

Similar Papers 제목 키워드 기반

Paracoherent Answer Set Semantics meets Argumentation Frameworks

2019-07-22 · Giovanni Amendola, Francesco Ricca

In the last years, abstract argumentation has met with great success in AI, since it has served to capture several non-monotonic logics for AI. Relations between argumentation framework (AF) semantics and logic programmi…

Abstract Argumentation

Properties of Answer Set Programming with Convex Generalized Atoms

2013-12-20 · Mario Alviano, Wolfgang Faber

In recent years, Answer Set Programming (ASP), logic programming under the stable model or answer set semantics, has seen several extensions by generalizing the notion of an atom in these programs: be it aggregate atoms,…

Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation

2020-03-12 · Meghyn Bienvenu, Camille Bourgaux

In this paper, we explore the issue of inconsistency handling over prioritized knowledge bases (KBs), which consist of an ontology, a set of facts, and a priority relation between conflicting facts. In the database setti…

Abstract Argumentation

An argumentation system for reasoning with conflict-minimal paraconsistent ALC

2014-04-30 · Wenzhao Qiao, Nico Roos

The semantic web is an open and distributed environment in which it is hard to guarantee consistency of knowledge and information. Under the standard two-valued semantics everything is entailed if knowledge and informati…

Range-based argumentation semantics as 2-valued models

2016-02-29 · Mauricio Osorio, Juan Carlos Nieves

Characterizations of semi-stable and stage extensions in terms of 2-valued logical models are presented. To this end, the so-called GL-supported and GL-stage models are defined. These two classes of logical models are lo…