Premium
Defeat among arguments: a system of defeasible inference
Author(s) -
Loui R. P.
Publication year - 1987
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/j.1467-8640.1987.tb00178.x
Subject(s) - defeasible estate , inference , backward chaining , computer science , defeasible reasoning , non monotonic logic , chaining , artificial intelligence , forward chaining , extension (predicate logic) , rule of inference , inference engine , theoretical computer science , cognitive science , expert system , programming language , psychology , psychotherapist
This paper presents a system of nonmonotonic reasoning with defeasible rules. 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 defeasible way, via syntactic considerations. 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 nonmonotonic systems allow. Also, the form in which the inference system is presented is quite unusual. It mimics an established system of inductive logic, and it treats defeat in the way of the epistemologist‐philosophers. The contributions are both of content and of form: (content) the kinds of defeat that are considered, and (form) the way in which defeat is treated in the rules of inference.