A Computational Study of Satisfiability Algorithms for Propositional Logic
From MaRDI portal
Publication:4319327
DOI10.1287/ijoc.6.4.423zbMath0811.03004OpenAlexW2048491048MaRDI QIDQ4319327
Gerald L. Thompson, Farid Harche, John N. Hooker
Publication date: 11 January 1995
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.6.4.423
Classical propositional logic (03B05) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)
Related Items
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., Branching rules for satisfiability, A weight-balanced branching rule for SAT, New constructs for the description of combinatorial optimization problems in algebraic modeling languages, Testing heuristics: We have it all wrong, Structured proof procedures, A complete adaptive algorithm for propositional satisfiability, Backtracking tactics in the backtrack method for SAT, Logic cuts for processing networks with fixed charges, Inference flexibility in Horn clause knowledge bases and the simplex method
