|
| << previous |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 8 of 8 found articles
| Title: |
The Compactness of Belief Revision and Update Operators |
| Author: |
Paolo Liberatore Marco Schaerf |
| Appeared in: |
Fundamenta informaticae |
| Paging: | Volume 62 (2004) nr. 3-4 pages 377-393 |
| Year: |
2004-11-30 |
| Contents: |
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. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 8 of 8 found articles
| << previous |