A Computational Study of Satisfiability Algorithms for Propositional Logic

DOI10.1287/IJOC.6.4.423MaRDI QIDQ4319327zbMATH OpenOpenAlexFDO

Authors Farid Harche, G. L. Thompson, 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

zbMATH Keywords

algorithmspropositional logictree searchsatisfiability problem

Mathematics Subject Classification ID

Classical propositional logic (03B05) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)

Recommendations

• Solving propositional satisfiability problems
• Algorithms for testing the satisfiability of propositional formulae
• scientific article; zbMATH DE number 956865
• Implementing the Davis-Putnam method
• Resolution versus search: Two strategies for SAT

Cited in

(30)

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

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)