Consistent subsets of inconsistent systems: structure and behaviour

DOI10.1080/0952813021000026795zbMath1025.68090OpenAlexW2058449564MaRDI QIDQ4407240

Elazar Birnbaum, Eliezer L. Lozinskii

Publication date: 26 June 2003

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0952813021000026795

zbMATH Keywords

knowledge systemMAX-SAT problem

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (17)

Quantified maximum satisfiability ⋮ On Tackling Explanation Redundancy in Decision Trees ⋮ Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing ⋮ A New Approach to Partial MUS Enumeration ⋮ A max-term counting based knowledge inconsistency checking strategy and inconsistency measure calculation of fuzzy knowledge based systems ⋮ Minimal sets on propositional formulae. Problems and reductions ⋮ Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases ⋮ Another look at the phenomenon of phase transition ⋮ Algorithms for computing minimal unsatisfiable subsets of constraints ⋮ MCS Extraction with Sublinear Oracle Queries ⋮ BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies ⋮ Generalizing Core-Guided Max-SAT ⋮ Strong inconsistency ⋮ A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas ⋮ Iterative and core-guided maxsat solving: a survey and assessment ⋮ On the query complexity of selecting minimal sets for monotone predicates ⋮ SAT-based rigorous explanations for decision lists

This page was built for publication: Consistent subsets of inconsistent systems: structure and behaviour