The \(Multi\)-SAT algorithm (Q1961449): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Walksat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Decision Diagrams / 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: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtrack programming techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results and experiments in programming techniques for propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel SAT-solver -- efficient workload balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Average Time Analysis of Backtracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average Time Analysis of Clause Order Backtracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel approach for theorem proving in propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of regular resolution and the Davis-Putnam procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A satisfiability tester for non-clausal propositional calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof Method for Quantification Theory: Its Justification and Realization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average time analyses of simplified Davis-Putnam procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4859227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution vs. cutting plane solution of inference problems: Some computational experience / 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: Refutational theorem proving using term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An average case analysis of a resolution principle algorithm in mechanical theorem proving. / rank
 
Normal rank
Property / cites work
 
Property / cites work: CNF-Satisfiability Test by Counting and Polynomial Average Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving propositional satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with an interior point algorithm on the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pure Literal Rule and Polynomial Average Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375758 / 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: Parallel consistent labeling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast search algorithms for the n-queens problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3732977 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(99)00035-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055762574 / rank
 
Normal rank

Latest revision as of 09:06, 30 July 2024

scientific article
Language Label Description Also known as
English
The \(Multi\)-SAT algorithm
scientific article

    Statements

    The \(Multi\)-SAT algorithm (English)
    0 references
    0 references
    9 March 2000
    0 references
    Multi-SAT algorithm
    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
    0 references
    0 references

    Identifiers