Stability, Supportedness, Minimality and Kleene Answer Set Programs
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 strong negation. Additionally, a definition of strongly supported models is introduced, separate from the minimality assumption explicit in stable models. This is used to both clarify and generate alternative semantic interpretations for answer set programs with disjunctive rules in addition to answer set programs with constraint rules. An algorithm is provided for computing supported models and comparative complexity results between strongly supported and stable model generation are provided.
KeywordsLogic Program Logic Programming Semantic Theory Stable Model Closed World Assumption
Unable to display preview. Download preview PDF.
- 2.Baral, C.: Knowledge Representation, Reasoning, and Declarative Problem Solving. Cambridge University Press (2003)Google Scholar
- 6.Brewka, G., Niemelä, I., Truszczynski, M.: Answer set optimization. In: Gottlob, G., Walsh, T. (eds.) Proc. 18th IJCAI, pp. 867–872. Morgan Kaufmann (2003)Google Scholar
- 8.Denecker, M., Marek, V., Truszczynski, M.: Stable operators, well-founded fixpoints and applications in nnonmonotonic reasoning. In: Minker, J. (ed.) Logic-based Artificial Intelligence, pp. 127–144. Kluwer Academic Pub. (2000)Google Scholar
- 9.Eiter, T., Gottlob, G.: Complexity results for disjunctive logic programming and application to nonmonotonic logics. In: Miller, D. (ed.) Proceedings of the 1993 International Symposium on Logic Programming, pp. 266–278 (1993)Google Scholar
- 11.Fages, F.: Consistency of Clark’s completion and existence of stable models. Methods of Logic in Computer Science 1, 51–60 (1994)Google Scholar
- 12.Fenstad, J.E.: Situations, Language and Logic. D. Reidel Publishing Company (1987)Google Scholar
- 16.Gelfond, M., Kahl, Y.: Knowledge Representation, Reasoning, and the Design of Intelligent Agents - The Answer-Set Programming Approach. Cambridge University Press (2014)Google Scholar
- 17.Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Proc. of Int’l Logic Programming, pp. 1070–1080. MIT Press (1988)Google Scholar