An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF

Recommendations

Two tractable subclasses of minimal unsatisfiable formulas
On subclasses of minimal unsatisfiable formulas
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
The complexity of some subclasses of minimal unsatisfiable formulas.
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable

Cited in

(47)

On the size of minimal unsatisfiable formulas
An approach for extracting a small unsatisfiable core
Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
Using local search to find MSSes and MUSes
Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
Approximating minimal unsatisfiable subformulae by means of adaptive core search
On the structure of some classes of minimal unsatisfiable formulas
Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
Homomorphisms of conjunctive normal forms.
Minimal unsatisfiability and minimal strongly connected digraphs
Finding read-once resolution refutations in systems of 2CNF clauses
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
The complexity of homomorphisms and renamings for minimal unsatisfiable formulas
On subclasses of minimal unsatisfiable formulas
Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency.
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
Two tractable subclasses of minimal unsatisfiable formulas
On the complexity of inconsistency measurement
Local-search extraction of mUSes
2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000. La Sorbonne, Paris, France, July 23-31, 2000
Minimally unsatisfiable CNF formulas
On the computational complexity of read once resolution decidability in 2CNF formulas
On variables with few occurrences in conjunctive normal forms
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Complexity results on minimal unsatisfiable formulas
Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
The Lovász Local Lemma and Satisfiability
Disproof of the neighborhood conjecture with implications to SAT
Finding the hardest formulas for resolution
The complexity of some subclasses of minimal unsatisfiable formulas.
scientific article; zbMATH DE number 2201270 (Why is no real title available?)
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances
Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
Applications of minimal unsatisfiable formulas to polynomially reduction for formulas
Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable
Minimum Witnesses for Unsatisfiable 2CNFs
Towards logical operations research -- propositional case
The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant
Irreducible subcube partitions
Efficiently explaining CSPs with unsatisfiable subset optimization
Transforming quantified Boolean formulas using biclique covers
Proving the infeasibility of Horn formulas through read-once resolution
Affine vector space partitions
Generalization of the Chinese remainder theorem
Computational complexity of quantified Boolean formulas with fixed maximal deficiency
An upper bound for the circuit complexity of existentially quantified Boolean formulas

This page was built for publication: An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF

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