APPROXIMATE INFERENCE IN DEFAULT LOGIC AND CIRCUMSCRIPTION

Article type: Research Article

Authors: Cadoli, Marco | Schaerf, Marco

Affiliations: Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, via Salaria 113, 1-00198 Roma, Italia, [email protected] [email protected]

Abstract: We propose a technique for dealing with the high complexity of reasoning under propositional default logic and circumscription. The technique is based on the notion of approximation: A logical consequence relation is computed by means of sound and progressively “more complete” relations, as well as complete and progressively “more sound” ones. Both sequences generated in this way converge to the original consequence relation and are easier to compute. Moreover they are given a clear semantics based on multivalued logic. With this technique unsoundness and incompleteness are introduced in a controlled way and precisely characterized.

DOI: 10.3233/FI-1994-21126

Journal: Fundamenta Informaticae, vol. 21, no. 1-2, pp. 103-112, 1994