On the complexity of inconsistency measurement
From MaRDI portal
Publication:2321337
DOI10.1016/J.ARTINT.2019.07.001zbMATH Open1478.68359OpenAlexW2953903422MaRDI QIDQ2321337FDOQ2321337
Johannes Wallner, Matthias Thimm
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
Recommendations
- On the evaluation of inconsistency measures
- On the expressivity of inconsistency measures
- On measuring inconsistency using maximal consistent sets
- Measuring inconsistency
- Inconsistency measurement based on variables in minimal unsatisfiable subsets
- Inconsistency measurement
- On an MCS-based inconsistency measure
Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Logic in artificial intelligence (68T27)
Cites Work
- Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing
- Title not available (Why is that?)
- The complexity of facets resolved
- The logic of paradox
- Analysing inconsistent first-order knowledgebases
- On the expressivity of inconsistency measures
- The QBF Gallery: behind the scenes
- Measuring Consistency Gain and Information Loss in Stepwise Inconsistency Resolution
- On Measuring Inconsistency Using Maximal Consistent Sets
- Title not available (Why is that?)
- Measuring Inconsistency for Description Logics Based on Paraconsistent Semantics
- Inconsistency measures for probabilistic logics
- On the logic of theory change: Partial meet contraction and revision functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
- Title not available (Why is that?)
- Distance-Based Measures of Inconsistency
- Inconsistency Tolerance
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Measures of inconsistency and defaults
- Redundancy in logic. I: CNF propositional formulae
- The Complexity of Enumeration and Reliability Problems
- Title not available (Why is that?)
- Minimal-change integrity maintenance using tuple deletions
- Iterative and core-guided maxsat solving: a survey and assessment
- Fast, flexible MUS enumeration
- On Computing Preferred MUSes and MCSes
- SAT-based MaxSAT algorithms
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
- Complexity of generalized satisfiability counting problems
- Subtractive reductions and complete problems for counting complexity classes
- The complexity of combinatorial problems with succinct input representation
- Nonmonotonic reasoning: From complexity to algorithms
- On the complexity of the maximum satisfiability problem for Horn formulas
- On sentences which are true of direct unions of algebras
- Scalar aggregation in inconsistent databases.
- An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- A dichotomy in the complexity of counting database repairs
- Belief revision and update: Complexity of model checking
- Classifications for inconsistent theories
- A Reasoning Platform Based on the MI Shapley Inconsistency Value
- Reasoning under inconsistency: a forgetting-based approach
- The complexity of logic-based abduction
- A Survey of the Data Complexity of Consistent Query Answering under Key Constraints
- Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
- Approaches to measuring inconsistency for stratified knowledge bases
- On an MCS-based inconsistency measure
- Counting complexity of propositional abduction
- Efficient Reasoning for Inconsistent Horn Formulae
- Hierarchies of polynomially solvable satisfiability problems
- Understanding the complexity of axiom pinpointing in lightweight description logics
- Quantifying conflicts in propositional logic through prime implicates
- Measuring Inconsistency in Answer Set Programs
- On repairing and querying inconsistent probabilistic spatio-temporal databases
- Measuring Disagreement in Argumentation Graphs
- Localising iceberg inconsistencies
- Measuring inconsistency with many-valued logics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Forgetting-Based Inconsistency Measure
- Measure-Based Inconsistency-Tolerant Maintenance of Database Integrity
Cited In (18)
- On the expressivity of inconsistency measures
- On the inconsistency of IQML
- Inconsistency Tolerance
- Stream-based inconsistency measurement
- A comparison of ASP-based and SAT-based algorithms for the contension inconsistency measure
- Measuring inconsistency
- Measuring inconsistency in some branching time logics
- Measuring Consistency Gain and Information Loss in Stepwise Inconsistency Resolution
- On measuring inconsistency in definite and indefinite databases with denial constraints
- On quasi-inconsistency and its complexity
- An Algorithm for Computing Inconsistency Measurement by Paraconsistent Semantics
- OuterCount: a first-level solution-counter for quantified Boolean formulas
- General information spaces: measuring inconsistency, rationality postulates, and complexity
- A model of three-way decisions for knowledge harnessing
- Handling and measuring inconsistency in non-monotonic logics
- On an MCS-based inconsistency measure
- Belief reconfiguration
- Computing MUS-based inconsistency measures
Uses Software
This page was built for publication: On the complexity of inconsistency measurement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321337)
