Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs
2016 (English)In: Logics in Artificial Intelligence: 15th European Conference, JELIA 2016, Larnaca, Cyprus, November 9-11, 2016, Proceedings, Springer Publishing Company, 2016, 536-542 p.Conference paper (Refereed)
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 (ASPK). ASPK programs have a syntax identical to classical ASP programs. The semantics of ASPK programs is based on the use of Kleene three-valued logic and strongly-supported models. For normal ASPK programs, their strongly supported models are identical to classical answer sets using stable model semantics. For disjunctive ASPK 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.
Place, publisher, year, edition, pages
Springer Publishing Company, 2016. 536-542 p.
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 10021
Computer and Information Science
IdentifiersURN: urn:nbn:se:liu:diva-134419DOI: 10.1007/978-3-319-48758-8_36ISI: 000389316500036ISBN: 978-3-319-48757-1 (print)ISBN: 978-3-319-48758-8 (electronic)OAI: oai:DiVA.org:liu-134419DiVA: diva2:1073362
15th European Conference on Logics in Artificial Intelligence, JELIA 2016; Larnaca; Cyprus; 9 November 2016 through 11 November 2016