The \(Multi\)-SAT algorithm
From MaRDI portal
Publication:1961449
DOI10.1016/S0166-218X(99)00035-9zbMath0937.68149OpenAlexW2055762574MaRDI QIDQ1961449
Publication date: 9 March 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00035-9
Related Items
A competitive and cooperative approach to propositional satisfiability, On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational experience with an interior point algorithm on the satisfiability problem
- Average time analyses of simplified Davis-Putnam procedures
- Refutational theorem proving using term-rewriting systems
- Resolution vs. cutting plane solution of inference problems: Some computational experience
- Some results and experiments in programming techniques for propositional logic
- A parallel approach for theorem proving in propositional logic
- Parallel consistent labeling algorithms
- A satisfiability tester for non-clausal propositional calculus
- On the complexity of regular resolution and the Davis-Putnam procedure
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- An average case analysis of a resolution principle algorithm in mechanical theorem proving.
- Branch-and-cut solution of inference problems in propositional logic
- Solving propositional satisfiability problems
- A fast parallel SAT-solver -- efficient workload balancing
- A Proof Method for Quantification Theory: Its Justification and Realization
- Many hard examples for resolution
- The Pure Literal Rule and Polynomial Average Time
- Graph-Based Algorithms for Boolean Function Manipulation
- CNF-Satisfiability Test by Counting and Polynomial Average Time
- An Average Time Analysis of Backtracking
- Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms
- Fast search algorithms for the n-queens problem
- Average Time Analysis of Clause Order Backtracking
- Backtrack programming techniques
- On the Complexity of Timetable and Multicommodity Flow Problems
- Binary Decision Diagrams
- The complexity of satisfiability problems
- A Machine-Oriented Logic Based on the Resolution Principle
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
