The Multi-SAT algorithm
From MaRDI portal
The \(Multi\)-SAT algorithm
Recommendations
Cites work
- A Computing Procedure for Quantification Theory
- A fast parallel SAT-solver -- efficient workload balancing
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A machine program for theorem-proving
- A Machine-Oriented Logic Based on the Resolution Principle
- A parallel approach for theorem proving in propositional logic
- A Proof Method for Quantification Theory: Its Justification and Realization
- A satisfiability tester for non-clausal propositional calculus
- An average case analysis of a resolution principle algorithm in mechanical theorem proving.
- An Average Time Analysis of Backtracking
- Average time analyses of simplified Davis-Putnam procedures
- Average Time Analysis of Clause Order Backtracking
- Backtrack programming techniques
- Binary Decision Diagrams
- Branch-and-cut solution of inference problems in propositional logic
- CNF-Satisfiability Test by Counting and Polynomial Average Time
- Computational experience with an interior point algorithm on the satisfiability problem
- Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms
- Fast search algorithms for the n-queens problem
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 4164188 (Why is no real title available?)
- scientific article; zbMATH DE number 3965458 (Why is no real title available?)
- scientific article; zbMATH DE number 4053069 (Why is no real title available?)
- scientific article; zbMATH DE number 3657150 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3568056 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1113992 (Why is no real title available?)
- scientific article; zbMATH DE number 1113993 (Why is no real title available?)
- scientific article; zbMATH DE number 1555941 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 828719 (Why is no real title available?)
- scientific article; zbMATH DE number 3313427 (Why is no real title available?)
- scientific article; zbMATH DE number 3353170 (Why is no real title available?)
- Many hard examples for resolution
- On the complexity of regular resolution and the Davis-Putnam procedure
- On the Complexity of Timetable and Multicommodity Flow Problems
- Parallel consistent labeling algorithms
- Refutational theorem proving using term-rewriting systems
- Resolution vs. cutting plane solution of inference problems: Some computational experience
- Solving propositional satisfiability problems
- Some results and experiments in programming techniques for propositional logic
- The complexity of satisfiability problems
- The Pure Literal Rule and Polynomial Average Time
Cited in
(7)- Experimental study on strategy of combining SAT algorithms
- The \textsc{MergeSat} solver
- An enumerative algorithm for \#2SAT
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
- scientific article; zbMATH DE number 1182571 (Why is no real title available?)
- STACS 2004
- A competitive and cooperative approach to propositional satisfiability
This page was built for publication: The \(Multi\)-SAT algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961449)
