Solving propositional satisfiability problems
From MaRDI portal
Recommendations
Cites work
- A Computing Procedure for Quantification Theory
- A Human Oriented Logic for Automatic Theorem-Proving
- scientific article; zbMATH DE number 3568056 (Why is no real title available?)
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Modelling with integer variables
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
- Solving Satisfiability with Less Searching
- Some results and experiments in programming techniques for propositional logic
- The complexity of theorem-proving procedures
Cited in
(75)- Learning action models from plan examples using weighted MAX-SAT
- Nonserial dynamic programming formulations of satisfiability
- Resolution vs. cutting plane solution of inference problems: Some computational experience
- A satisfiability tester for non-clausal propositional calculus
- An efficient algorithm for the 3-satisfiability problem
- Linear programs for constraint satisfaction problems
- How good are branching rules in DPLL?
- New methods for computing inferences in first order logic
- An exact algorithm for the constraint satisfaction problem: Application to logical inference
- Logic cuts for processing networks with fixed charges
- Inference flexibility in Horn clause knowledge bases and the simplex method
- Computing definite logic programs by partial instantiation
- Easy problems are sometimes hard
- Embedding complex decision procedures inside an interactive theorem prover.
- Branch-and-cut solution of inference problems in propositional logic
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- On the limit of branching rules for hard random unsatisfiable 3-SAT
- Backtracking tactics in the backtrack method for SAT
- A cost-reducing question-selection algorithm for propositional knowledge-based systems
- A complete adaptive algorithm for propositional satisfiability
- Solving satisfiability problems using elliptic approximations -- effective branching rules
- Tractable reasoning via approximation
- A new algorithm for the propositional satisfiability problem
- Running time experiments on some algorithms for solving propositional satisfiability problems
- Branching rules for satisfiability
- Many-valued logic and mixed integer programming
- The Multi-SAT algorithm
- Implementing the Davis-Putnam method
- Separating signs in the propositional satisfiability problem
- Number representation of satisfiability
- On the complexity of choosing the branching literal in DPLL
- Popularity-similarity random SAT formulas
- Clause vivification by unit propagation in CDCL SAT solvers
- Cutting to the chase.
- Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks
- Solving SAT problem by heuristic polarity decision-making algorithm
- New tractable classes for default reasoning from conditional knowledge bases
- What we can learn from conflicts in propositional satisfiability
- Hard random 3-SAT problems and the Davis-Putnam procedure
- Solving satisfiability using decomposition and the most constrained subproblem
- The propositional formula checker HeerHugo
- Implementing the Davis-Putnam method
- Learning rate based branching heuristic for SAT solvers
- On satisfiability trees
- DPLL: the core of modern satisfiability solvers
- Solving Satisfiability with Less Searching
- SAT 2005. Satisfiability Research in the Year 2005.
- Evaluating CDCL variable scoring schemes
- A Pearl on SAT Solving in Prolog
- SATRIX -- algorithms for Boolean satisfiability
- SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
- scientific article; zbMATH DE number 5575002 (Why is no real title available?)
- Algorithms for testing the satisfiability of propositional formulae
- A simple test improves checking satisfiability
- Learning from conflicts in propositional satisfiability
- A Computational Study of Satisfiability Algorithms for Propositional Logic
- scientific article; zbMATH DE number 1737608 (Why is no real title available?)
- scientific article; zbMATH DE number 799949 (Why is no real title available?)
- Exploiting data dependencies in many-valued logics
- Exact algorithms for MAX-SAT
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- On exponential lower bounds for partially ordered resolution
- Propositional calculus problems in CHIP
- Simplifying clausal satisfiability problems
- A simple effective heuristic for embedded mixed-integer quadratic programming
- Logic programming with satisfiability
- Introduction to propositional satisfiability
- scientific article; zbMATH DE number 956865 (Why is no real title available?)
- A weight-balanced branching rule for SAT
- Spatial state-action features for general games
- Computing minimal models by partial instantiation
- A dual algorithm for the satisfiability problem
- Computational experience with an interior point algorithm on the satisfiability problem
- An efficient solver for weighted Max-SAT
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
This page was built for publication: Solving propositional satisfiability problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356218)
