Compiling A Default Reasoning System into Prolog (1990)
Cached
Download Links
- [ftp.cs.ubc.ca]
- [www.cs.ubc.ca]
- [www.cs.ubc.ca]
- DBLP
Other Repositories/Bibliography
| Venue: | New Generation Computing |
| Citations: | 30 - 4 self |
BibTeX
@ARTICLE{Poole90compilinga,
author = {David Poole},
title = {Compiling A Default Reasoning System into Prolog},
journal = {New Generation Computing},
year = {1990},
volume = {9},
pages = {3--38}
}
Years of Citing Articles
OpenURL
Abstract
Artificial intelligence researchers have been designing representation systems for default and abductive reasoning. Logic Programming researchers have been working on techniques to improve the efficiency of Horn Clause deduction systems. This paper describes how one such default and abductive reasoning system (namely Theorist) can be translated into Horn clauses (with negation as failure), so that we can use the clarity of abductive reasoning systems and the efficiency of Horn clause deduction systems. We thus show how advances in expressive power that artificial intelligence workers are working on can directly utilise advances in efficiency that logic programming researchers are working on. Actual code from a running system is given. 1 Introduction Many people in Artificial Intelligence have been working on default reasoning and abductive diagnosis systems [35, 20, 4, 29]. The systems implemented so far (eg., [1, 16, 12, 34, 32]) are only prototypes or have been developed in A Theo...







