Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Consistency Defaults

Paolo Liberatore
Studia Logica: An International Journal for Symbolic Logic
Vol. 86, No. 1 (Jun., 2007), pp. 89-110
Published by: Springer
Stable URL: http://www.jstor.org/stable/40210741
Page Count: 22
  • Download ($43.95)
  • Cite this Item
Consistency Defaults
Preview not available

Abstract

A consistency default is a prepositional 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.

Page Thumbnails

  • Thumbnail: Page 
[89]
    [89]
  • Thumbnail: Page 
90
    90
  • Thumbnail: Page 
91
    91
  • Thumbnail: Page 
92
    92
  • Thumbnail: Page 
93
    93
  • Thumbnail: Page 
94
    94
  • Thumbnail: Page 
95
    95
  • Thumbnail: Page 
96
    96
  • Thumbnail: Page 
97
    97
  • Thumbnail: Page 
98
    98
  • Thumbnail: Page 
99
    99
  • Thumbnail: Page 
100
    100
  • Thumbnail: Page 
101
    101
  • Thumbnail: Page 
102
    102
  • Thumbnail: Page 
103
    103
  • Thumbnail: Page 
104
    104
  • Thumbnail: Page 
105
    105
  • Thumbnail: Page 
106
    106
  • Thumbnail: Page 
107
    107
  • Thumbnail: Page 
108
    108
  • Thumbnail: Page 
109
    109
  • Thumbnail: Page 
110
    110