作者: Mariette Sérayet , Pierre Drap , Odile Papini
DOI: 10.1007/978-3-642-02906-6_37
关键词: Semantics (computer science) 、 Mathematics 、 Encoding (memory) 、 Propositional formula 、 Context (language use) 、 Set (abstract data type) 、 Belief revision 、 Answer set programming 、 Logic programming 、 Theoretical computer science 、 Algorithm
摘要: Most of belief revision operations have been proposed for totally preordrered information. However, in case partial ignorance, pieces information are partially preordered and few effective approaches proposed. The paper presents a new framework revising information, called Partially Preordered Removed Sets Revision (PPRSR). notion removed set, initially defined the context non ordered or is extended to preorders. sets efficiently computed thanks suitable encoding problem into logic programming with answer set semantics. This captures possibilistic allows implementing it ASP. Finally, shows how PPRSR can be applied real application VENUS european project before concluding.