Towards efficient default reasoning, in (1995)
| Venue: | Proc. IJCAI-95 |
| Citations: | 23 - 3 self |
BibTeX
@INPROCEEDINGS{Niemela95towardsefficient,
author = {Ilkka Niemela},
title = {Towards efficient default reasoning, in},
booktitle = {Proc. IJCAI-95},
year = {1995},
pages = {312--318},
publisher = {Morgan Kaufmann}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A decision method for Reiter's default logic is developed. It can determine whether a default theory has an extension, whether a formula is in some extension of a default theory and whether a formula is in every extension of a default theory. The method handles full propositional default logic. It can be implemented to work in polynomial space and by using only a theorem prover for the underlying propositional logic as a subroutine. The method divides default reasoning into two major subtasks: the search task of examining every alternative for extensions, which is solved by backtracking search, and the classical reasoning task, which can be implemented by a theorem prover for the underlying classical logic. Special emphasis is given to the search problem. The decision method employs a new compact representation of extensions which reduces the search space. Efficient techniques for pruning the search space further are developed. 1
