Presentation 2004-06-21
Computing Circumscriptive Models by means of Answer Set Programming
Toshiko WAKAKI, Katsumi INOUE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In computing circumscription by logic programming, circumscription is usually transformed into some target logic program whose answer sets yield the Herbrand models of circumscription. In this paper, we propose a new method of computing models of prioritized circumscription in answer set programming, which is correct and more efficient than previous approaches. The basic idea of our approach is to transform a given circumscription into a general extended disjunctive program whose answer sets (if exist) yield strictly preferred models to a given candidate model with respect to the preorder≦P^1>・・・>P^k;Z. Hence its inconsistency enables us to determine models of prioritized circumscription. We also show the soundness and completeness theorems for our method. Based on our new method, a circumscriptive model generator has already been implemented, and the preliminary experimental results are encouraging.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) prioritized circumscription / answer set programming / preferences / minimal models
Paper # AI2004-6
Date of Issue

Conference Information
Committee AI
Conference Date 2004/6/14(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Vice Chair

Paper Information
Registration To Artificial Intelligence and Knowledge-Based Processing (AI)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Computing Circumscriptive Models by means of Answer Set Programming
Sub Title (in English)
Keyword(1) prioritized circumscription
Keyword(2) answer set programming
Keyword(3) preferences
Keyword(4) minimal models
1st Author's Name Toshiko WAKAKI
1st Author's Affiliation Shibaura Institute of Technology()
2nd Author's Name Katsumi INOUE
2nd Author's Affiliation National Institute of Informatics
Date 2004-06-21
Paper # AI2004-6
Volume (vol) vol.104
Number (no) 133
Page pp.pp.-
#Pages 6
Date of Issue