Merging Belief Bases Represented by Logic Programs
From MaRDI portal
Publication:3638164
DOI10.1007/978-3-642-02906-6_33zbMath1245.68187OpenAlexW1523567358MaRDI QIDQ3638164
Odile Papini, Julien Hué, Eric Würbel
Publication date: 2 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02906-6_33
Related Items (4)
Merging existential rules programs in multi-agent contexts through credibility accrual ⋮ Sum-based weighted belief base merging: from commensurable to incommensurable framework ⋮ Logic based merging ⋮ Multi-source multiple change on belief bases
Uses Software
Cites Work
- ASSAT: computing answer sets of a logic program by SAT solvers
- Logic programming and nonmonotonic reasoning. 9th international conference, LPNMR 2007, Tempe, AZ, USA, May 15--17, 2007. Proceedings
- On the Semantics of Arbitration
- Syntactic Propositional Belief Bases Fusion with Removed Sets
- Strong equivalence made easy: nested expressions and weight constraints
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Merging Belief Bases Represented by Logic Programs