Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases

DOI10.1016/j.ijar.2014.06.003zbMath1309.68181OpenAlexW2158104146MaRDI QIDQ459042

J. Herrera, D. Rodríguez-Gómez

Publication date: 8 October 2014

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

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

zbMATH Keywords

inconsistency measuresSATminimal inconsistent subsetsminimal unsatisfiable subformulaerandom SAT

Mathematics Subject Classification ID

Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (14)

Symbolic Possibilistic Logic: Completeness and Inference Methods ⋮ Measuring inconsistency with constraints for propositional knowledge bases ⋮ A max-term counting based knowledge inconsistency checking strategy and inconsistency measure calculation of fuzzy knowledge based systems ⋮ Measuring inconsistency with many-valued logics ⋮ A distance-based framework for inconsistency-tolerant reasoning and inconsistency measurement in DL-Lite ⋮ Responsibility for inconsistency ⋮ Stream-based inconsistency measurement ⋮ OuterCount: a first-level solution-counter for quantified Boolean formulas ⋮ Inconsistency Measurement ⋮ On the measure of conflicts: an argumentation-based framework ⋮ On the complexity of inconsistency measurement ⋮ General information spaces: measuring inconsistency, rationality postulates, and complexity ⋮ Forgetting-Based Inconsistency Measure ⋮ On the expressivity of inconsistency measures

Uses Software

• MiniSat
• AMUSE
• QUICKXPLAIN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving satisfiability problems with preferences
• On the measure of conflicts: Shapley inconsistency values
• Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\)
• A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
• Using local search to find MSSes and MUSes
• Diagnosing multiple faults
• A theory of diagnosis from first principles
• The complexity of facets resolved
• Minimally inconsistent LP
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• Classifications for inconsistent theories
• Nonmonotonic reasoning: From complexity to algorithms
• Approximating minimal unsatisfiable subformulae by means of adaptive core search
• Measuring inconsistency
• Local-search extraction of mUSes
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Measuring the blame of each formula for inconsistent prioritized knowledge bases
• Measuring Consistency Gain and Information Loss in Stepwise Inconsistency Resolution
• MEASURING INCONSISTENCY IN A NETWORK INTRUSION DETECTION RULE SET BASED ON SNORT
• Measuring Inconsistency for Description Logics Based on Paraconsistent Semantics
• Eliminating Redundant Clauses in SAT Instances
• Sharp thresholds of graph properties, and the $k$-sat problem
• Consistent subsets of inconsistent systems: structure and behaviour
• Does This Set of Clauses Overlap with at Least One MUS?
• Theory and Applications of Satisfiability Testing
• Formula Preprocessing in MUS Extraction
• Measuring Inconsistency through Minimal Proofs
• A Reasoning Platform Based on the MI Shapley Inconsistency Value
• Inconsistency Tolerance
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Theory and Applications of Satisfiability Testing

This page was built for publication: Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases