Computing MUS-based inconsistency measures
type: Item
instance of: scholarly article
title: Computing MUS-based inconsistency measures
DOI: 10.1007/978-3-031-43619-2_50
author: Isabelle Kuhlmann
author: Andreas Niskanen
author: Matti Järvisalo
publication date: 2024-05-29T00:00:00Z
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 7855157
zbMATH Keywords: inconsistency measurement
zbMATH Keywords: minimal unsatisfiability
MaRDI profile type: Publication
cites work: Model enumeration in propositional circumscription via unsatisfiable core analysis
cites work: On Efficient Computation of Variable MUSes
cites work: Q4636600
cites work: Recursive online enumeration of all minimal unsatisfiable subsets
cites work: Approximate counting of minimal unsatisfiable subsets
cites work: Counting minimal unsatisfiable subsets
cites work: Encoding Argument Graphs in Logic
cites work: Theory and Applications of Models of Computation
cites work: Counterexample-guided abstraction refinement for symbolic model checking
cites work: Measures of inconsistency and defaults
cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
cites work: On the computational cost of disjunctive logic programming: Propositional case
cites work: Conflict-driven answer set solving: from theory to practice
cites work: Classifications for inconsistent theories
cites work: Measuring Consistency Gain and Information Loss in Stepwise Inconsistency Resolution
cites work: Q4581210
cites work: PySAT: a Python toolkit for prototyping with SAT oracles
cites work: Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription
cites work: A comparison of ASP-based and SAT-based algorithms for the contension inconsistency measure
cites work: Constraint satisfaction problems in clausal form. II: Minimal unsatisfiability and conflict structure
cites work: Redundancy in logic. I: CNF propositional formulae
cites work: Fast, flexible MUS enumeration
cites work: Algorithms for computing minimal unsatisfiable subsets of constraints
cites work: Answer Set Programming
cites work: MCS Extraction with Sublinear Oracle Queries
cites work: On computing the union of MUSes
cites work: Logic programs with stable model semantics as a constraint programming paradigm
cites work: Improving MCS enumeration via caching
cites work: A theory of diagnosis from first principles
cites work: On the complexity of inconsistency measurement
cites work: Q3455621
description: scientific article; zbMATH DE number 7855157