Skip to Main content Skip to Navigation
Journal articles

Extending Removed Sets Revision to partially preordered belief bases

Abstract : Most of belief revision operations have been proposed for totally preordrered information. However, in case of partial ignorance, pieces of information are partially preordered and few effective approaches of revision have been proposed. The paper presents a new framework for revising partially preordered information, called Partially Preordered Removed Sets Revision (PPRSR). The notion of removed set, initially defined in the context of the revision of non ordered or totally preordered information is extended to partial preorders. The removed sets are efficiently computed thanks to a suitable encoding of the revision problem into logic programming with answer set semantics. This framework captures the possibilistic revision of partially preordered information and allows for implementing it with ASP. Finally, it shows how PPRSR can be applied to a real application of the VENUS european project.
Document type :
Journal articles
Complete list of metadatas

Cited literature [46 references]  Display  Hide  Download

https://hal-amu.archives-ouvertes.fr/hal-01479553
Contributor : William Domingues Vinhas <>
Submitted on : Saturday, March 24, 2018 - 1:45:48 AM
Last modification on : Monday, March 30, 2020 - 8:43:55 AM
Long-term archiving on: : Thursday, September 13, 2018 - 5:37:01 AM

File

srayet2011.pdf
Files produced by the author(s)

Identifiers

Citation

Mariette Serayet, Pierre Drap, Odile Papini. Extending Removed Sets Revision to partially preordered belief bases. International Journal of Approximate Reasoning, Elsevier, 2011, 52 (1), pp.110-126. ⟨10.1016/j.ijar.2010.05.008⟩. ⟨hal-01479553⟩

Share

Metrics

Record views

462

Files downloads

682