| Creator |
|
|
|
| Language |
|
| Publisher |
|
|
|
| Date |
|
| Source Title |
|
| Vol |
|
| Issue |
|
| First Page |
|
| Last Page |
|
| Publication Type |
|
| Access Rights |
|
| JaLC DOI |
|
| Related DOI |
|
| Related URI |
|
| Relation |
|
| Abstract |
Answer set programming (ASP), that computes answer sets from extended logic programs including "negation as failure", has been a focus not only in the field of logic programming but also in applicatio...n areas. The basic algorithm to compute answer sets based on model generation theorem proving has been proposed by Inoue, et al. The implementation of the basic algorithm, however, generates enormous combination of hypotheses inefficiently. In this paper, we propose a new implementation method based on a minimal model generator, MM-MGTP, including some techniques to prune redundant branches. Some experimental results are shown for comparison with the naive implementation and other systems.show more
|
Export Mendeley
p119