From disjunctive to normal logic programs via unfolding and shifting

Yi Zhou

    Research output: Chapter in Book / Conference PaperConference Paperpeer-review

    2 Citations (Scopus)

    Abstract

    We show that every propositional disjunctive logic program under the answer set semantics can be equivalently transformed into a normal one via unfolding and shifting. More precisely, after iteratively applying the unfolding operator for some rules in a disjunctive program, its shifted program, which is a normal program, must have the same answer sets as the original disjunctive program.
    Original languageEnglish
    Title of host publicationECAI 2014: 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic: Including Prestigious Applications of Intelligent Systems (PAIS 2014): Proceedings
    PublisherIOS Press
    Pages1139-1140
    Number of pages2
    ISBN (Print)9781614994183
    Publication statusPublished - 2014
    EventEuropean Conference on Artificial Intelligence -
    Duration: 18 Aug 2014 → …

    Conference

    ConferenceEuropean Conference on Artificial Intelligence
    Period18/08/14 → …

    Keywords

    • answer set programming
    • artificial intelligence
    • logic programming

    Fingerprint

    Dive into the research topics of 'From disjunctive to normal logic programs via unfolding and shifting'. Together they form a unique fingerprint.

    Cite this