| Paper Abstract and Keywords |
| Presentation |
2004-06-21 14:10
Computing Circumscriptive Models by means of Answer Set Programming
Toshiko Wakaki (Shibaura Inst. of Tech.), Katsumi Inoue (NII) |
| Abstract |
(in Japanese) |
(See Japanese page) |
| (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 $\leq^{P^{1}> \cdots>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) |
| (in English) |
prioritized circumscription / answer set programming / preferences / minimal models / / / / |
| Reference Info. |
IEICE Tech. Rep., vol. 104, no. 133, AI2004-6, pp. 27-32, June 2004. |
| Paper # |
AI2004-6 |
| Date of Issue |
2004-06-14 (AI) |
| ISSN |
Print edition: ISSN 0913-5685 |
| Download PDF |
|
| Conference Information |
| Committee |
AI |
| Conference Date |
2004-06-21 - 2004-06-21 |
| Place (in Japanese) |
(See Japanese page) |
| Place (in English) |
Kikai-Shinko-Kaikan Bldg. |
| Topics (in Japanese) |
(See Japanese page) |
| Topics (in English) |
|
| Paper Information |
| Registration To |
AI |
| Conference Code |
2004-06-AI |
| Language |
English (Japanese title is available) |
| 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 |
| Keyword(5) |
|
| Keyword(6) |
|
| Keyword(7) |
|
| Keyword(8) |
|
| 1st Author's Name |
Toshiko Wakaki |
| 1st Author's Affiliation |
Shibaura Institute of Technology (Shibaura Inst. of Tech.) |
| 2nd Author's Name |
Katsumi Inoue |
| 2nd Author's Affiliation |
National Institute of Informatics (NII) |
| 3rd Author's Name |
|
| 3rd Author's Affiliation |
() |
| 4th Author's Name |
|
| 4th Author's Affiliation |
() |
| 5th Author's Name |
|
| 5th Author's Affiliation |
() |
| 6th Author's Name |
|
| 6th Author's Affiliation |
() |
| 7th Author's Name |
|
| 7th Author's Affiliation |
() |
| 8th Author's Name |
|
| 8th Author's Affiliation |
() |
| 9th Author's Name |
|
| 9th Author's Affiliation |
() |
| 10th Author's Name |
|
| 10th Author's Affiliation |
() |
| 11th Author's Name |
|
| 11th Author's Affiliation |
() |
| 12th Author's Name |
|
| 12th Author's Affiliation |
() |
| 13th Author's Name |
|
| 13th Author's Affiliation |
() |
| 14th Author's Name |
|
| 14th Author's Affiliation |
() |
| 15th Author's Name |
|
| 15th Author's Affiliation |
() |
| 16th Author's Name |
|
| 16th Author's Affiliation |
() |
| 17th Author's Name |
|
| 17th Author's Affiliation |
() |
| 18th Author's Name |
|
| 18th Author's Affiliation |
() |
| 19th Author's Name |
|
| 19th Author's Affiliation |
() |
| 20th Author's Name |
|
| 20th Author's Affiliation |
() |
| Speaker |
Author-1 |
| Date Time |
2004-06-21 14:10:00 |
| Presentation Time |
25 minutes |
| Registration for |
AI |
| Paper # |
AI2004-6 |
| Volume (vol) |
vol.104 |
| Number (no) |
no.133 |
| Page |
pp.27-32 |
| #Pages |
6 |
| Date of Issue |
2004-06-14 (AI) |