Deduction with supernormal defaults

From MaRDI portal





The aim of the present paper is to clarify the semantics of partially ordered supernormal defaults and to contribute to the algorithmic foundations of such defaults. The author develops an efficient and general algorithm for query evaluation, being able to generate disjunctive answers, and supporting the credulous, skeptical, and careful view. In order to check the applicability of defaults as soon as possible, a partial extension notion is introduced. For the entire collection see [Zbl 0819.68110].











This page was built for publication: Deduction with supernormal defaults

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202917)