Solving propositional satisfiability problems
From MaRDI portal
Publication:1356218
DOI10.1007/BF01531077zbMath0878.68107MaRDI QIDQ1356218
Jinchang Wang, Robert G. Jeroslow
Publication date: 4 June 1997
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Related Items
Exploiting data dependencies in many-valued logics, A weight-balanced branching rule for SAT, Computing minimal models by partial instantiation, A dual algorithm for the satisfiability problem, An efficient solver for weighted Max-SAT, New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability, Learning action models from plan examples using weighted MAX-SAT, Resolution vs. cutting plane solution of inference problems: Some computational experience, 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, On the complexity of choosing the branching literal in DPLL, 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, SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
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
