A propositional knowledge base can be seen as a compact representation of a set of models. When a knowledge base T is updated with a formula P. the resulting set of models can be represented in two ways: either by a theory T' that is equivalent to T * P or by the pair <T, P>. The second representation can be super-polinomially more compact than the first. In this paper. we prove that the compactness of this representation depends on the specific semantics of *. e.g.. Winslett's semantics is more compact than Ginsberg's.
The compactness of belief revision and update operators / Liberatore, Paolo; Schaerf, Marco. - In: FUNDAMENTA INFORMATICAE. - ISSN 0169-2968. - 62:3-4(2004), pp. 377-393.
The compactness of belief revision and update operators
LIBERATORE, Paolo;SCHAERF, Marco
2004
Abstract
A propositional knowledge base can be seen as a compact representation of a set of models. When a knowledge base T is updated with a formula P. the resulting set of models can be represented in two ways: either by a theory T' that is equivalent to T * P or by the pairFile | Dimensione | Formato | |
---|---|---|---|
VE_2004_11573-233029.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
10.84 MB
Formato
Adobe PDF
|
10.84 MB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.