liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs
Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.ORCID-id: 0000-0002-5500-8494
Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
2016 (engelsk)Inngår i: Logics in Artificial Intelligence: 15th European Conference, JELIA 2016, Larnaca, Cyprus, November 9-11, 2016, Proceedings, Springer Publishing Company, 2016, s. 536-542Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
Springer Publishing Company, 2016. s. 536-542
Serie
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 10021
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-134419DOI: 10.1007/978-3-319-48758-8_36ISI: 000389316500036ISBN: 978-3-319-48757-1 (tryckt)ISBN: 978-3-319-48758-8 (digital)OAI: oai:DiVA.org:liu-134419DiVA, id: diva2:1073362
Konferanse
15th European Conference on Logics in Artificial Intelligence, JELIA 2016; Larnaca; Cyprus; 9 November 2016 through 11 November 2016
Prosjekter
CADICSELLIITCUASSymbiCloudSHERPANFFP6 KISATilgjengelig fra: 2017-02-10 Laget: 2017-02-10 Sist oppdatert: 2018-01-13

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Personposter BETA

Doherty, PatrickKvarnström, JonasSzalas, Andrzej

Søk i DiVA

Av forfatter/redaktør
Doherty, PatrickKvarnström, JonasSzalas, Andrzej
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 115 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf