Premium
ASSUMPTION‐BASED REASONING AND CLAUSE MANAGEMENT SYSTEMS
Author(s) -
Kean Alex,
Tsiknis George
Publication year - 1992
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.1992.tb00335.x
Subject(s) - computer science , extension (predicate logic) , problem solver , set (abstract data type) , process (computing) , artificial intelligence , prime (order theory) , solver , state (computer science) , mathematics , algorithm , programming language , software engineering , combinatorics
A truth maintenance system is a subsystem that manages the utilization of assumptions in the reasoning process of a problem solver. Doyle's original motivation for creating a truth maintenance system was to augment a reasoning system with a control strategy for activities concerning its nonmonotonic state of beliefs. Hitherto, much effort has been invested in designing and implementing the concept of truth maintenance, and little effort has been dedicated to the formalization that is essential to understanding it. This paper provides a complete formalization of the principle of truth maintenance. Motivated by Reiter and de Kleer's preliminary report on the same subject, this paper extends their study and gives a formal account of the concept of truth maintenance under the general title of assumption‐based reasoning. The concept of assumption‐based theory is defined, and the notions of explanation and direct consequence are presented as forms of plausible conclusions with respect to this theory. Additionally, the concepts of extension and irrefutable sentences are discussed together with other variations of explanation and direct consequence. A set of algorithms for computing these conclusions for a given theory are presented using the notion of prime implicates. Finally, an extended example on Boolean circuit diagnosis is shown to exemplify these ideas.