liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0002-5500-8494
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering.
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)
Abstract [en]

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.
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 10021
National Category
Computer and Information Science
Identifiers
URN: 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
Conference
15th European Conference on Logics in Artificial Intelligence, JELIA 2016; Larnaca; Cyprus; 9 November 2016 through 11 November 2016
Projects
CADICSELLIITCUASSymbiCloudSHERPANFFP6 KISA
Available from: 2017-02-10 Created: 2017-02-10 Last updated: 2017-03-17

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Doherty, PatrickKvarnström, JonasSzalas, Andrzej
By organisation
Artificial Intelligence and Integrated Computer SystemsFaculty of Science & Engineering
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 11 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf