On the power of clause-learning SAT solvers as resolution engines (Q543613): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: RSat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Siege / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Zchaff2004 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BerkMin / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Eureka / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2010.10.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2121015471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Framework for Conflict Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: BerkMin: A fast and robust SAT-solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal speedup of Las Vegas algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning / rank
 
Normal rank

Latest revision as of 05:04, 4 July 2024

scientific article
Language Label Description Also known as
English
On the power of clause-learning SAT solvers as resolution engines
scientific article

    Statements

    On the power of clause-learning SAT solvers as resolution engines (English)
    0 references
    0 references
    0 references
    17 June 2011
    0 references
    0 references
    Boolean satisfiability
    0 references
    clause-learning SAT solvers
    0 references
    DPLL
    0 references
    proof complexity
    0 references
    resolution proof
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references