Propositional knowledge base revision and minimal change
Artificial Intelligence
Removed Sets Fusion: Performing Off The Shelf
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Revision of partially ordered information: axiomatization, semantics and iteration
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Clasp: a conflict-driven answer set solver
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Defining relative likelihood in partially-ordered preferential structures
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Hi-index | 0.00 |
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 before concluding.