Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs - (Extended Abstract)
In this extended abstract, we discuss the use of iteratively-supported formulas (ISFs) as a basis for computing strongly-supported models for Kleene Answer Set Programs (ASP\(^{K}\)). ASP\(^{K}\) programs have a syntax identical to classical ASP programs. The semantics of ASP\(^{K}\) programs is based on the use of Kleene three-valued logic and strongly-supported models. For normal ASP\(^{K}\) programs, their strongly supported models are identical to classical answer sets using stable model semantics. For disjunctive ASP\(^{K}\) programs, the semantics weakens the minimality assumption resulting in a classical interpretation for disjunction. We use ISFs to characterize strongly-supported models and show that they are polynomially bounded.