Semi-Stable Semantics

  • Authors:
  • Martin Caminada

  • Affiliations:
  • Institute of Information and Computing Sciences, Utrecht University

  • Venue:
  • Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every stable extension is also a semi-stable extension. One of the advantages of semi-stable semantics is that there exists at least one semi-stable extension. Furthermore, if there also exists at least one stable extension, then the semi-stable extensions coincide with the stable extensions. This, and other properties, make semi-stable semantics an attractive alternative for the more traditional stable semantics, which until now has been widely used in fields such as logic programming and answer set programming.