Deduction with supernormal defaults
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Semantics in the theory of computing (68Q55) Logic in artificial intelligence (68T27) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)
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].
- Prolog technology for default reasoning: proof theory and compilation techniques
- Variable priorities and exclusionary reasons in input/output logic
- Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic
- A new methodology for query answering in default logics via structure-oriented theorem proving
- Modular specifications with supernormal defaults
- A query answering algorithm for Lukaszewicz' general open default theory
- CONCILIATORY REASONING, SELF-DEFEAT, AND ABSTRACT ARGUMENTATION
- Believing in default rules: inclusive default reasoning
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)