Running time experiments on some algorithms for solving propositional satisfiability problems

DOI10.1007/BF02031719zbMath0844.68059OpenAlexW1995746810MaRDI QIDQ1897402

F. J. Radermacher, Ilse Mitterreiter, Joachim Mayer

Publication date: 27 August 1995

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02031719

zbMATH Keywords

NP-complete problemssatisfiability problemsevaluation of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of programming languages (68N15) Mathematical programming (90C99)

Related Items

Simplifying clausal satisfiability problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding Boolean expressions into logic programming
• The equivalence of an LCP to a parametric linear program with a scalar parameter
• Branch-and-cut solution of inference problems in propositional logic
• Solving propositional satisfiability problems
• Boolean unification - the story so far
• Graph-Based Algorithms for Boolean Function Manipulation
• A Computational Study of Satisfiability Algorithms for Propositional Logic
• Solving large combinatorial problems in logic programming