Normal form results for default logic
The present paper develops a representation theory for default logic. Section 2 introduces the notion of representability in default theories by lifting the notion of normal form to the context of default theory and defining equivalent default theories. A weaker notion, called semi- representability, is studied in Section 3, proving that every default theory is semi-representable by a default theory with all rules either monotonic or semi-normal. Section 4 gives a representability result for weak extensions, showing that every finite set of finitely generated theories is precisely the collection of weak extensions of a suitable chosen default theory. A result on autoepistemic expansions is obtained as a corollary. For the entire collection see [Zbl 0819.68110].
- Default logic generalized and simplified
- Prolog technology for default reasoning: proof theory and compilation techniques
- A graph-theoretic approach to default logic
- Operational concepts of nonmonotonic logics. I: Default logic
- Defaults as restrictions on classical Hilbert-style proofs
- New proofs in default logic theory
- The place of logic in reasoning
- Representation properties of abstract default reasoning frameworks
- scientific article; zbMATH DE number 4033708 (Why is no real title available?)
- Semi-representability of default theories in rational default logic
- Representability of default logic in artificial intelligence
- From answer set logic programming to circumscription via logic of GK
This page was built for publication: Normal form results for default logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202924)