Properties of Stable Model Semantics Extensions
M\'ario Abrantes, Lu\'is Moniz Pereira

TL;DR
This paper investigates the properties of conservative extensions of stable model semantics, introducing a broad class called ASM and analyzing their existence, relevance, and cumulativity properties to better understand the original SM semantics.
Contribution
The paper defines the class ASM of conservative extensions of SM semantics and studies their properties, providing new insights into the behavior of SM semantics regarding key logical properties.
Findings
SM lack of existence and cautious monotony are equivalent.
Relevance failure of SM semantics is characterized more clearly.
Results facilitate assessment of semantics in ASM subclasses.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Semantic Web and Ontologies · AI-based Problem Solving and Planning
