{"type":"ScholarlyArticle","title":"Compiling Prioritized Circumscription into Extended Logic Programs","authors":[{"name":"Toshiko Wakaki","slug":"toshiko-wakaki","given":"Toshiko","family":"Wakaki","affiliation":""},{"name":"Ken Satoh","slug":"ken-satoh","given":"Ken","family":"Satoh","affiliation":""}],"abstract":"We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized circumscription. In this paper, we show theoretically that any circumscription whose theory contains both the domain closure axiom and the uniqueness of names axioms can always be compiled into an extended logic program II, so that, whether a ground literal is provable from circumscription or not, can always be evaluated by deciding whether the literal is true in all answer sets ofii, which can be computed by running II under the existing logic programming interpreter.","doi":null,"url":"https://ijcai.org/proceedings/1997/28","pdf":"https://ijcai.org/proceedings/1997/0028.pdf","markdown":"https://ijcai.org/proceedings/1997/28.md","bibtex":"https://ijcai.org/proceedings/1997/bibtex/28","volume":{"slug":"1997","title":"Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1997","url":"https://ijcai.org/proceedings/1997/","year":1997,"location":"Nagoya, Japan","dates":"","editors":"Martha E. Pollack","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":28,"pages":{"first":182,"last":188},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}