Algorithms for Belief Bases

Computationally the hardest part of revision and contraction operations in belief bases is finding the kernel/remainder set. In this chapter, we present algorithms for computing these sets. The similarities between the algorithms suggests that they are deeply related. We present this relation formal...

Full description

Saved in:
Bibliographic Details
Published inBelief Revision in Non-Classical Logics pp. 105 - 113
Main Author Ribeiro, Márcio Moretto
Format Book Chapter
LanguageEnglish
Published London Springer London 2013
SeriesSpringerBriefs in Computer Science
Subjects
Kernel
Minimal cuts
Ontology debugging
Reiter’s algorithm
Remainder set
Online AccessGet full text

Cover

More Information
Summary:Computationally the hardest part of revision and contraction operations in belief bases is finding the kernel/remainder set. In this chapter, we present algorithms for computing these sets. The similarities between the algorithms suggests that they are deeply related. We present this relation formally and show examples where computing the remainder set is much easier than computing the kernel and examples where the opposite is the case.
ISBN:9781447141853
1447141857
ISSN:2191-5768
2191-5776
DOI:10.1007/978-1-4471-4186-0_8