Solving propositional satisfiability problems
From MaRDI portal
Publication:1356218
DOI10.1007/BF01531077zbMath0878.68107OpenAlexW2085301456MaRDI QIDQ1356218
Jinchang Wang, Robert G. Jeroslow
Publication date: 4 June 1997
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01531077
Related Items
Computing definite logic programs by partial instantiation, Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks, Easy problems are sometimes hard, What we can learn from conflicts in propositional satisfiability, Evaluating CDCL Variable Scoring Schemes, A new algorithm for the propositional satisfiability problem, Running time experiments on some algorithms for solving propositional satisfiability problems, Embedding complex decision procedures inside an interactive theorem prover., Resolution vs. cutting plane solution of inference problems: Some computational experience, Branch-and-cut solution of inference problems in propositional logic, Branching rules for satisfiability, A weight-balanced branching rule for SAT, Many-valued logic and mixed integer programming, Hard random 3-SAT problems and the Davis-Putnam procedure, Spatial state-action features for general games, Learning from conflicts in propositional satisfiability, Approximating minimal unsatisfiable subformulae by means of adaptive core search, On the limit of branching rules for hard random unsatisfiable 3-SAT, Exploiting data dependencies in many-valued logics, The \(Multi\)-SAT algorithm, An efficient solver for weighted Max-SAT, New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability, On the complexity of choosing the branching literal in DPLL, DPLL: The Core of Modern Satisfiability Solvers, Computing minimal models by partial instantiation, Solving SAT problem by heuristic polarity decision-making algorithm, Popularity-similarity random SAT formulas, Exact Algorithms for MAX-SAT, A cost-reducing question-selection algorithm for propositional knowledge-based systems, New tractable classes for default reasoning from conditional knowledge bases, Clause vivification by unit propagation in CDCL SAT solvers, A simple effective heuristic for embedded mixed-integer quadratic programming, SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT, A complete adaptive algorithm for propositional satisfiability, A dual algorithm for the satisfiability problem, Learning Rate Based Branching Heuristic for SAT Solvers, Learning action models from plan examples using weighted MAX-SAT, Linear programs for constraint satisfaction problems, How good are branching rules in DPLL?, Solving satisfiability problems using elliptic approximations -- effective branching rules, Tractable reasoning via approximation, New methods for computing inferences in first order logic, ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver, On Exponential Lower Bounds for Partially Ordered Resolution, Backtracking tactics in the backtrack method for SAT, 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
Cites Work
- Unnamed Item
- Some results and experiments in programming techniques for propositional logic
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
- Modelling with integer variables
- Solving Satisfiability with Less Searching
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- A Human Oriented Logic for Automatic Theorem-Proving
- A Computing Procedure for Quantification Theory
- The complexity of theorem-proving procedures
