A Computational Study of Satisfiability Algorithms for Propositional Logic
From MaRDI portal
Recommendations
Cited in
(35)- New methods for computing inferences in first order logic
- Logic cuts for processing networks with fixed charges
- Inference flexibility in Horn clause knowledge bases and the simplex method
- Embedding complex decision procedures inside an interactive theorem prover.
- Branch-and-cut solution of inference problems in propositional logic
- Solving propositional satisfiability problems
- Optimal satisfiability for propositional calculi and constraint satisfaction problems.
- Backtracking tactics in the backtrack method for SAT
- A complete adaptive algorithm for propositional satisfiability
- A new algorithm for the propositional satisfiability problem
- Running time experiments on some algorithms for solving propositional satisfiability problems
- Branching rules for satisfiability
- New constructs for the description of combinatorial optimization problems in algebraic modeling languages
- Testing heuristics: We have it all wrong
- Structured proof procedures
- Resolution versus search: Two strategies for SAT
- Implementing the Davis-Putnam method
- Resolution versus search: Two strategies for SAT
- Implementing the Davis-Putnam method
- scientific article; zbMATH DE number 1696808 (Why is no real title available?)
- On satisfiability trees
- Solving Satisfiability with Less Searching
- tts: a SAT-solver for small, difficult instances
- The language of search
- Algorithms for testing the satisfiability of propositional formulae
- scientific article; zbMATH DE number 702472 (Why is no real title available?)
- An Incremental Branch-and-Bound Method for the Satisfiability Problem
- scientific article; zbMATH DE number 1931668 (Why is no real title available?)
- Survey propagation: An algorithm for satisfiability
- scientific article; zbMATH DE number 956860 (Why is no real title available?)
- scientific article; zbMATH DE number 956865 (Why is no real title available?)
- Characterizing Propagation Methods for Boolean Satisfiability
- Ten challenges \textit{redux}: recent progress in propositional reasoning and search
- A weight-balanced branching rule for SAT
- On market-inspired approaches to propositional satisfiability
This page was built for publication: A Computational Study of Satisfiability Algorithms for Propositional Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4319327)
