Computing logic programs with ordered disjunction using asprin

Joohyung Lee, Zhun Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Logic Programs with Ordered Disjunction (LPOD) is an extension of standard answer set programs to handle preference using the high-level construct of ordered disjunction whereas asprin is a recently proposed, general, flexible, and extensible framework that provides low-level constructs for representing preference in answer set programming. We present an encoding of LPOD in the language of asprin and the implementation of LPOD called LPOD2ASPRIN based on the encoding. Unlike the known method that applies only to a fragment of LPOD, our translation is general, direct, and simpler. It also leads to more efficient computation of LPOD using asprin.

Original languageEnglish (US)
Title of host publicationPrinciples of Knowledge Representation and Reasoning
Subtitle of host publicationProceedings of the 16th International Conference, KR 2018
EditorsMichael Thielscher, Francesca Toni, Frank Wolter
PublisherAAAI press
Pages57-61
Number of pages5
ISBN (Electronic)9781577358039
StatePublished - 2018
Event16th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2018 - Tempe, United States
Duration: Oct 30 2018Nov 2 2018

Publication series

NamePrinciples of Knowledge Representation and Reasoning: Proceedings of the 16th International Conference, KR 2018

Conference

Conference16th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2018
Country/TerritoryUnited States
CityTempe
Period10/30/1811/2/18

ASJC Scopus subject areas

  • Software
  • Logic

Fingerprint

Dive into the research topics of 'Computing logic programs with ordered disjunction using asprin'. Together they form a unique fingerprint.

Cite this