A new algorithm for the propositional satisfiability problem (Q1894360): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Recognizing disguised NR(1) instances of the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Horn sets in propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut solution of inference problems in propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed hypergraphs and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially solvable satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for testing the satisfiability of propositional formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Satisfiability Algorithms for Propositional Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving propositional satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unique Horn-satisfiability problem and quadratic Boolean equations. / 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: Hard examples for resolution / rank
 
Normal rank

Latest revision as of 14:50, 23 May 2024

scientific article
Language Label Description Also known as
English
A new algorithm for the propositional satisfiability problem
scientific article

    Statements

    A new algorithm for the propositional satisfiability problem (English)
    0 references
    0 references
    0 references
    6 September 1995
    0 references
    enumeration algorithm
    0 references
    satisfiability
    0 references

    Identifiers