A Presumptive System of Defeasible Inference
Abstract
This paper presents a system on non-monotonic reasoning with defeasible rules that is as presumptive as possible (as bold as possible), while still being warranted. The advantage of such a system is that many multiple extension problems can be solved without additional explicit knowledge; ordering competing extensions can be done in a natural and defensible way, with mere implicit knowledge. The objectives closely resemble Poole's objectives. But the logic is different from Poole's. The most important difference is that this system allows the kind of chaining that many other non-monotonic systems allow. Also, the form in which the inference system is presented is quite novel for an AI system. It mimics an established system of indictive logic, and it treats defeat in the way of the epistemologist-philosophers. The focus is syntactic, and the limitation of resource-bounded theorem-proving can be treated formally.
Document Details
- Document Type
- Technical Report
- Publication Date
- May 01, 1986
- Accession Number
- ADA250619
Entities
People
- Ronald P. Loui
Organizations
- University of Rochester