A consistency default is a propositional inference rule that asserts the consistency of a formula in its consequence. Consistency defaults allow for a straightforward encoding of domains in which it is explicitely known when something is possible. The logic of consistency defaults can be seen as a variant of cumulative default logic or as a generalization of justified default logic; it is also able to simulate Reiter default logic in the seminormal case. A semantical characterization of consistency defaults in terms of processes and in terms of a fixpoint equation is given, as well as a normal form. © 2007 Springer Science+Business Media B.V.
Consistency defaults / Liberatore, Paolo. - In: STUDIA LOGICA. - ISSN 0039-3215. - STAMPA. - 86:1(2007), pp. 89-110. [10.1007/s11225-007-9047-8]
Consistency defaults
LIBERATORE, Paolo
2007
Abstract
A consistency default is a propositional inference rule that asserts the consistency of a formula in its consequence. Consistency defaults allow for a straightforward encoding of domains in which it is explicitely known when something is possible. The logic of consistency defaults can be seen as a variant of cumulative default logic or as a generalization of justified default logic; it is also able to simulate Reiter default logic in the seminormal case. A semantical characterization of consistency defaults in terms of processes and in terms of a fixpoint equation is given, as well as a normal form. © 2007 Springer Science+Business Media B.V.| File | Dimensione | Formato | |
|---|---|---|---|
|
VE_2007_11573-125702.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
692.08 kB
Formato
Adobe PDF
|
692.08 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
