Merging Belief Bases Represented by Logic Programs

Hué, Julien; Papini, Odile; Würbel, Eric

doi:10.1007/978-3-642-02906-6_33

Cited by 14 publications

(8 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the Logic Programming area, a number of relevant research works also have focused on dealing with the problem of knowledge merging. In [27], Hué et al have introduced a merging approach based on stable model semantics using the logic of Here-and-There introduced in [49]. The authors consider a merging strategy based on the method of Removed Sets Fusion to decide the set of formulas to remove in order to restore inconsistency.…”

Section: Merging Knowledge Basesmentioning

confidence: 99%

“…The work in [30], which presented a formalization for merging propositional knowledge bases, has inspired and established the foundations to numerous works in Belief Revision. Several other works have also focused on defining merging operators, such as [14,27]. The formal account of merging operators allows not only the representation of features intrinsically associate with pieces of information but also provides a natural and easy way to represent other types of domain information such as the identification of the sources from where information comes, as well as properties of such informants.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Merging existential rules programs in multi-agent contexts through credibility accrual

Deagustini

Teze

Martínez

et al. 2021

Information Sciences

View full text Add to dashboard Cite

This is a PDF file of an article that has undergone enhancements after acceptance, such as the addition of a cover page and metadata, and formatting for readability, but it is not yet the definitive version of record. This version will undergo additional copyediting, typesetting and review before it is published in its final form, but we are providing this version to give early visibility of the article. Please note that, during the production process, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain.

show abstract

Section: Merging Knowledge Basesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Merging existential rules programs in multi-agent contexts through credibility accrual

Deagustini

Teze

Martínez

et al. 2021

Information Sciences

View full text Add to dashboard Cite

show abstract

“…Krümpelmann and Kern-Isberner (2012) extended belief base revision to ASP with the "Remainder Sets" approach for screened consolidation, stemming from semi-revision proposed by Hansson (1997). The "Removed Sets" approach for merging and revision has been extended to ASP (Hué et al, 2009(Hué et al, , 2013, called respectively, ΠRSF and ΠRSR. These two approaches only use a strategy stemming from the removal of rules, but they differ on the minimality criteria, set inclusion for the "Remainder Sets" approach and cardinality for ΠRSR.…”

Section: Related Workmentioning

confidence: 99%

“…From a syntactic point of view, formula-based belief merging and revision have been extended to ASP. The "removed sets" approach for fusion and revision (RSF) (Hué, Papini, & Würbel, 2008) and (RSR) (Benferhat et al, 2010) respectively, proposed in propositional logic have been extended to ASP (Hué, Papini, & Würbel, 2009. Besides, Krümpelmann and Kern-Isberner extended to ASP the "remainder sets" approach for screened consolidation initially defined in a classical setting.…”

Section: Introductionmentioning

confidence: 99%

A Semantic Characterization ASP Base Revision

Garcia

Lefèvre²,

Stéphan³

et al. 2019

jair

Self Cite

View full text Add to dashboard Cite

The paper deals with base revision for Answer Set Programming (ASP). Base revision in classical logic is done by the removal of formulas. Exploiting the non-monotonicity of ASP allows one to propose other revision strategies, namely addition strategy or removal and/or addition strategy. These strategies allow one to define families of rule-based revision operators. The paper presents a semantic characterization of these families of revision operators in terms of answer sets. This semantic characterization allows for equivalently considering the evolution of syntactic logic programs and the evolution of their semantic content. It then studies the logical properties of the proposed operators and gives complexity results.

show abstract

“…Krümpelmann and Kern-Isberner (Krümpelmann & Kern-Isberner, 2012) extended belief base revision to ASP with the "Remainder Sets" approach for screened consolidation, stemming from semi-revision proposed in (Hansson, 1997). The "Removed Sets" approach for merging and revision has been extended to ASP (Hué et al, 2009(Hué et al, , 2013, called respectively, ΠRSF and ΠRSR. These two approaches only use a strategy stemming from the removal of rules, but they differ on the minimality criteria, set inclusion for the "Remainder Sets" approach and cardinality for ΠRSR.…”

Section: Related Workmentioning

confidence: 99%