Studia Logica
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.
@article{libe-07, title = {Consistency defaults}, year = {2007}, author = {Liberatore, Paolo}, journal = {Studia Logica}, pages = {89-110}, number = {1}, volume = {86}, }doi: 10.1007/s11225-007-9047-8