Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
type: Item
instance of: scholarly article
title: Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
zbMATH Open document ID: 1173.90510
author: Christian Desrosiers
author: P. Galinier
author: Alain Hertz
author: Sandrine Paroz
published in: Journal of Combinatorial Optimization
publication date: 2009-11-16T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5633375
zbMATH Keywords: satisfiability
zbMATH Keywords: heuristics
zbMATH Keywords: minimal unsatisfiable subformulas (MUS)
describes a project that uses: Tabu search
describes a project that uses: SATO
describes a project that uses: MUP
describes a project that uses: AMUSE
describes a project that uses: Chaff
describes a project that uses: BerkMin
MaRDI profile type: Publication
full work available at URL: s10878-008-9142-4
OpenAlex ID: W2081776044
cites work: Q4263701
cites work: Q4247437
cites work: A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
cites work: Approximating minimal unsatisfiable subformulae by means of adaptive core search
cites work: Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
cites work: A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
cites work: A machine program for theorem-proving
cites work: Efficient algorithms for finding critical subgraphs
cites work: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
cites work: Solution techniques for the large set covering problem
cites work: Identifying Minimally Infeasible Subsystems of Inequalities
cites work: Q4354785
cites work: BerkMin: A fast and robust SAT-solver
cites work: Algorithms for the maximum satisfiability problem
cites work: Relational concept learning by cooperative evolution
cites work: Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency.
cites work: Theory and Applications of Satisfiability Testing
cites work: Boosting complete techniques thanks to local search methods
cites work: Guided local search for solving SAT and weighted MAX-SAT problems
DOI: 10.1007/S10878-008-9142-4
Recommended article: Q4473049
Recommended article: Theory and Applications of Satisfiability Testing
Recommended article: Q4583686
Recommended article: A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
Recommended article: On exact selection of minimally unsatisfiable subformulae
Recommended article: Approximating minimal unsatisfiable subformulae by means of adaptive core search
Recommended article: Algorithms for computing minimal unsatisfiable subsets of constraints
Recommended article: An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
description: scientific article; zbMATH DE number 5633375