Implementing semantic merging operators using binary decision diagrams

DOI10.1016/J.IJAR.2008.03.008MaRDI QIDQ2379333zbMATH OpenOpenAlexFDO

Authors Nikos Gorogiannis, Anthony Hunter

Publication date 19 March 2010

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2008.03.008

zbMATH Keywords

automated reasoningknowledge mergingknowledge representation

Mathematics Subject Classification ID

Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• \(\text{DA}^2\) merging operators
• Merging Information Under Constraints: A Logical Framework
• scientific article; zbMATH DE number 1844490
• Merging existential rules programs in multi-agent contexts through credibility accrual
• Logics in Artificial Intelligence

Cites work

• \(\text{DA}^2\) merging operators
• Disjunctive merging: quota and Gmin merging operators
• Easy problems are sometimes hard
• Error detecting and error correcting codes
• Generating hard satisfiability problems
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 67477 (Why is no real title available?)
• scientific article; zbMATH DE number 1735982 (Why is no real title available?)
• scientific article; zbMATH DE number 1946853 (Why is no real title available?)
• scientific article; zbMATH DE number 2084701 (Why is no real title available?)
• scientific article; zbMATH DE number 1849172 (Why is no real title available?)
• Implementation of belief change operators using BDDs
• Merging Information Under Constraints: A Logical Framework
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• On the logic of theory change: Partial meet contraction and revision functions
• On the Semantics of Arbitration
• Ordered binary decision diagrams and the Shannon effect
• Reasoning with ordered binary decision diagrams
• Some computational aspects of DISTANCE SAT
• Syntactic Propositional Belief Bases Fusion with Removed Sets
• Two modellings for theory change

Cited in

(14)

• A graded approach to database repair by context-aware distance semantics
• Analysing inconsistent information using distance-based measures
• On some associations between mathematical morphology and artificial intelligence
• Merging existential rules programs in multi-agent contexts through credibility accrual
• A dissimilarity-based framework for generating inconsistency-tolerant logics
• Merging Qualitative Constraints Networks Using Propositional Logic
• scientific article; zbMATH DE number 1901218 (Why is no real title available?)
• Logic based merging
• A framework for reasoning under uncertainty based on non-deterministic distance semantics
• Merging First-Order Knowledge Using Dilation Operators
• Simplified forms of computerized reasoning with distance semantics
• Morphologic for knowledge dynamics: revision, fusion and abduction
• Main issues in belief revision, belief merging and information fusion
• Disjunctive merging: quota and Gmin merging operators

Describes a project that uses

Uses Software

• BuDDy

This page was built for publication: Implementing semantic merging operators using binary decision diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379333)