Modal Nonmonotonic Logic with Restricted Application of the Negation as Failure to Prove Rule¹

Article type: Research Article

Authors: Truszczynski, Mirosław

Affiliations: Department of Computer Science, University of Kentucky, Lexington, KY 40506-0027, USA

Note: [1] This work was partially supported by Army Research Office under grant DAAL03-89-K-0124, and by National Science Foundation and the Commonwealth of Kentucky EPSCoR program under grant RII 8610671.

Abstract: In the paper we study a family of modal nonmonotonic logics closely related to the family of modal nonmonotonic logics proposed by McDermott and Doyle. For a modal logic S and a fixed collection of formulas X we introduce the notion of an (S, X)-expansion. We restrict to modal logics which have a complete Kripke semantics. We study the properties of (S, X)-expansions and show that in many respects they are analogous to the properties of S-expansions in nonmonotonic modal logics of McDermott and Doyle.

DOI: 10.3233/FI-1991-14309

Journal: Fundamenta Informaticae, vol. 14, no. 3, pp. 355-366, 1991