A default theory can be seen as a way for representing a set of formulae, i.e., its extensions. In this paper, we characterize the sets of formulae that can be expressed by a default theory according to various semantics: justified, constrained, rational, cumulative, QDL, CADL, and two semantics with priorities. These characterizations imply some non-translatability results between semantics.
Representability in default logic / Liberatore, Paolo. - In: LOGIC JOURNAL OF THE IGPL. - ISSN 1367-0751. - STAMPA. - 13:3(2005), pp. 335-351. [10.1093/jigpal/jzi028]
Representability in default logic
LIBERATORE, Paolo
2005
Abstract
A default theory can be seen as a way for representing a set of formulae, i.e., its extensions. In this paper, we characterize the sets of formulae that can be expressed by a default theory according to various semantics: justified, constrained, rational, cumulative, QDL, CADL, and two semantics with priorities. These characterizations imply some non-translatability results between semantics.File allegati a questo prodotto
| File | Dimensione | Formato | |
|---|---|---|---|
|
VE_2005_11573-125700.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
220.08 kB
Formato
Adobe PDF
|
220.08 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
