Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
type: Item
instance of: scholarly article
title: Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
zbMATH Open document ID: 1029.68079
DOI: 10.1016/S0166-218X(02)00406-7
author: Oliver Kullmann
published in: Discrete Applied Mathematics
publication date: 2003-09-15T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1981509
zbMATH Keywords: Autarky
zbMATH Keywords: Propositional satisfiability problem
zbMATH Keywords: Conjunctive normal form
zbMATH Keywords: Lean clause-set
zbMATH Keywords: Resolution
zbMATH Keywords: Linear autarky
zbMATH Keywords: Linear programming
zbMATH Keywords: Qualitative matrix analysis
zbMATH Keywords: Deficiency
zbMATH Keywords: Matching theory
zbMATH Keywords: Polynomial time
describes a project that uses: Mosek
MaRDI profile type: Publication
cites work: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
cites work: Q4149459
cites work: Q4496016
cites work: Linear programming duality: an introduction to oriented matroids
cites work: Polynomial-time inference of all valid implications for Horn and related formulae
cites work: A Complexity Index for Satisfiability Problems
cites work: Recognition of \(q\)-Horn formulae in linear time
cites work: Combinatorial matrix theory
cites work: Q4858123
cites work: On generalized Horn formulas and \(k\)-resolution
cites work: Q4263797
cites work: On subclasses of minimal unsatisfiable formulas
cites work: The complexity of read-once resolution
cites work: A hierarchy of tractable satisfiability problems
cites work: Tautologies and positive solvability of linear homogeneous systems
cites work: An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
cites work: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
cites work: A perspective on certain polynomial-time solvable classes of satisfiability
cites work: Polynomially solvable satisfiability problems
cites work: Autarky pruning in propositional model elimination reduces failure redundancy
cites work: New worst-case upper bounds for SAT
cites work: Encoding domain and control knowledge for propositional planning
cites work: Signsolvability revisited
cites work: New methods for 3-SAT decision and worst-case analysis
cites work: On a generalization of extended resolution
cites work: Investigations on autark assignments
cites work: On the use of autarkies for satisfiability decision
cites work: Sign-consistency and solvability of constrained linear systems
cites work: Matching theory
cites work: Q3721816
cites work: Solving satisfiability in less than \(2^ n\) steps
cites work: On theories with a combinatorial definition of 'equivalence'
cites work: Parallel cooperative propositional theorem proving
cites work: Q3135082
cites work: The complexity of facets resolved
cites work: Q3818127
cites work: A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
cites work: Q4488090
cites work: Q4539605
cites work: Q5593816
cites work: A short note on some tractable cases of the satisfiability problem.
cites work: Solving satisfiability problems using elliptic approximations -- effective branching rules
cites work: Two tractable subclasses of minimal unsatisfiable formulas
full work available at URL: s0166-218x(02)00406-7
OpenAlex ID: W2042705674
description: scientific article; zbMATH DE number 1981509