Consistent subsets of inconsistent systems: structure and behaviour

DOI10.1080/0952813021000026795zbMath1025.68090MaRDI 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 system; MAX-SAT problem

Mathematics Subject Classification ID

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

Related Items

On Tackling Explanation Redundancy in Decision Trees, Another look at the phenomenon of phase transition, On the query complexity of selecting minimal sets for monotone predicates, Quantified maximum satisfiability, Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases, A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas, 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, SAT-based rigorous explanations for decision lists, Strong inconsistency, Iterative and core-guided maxsat solving: a survey and assessment, 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, Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing, A New Approach to Partial MUS Enumeration, Generalizing Core-Guided Max-SAT