Computing MUS-based inconsistency measures

DOI10.1007/978-3-031-43619-2_50MaRDI QIDQ6545579zbMATH OpenFDO

Authors Isabelle Kuhlmann, Andreas Niskanen, Matti Järvisalo

Publication date 29 May 2024

zbMATH Keywords

minimal unsatisfiabilityinconsistency measurement

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Inconsistency measurement based on variables in minimal unsatisfiable subsets
• Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
• scientific article; zbMATH DE number 6902558
• On the complexity of inconsistency measurement
• Measuring and computing database inconsistency via repairs

Cites work

• A comparison of ASP-based and SAT-based algorithms for the contension inconsistency measure
• A theory of diagnosis from first principles
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Answer set programming
• Approximate counting of minimal unsatisfiable subsets
• Classifications for inconsistent theories
• Conflict-driven answer set solving: from theory to practice
• Counterexample guided abstraction refinement algorithm for propositional circumscription
• Counterexample-guided abstraction refinement for symbolic model checking
• Counting minimal unsatisfiable subsets
• Encoding argument graphs in logic
• Fast, flexible MUS enumeration
• Improving MCS enumeration via caching
• Inconsistency measurement based on variables in minimal unsatisfiable subsets
• Logic programs with stable model semantics as a constraint programming paradigm
• MCS Extraction with Sublinear Oracle Queries
• Measures of inconsistency and defaults
• Measuring Consistency Gain and Information Loss in Stepwise Inconsistency Resolution
• Measuring inconsistency in information
• Model enumeration in propositional circumscription via unsatisfiable core analysis
• On computing the union of MUSes
• On efficient computation of variable MUSes
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the complexity of inconsistency measurement
• On the computational cost of disjunctive logic programming: Propositional case
• PySAT: a Python toolkit for prototyping with SAT oracles
• Recursive online enumeration of all minimal unsatisfiable subsets
• Redundancy in logic. I: CNF propositional formulae
• Theory and Applications of Models of Computation
• Tunable online MUS/MSS enumeration

Cited in

(3)

• Inconsistency measurement in \(\mathrm{LTL_f}\) based on minimal inconsistent sets and minimal correction sets
• A comparison of ASP-based and SAT-based algorithms for the contension inconsistency measure
• Explanations of unsatisfiability beyond minimal subsets

This page was built for publication: Computing MUS-based inconsistency measures

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