Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming duality: an introduction to oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time inference of all valid implications for Horn and related formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Index for Satisfiability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of \(q\)-Horn formulae in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized Horn formulas and \(k\)-resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subclasses of minimal unsatisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of read-once resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of tractable satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tautologies and positive solvability of linear homogeneous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A perspective on certain polynomial-time solvable classes of satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially solvable satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autarky pruning in propositional model elimination reduces failure redundancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: New worst-case upper bounds for SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signsolvability revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods for 3-SAT decision and worst-case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of extended resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigations on autark assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sign-consistency and solvability of constrained linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3721816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving satisfiability in less than \(2^ n\) steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On theories with a combinatorial definition of 'equivalence' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel cooperative propositional theorem proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets resolved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for reducing the number of variables in MAX SAT problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short note on some tractable cases of the satisfiability problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving satisfiability problems using elliptic approximations -- effective branching rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two tractable subclasses of minimal unsatisfiable formulas / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(02)00406-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042705674 / rank
 
Normal rank

Latest revision as of 11:11, 30 July 2024

scientific article
Language Label Description Also known as
English
Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
scientific article

    Statements

    Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (English)
    0 references
    0 references
    15 September 2003
    0 references
    Autarky
    0 references
    Propositional satisfiability problem
    0 references
    Conjunctive normal form
    0 references
    Lean clause-set
    0 references
    Resolution
    0 references
    Linear autarky
    0 references
    Linear programming
    0 references
    Qualitative matrix analysis
    0 references
    Deficiency
    0 references
    Matching theory
    0 references
    Polynomial time
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers