Implementing Prioritized Merging with ASP

DOI10.1007/978-3-642-14055-6_15zbMath1211.68431OpenAlexW1603954735MaRDI QIDQ3163981

Odile Papini, Eric Würbel, Julien Hué

Publication date: 27 October 2010

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14055-6_15

zbMATH Keywords

fusioniterated revisionASP reasoning under inconsistency

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Uses Software

• ASSAT
• NoMoRe

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Logical representation and fusion of prioritized information based on guaranteed possibility measures: Application to the distance-based merging of classical bases
• Weakening conflicting information for iterated revision and knowledge integration
• ASSAT: computing answer sets of a logic program by SAT solvers
• Answer set programming based on propositional satisfiability
• Possibilistic merging and distance-based fusion of propositional information
• A practical approach to revising prioritized knowledge bases
• Logic programming and nonmonotonic reasoning. 9th international conference, LPNMR 2007, Tempe, AZ, USA, May 15--17, 2007. Proceedings
• On the Semantics of Arbitration
• Approaches to Constructing a Stratified Merged Knowledge Base
• Syntactic Propositional Belief Bases Fusion with Removed Sets
• Knowledge Base Stratification and Merging Based on Degree of Support

This page was built for publication: Implementing Prioritized Merging with ASP