umu.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Stable-Ordered Models for Propositional Theories with Order Operators
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.ORCID-id: 0000-0003-4072-8795
2019 (Engelska)Ingår i: Logics in Artificial Intelligence: JELIA 2019 / [ed] Calimeri, Francesco; Leone, Nicola; Manna, Marco, Springer, 2019, s. 794-802Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

The stable-model semantics has been generalised from logic programs to arbitrary theories. We explore a further generalisation and consider sequences of atoms as models instead of sets. The language is extended by suitable order operators to access this additional information. We recently introduced an extension of classical logic by a single order operator with a temporal interpretation for activity reasoning. The logic envisaged here is a nonmonotonic version thereof. Our definition of what we call stable-ordered models is based on the stable-model semantics for theories due to Ferraris and Lifschitz with the necessary changes. Compared to related nonmonotonic versions of temporal logics, our approach is less costly as checking model existence remains at the second level of the polynomial hierarchy. We demonstrate versatile applications from activity reasoning, combinatorial testing, debugging concurrent programs, and digital forensics.

Ort, förlag, år, upplaga, sidor
Springer, 2019. s. 794-802
Serie
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 11468
Nyckelord [en]
Artificial intelligence, Formal methods, Logic, Stable-model semantics, Temporal logic, Nonmonotonic reasoning, Knowledge representation
Nationell ämneskategori
Datorsystem
Forskningsämne
datalogi
Identifikatorer
URN: urn:nbn:se:umu:diva-159333DOI: 10.1007/978-3-030-19570-0_51Scopus ID: 2-s2.0-85065965824ISBN: 978-3-030-19569-4 (tryckt)ISBN: 978-3-030-19570-0 (digital)OAI: oai:DiVA.org:umu-159333DiVA, id: diva2:1318036
Konferens
16th European Conference on Logics in Artificial Intelligence, JELIA 2019, Rende, Italy, 7-11 May, 2019
Tillgänglig från: 2019-05-24 Skapad: 2019-05-24 Senast uppdaterad: 2019-06-13Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Personposter BETA

Oetsch, JohannesNieves, Juan Carlos

Sök vidare i DiVA

Av författaren/redaktören
Oetsch, JohannesNieves, Juan Carlos
Av organisationen
Institutionen för datavetenskap
Datorsystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 170 träffar
RefereraExporteraLänk till posten
Permanent länk

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