Syntactic Propositional Belief Bases Fusion with Removed Sets

摘要: The problem of merging multiple sources information is central in several domains computer science. In knowledge representation for artificial intelligence, approaches have been proposed propositional bases fusion, however, most them are defined at a semantic level and untractable. This paper proposes new syntactic approach belief called Removed Sets Fusion (RSF). notion removed-set, initially the context revision extended to fusion classical operations syntactically captured by RSF. order efficiently implement RSF, shows how RSF can be encoded into logic program with answer set semantics, then presents an adaptation smodels system devoted compute removed sets perform Finally preliminary experimental study that programming seems promising performing on real scale applications.