umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Stable-Ordered Models for Propositional Theories with Order Operators
Umeå University, Faculty of Science and Technology, Department of Computing Science.
Umeå University, Faculty of Science and Technology, Department of Computing Science.ORCID iD: 0000-0003-4072-8795
2019 (English)In: Logics in Artificial Intelligence: JELIA 2019 / [ed] Calimeri, Francesco; Leone, Nicola; Manna, Marco, Springer, 2019, p. 794-802Conference paper, Published paper (Refereed)
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.

Place, publisher, year, edition, pages
Springer, 2019. p. 794-802
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 11468
Keywords [en]
Artificial intelligence, Formal methods, Logic, Stable-model semantics, Temporal logic, Nonmonotonic reasoning, Knowledge representation
National Category
Computer Systems
Research subject
Computer Science
Identifiers
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 (print)ISBN: 978-3-030-19570-0 (electronic)OAI: oai:DiVA.org:umu-159333DiVA, id: diva2:1318036
Conference
16th European Conference on Logics in Artificial Intelligence, JELIA 2019, Rende, Italy, 7-11 May, 2019
Available from: 2019-05-24 Created: 2019-05-24 Last updated: 2019-06-13Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Oetsch, JohannesNieves, Juan Carlos

Search in DiVA

By author/editor
Oetsch, JohannesNieves, Juan Carlos
By organisation
Department of Computing Science
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 136 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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