On the complexity of inconsistency measurement
From MaRDI portal
Publication:2321337
DOI10.1016/j.artint.2019.07.001zbMath1478.68359OpenAlexW2953903422MaRDI QIDQ2321337
Matthias Thimm, Johannes Peter Wallner
Publication date: 28 August 2019
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.12708/18864
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)
Related Items (8)
OuterCount: a first-level solution-counter for quantified Boolean formulas ⋮ On measuring inconsistency in definite and indefinite databases with denial constraints ⋮ A comparison of ASP-based and SAT-based algorithms for the contension inconsistency measure ⋮ Handling and measuring inconsistency in non-monotonic logics ⋮ Measuring inconsistency in some branching time logics ⋮ A model of three-way decisions for knowledge harnessing ⋮ General information spaces: measuring inconsistency, rationality postulates, and complexity ⋮ On quasi-inconsistency and its complexity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the expressivity of inconsistency measures
- Fast, flexible MUS enumeration
- The QBF Gallery: behind the scenes
- SAT-based MaxSAT algorithms
- Inconsistency measures for probabilistic logics
- A dichotomy in the complexity of counting database repairs
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
- The complexity of computing the permanent
- On the measure of conflicts: Shapley inconsistency values
- A syntax-based approach to measuring the degree of inconsistency for belief bases
- Stream-based inconsistency measurement
- Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
- Counting complexity of propositional abduction
- Measures of inconsistency and defaults
- Reasoning under inconsistency: a forgetting-based approach
- The complexity of combinatorial problems with succinct input representation
- On the complexity of the maximum satisfiability problem for Horn formulas
- The complexity of facets resolved
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- Classifications for inconsistent theories
- The logic of paradox
- Nonmonotonic reasoning: From complexity to algorithms
- An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
- Hierarchies of polynomially solvable satisfiability problems
- Scalar aggregation in inconsistent databases.
- Understanding the complexity of axiom pinpointing in lightweight description logics
- Quantifying conflicts in propositional logic through prime implicates
- Minimal-change integrity maintenance using tuple deletions
- Complexity of generalized satisfiability counting problems
- Iterative and core-guided maxsat solving: a survey and assessment
- Approaches to measuring inconsistency for stratified knowledge bases
- On an MCS-based inconsistency measure
- Analysing inconsistent first-order knowledgebases
- On repairing and querying inconsistent probabilistic spatio-temporal databases
- Localising iceberg inconsistencies
- Measuring inconsistency with many-valued logics
- Redundancy in logic. I: CNF propositional formulae
- Subtractive reductions and complete problems for counting complexity classes
- Efficient Reasoning for Inconsistent Horn Formulae
- Measuring Inconsistency in Answer Set Programs
- Measuring Consistency Gain and Information Loss in Stepwise Inconsistency Resolution
- On Computing Preferred MUSes and MCSes
- On Measuring Inconsistency Using Maximal Consistent Sets
- Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing
- Measure-Based Inconsistency-Tolerant Maintenance of Database Integrity
- Measuring Inconsistency for Description Logics Based on Paraconsistent Semantics
- On the logic of theory change: Partial meet contraction and revision functions
- The Complexity of Enumeration and Reliability Problems
- The complexity of logic-based abduction
- Measuring Disagreement in Argumentation Graphs
- Forgetting-Based Inconsistency Measure
- Distance-Based Measures of Inconsistency
- A Reasoning Platform Based on the MI Shapley Inconsistency Value
- A Survey of the Data Complexity of Consistent Query Answering under Key Constraints
- Inconsistency Tolerance
- On sentences which are true of direct unions of algebras
- Belief revision and update: Complexity of model checking
This page was built for publication: On the complexity of inconsistency measurement
