Stability, Supportedness, Minimality and Kleene Answer Set Programs

4 years 9 months ago
Stability, Supportedness, Minimality and Kleene Answer Set Programs
Abstract. Answer Set Programming is a widely known knowledge representation framework based on the logic programming paradigm that has been extensively studied in the past decades. The semantic framework for Answer Set Programs is based on the use of stable model semantics. There are two characteristics intrinsically associated with the construction of stable models for answer set programs. Any member of an answer set is supported through facts and chains of rules and those members are in the answer set only if generated minimally in such a manner. These two characteristics, supportedness and minimality, provide the essence of stable models. Additionally, answer sets are implicitly partial and that partiality provides epistemic overtones to the interpretation of disjunctive rules and default negation. This paper is intended to shed light on these characteristics by defining a semantic framework for answer set programming based on an extended first-order Kleene logic with weak and str...
Patrick Doherty, Andrzej Szalas
Added 17 Apr 2016
Updated 17 Apr 2016
Type Journal
Year 2015
Authors Patrick Doherty, Andrzej Szalas
Comments (0)