Running time experiments on some algorithms for solving propositional satisfiability problems

DOI10.1007/BF02031719MaRDI QIDQ1897402zbMATH OpenOpenAlexFDO

Authors Joachim Mayer, Ilse Mitterreiter, F. J. Radermacher

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

evaluation of algorithmsNP-complete problemssatisfiability problems

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1113991
• scientific article; zbMATH DE number 30299
• Solving propositional satisfiability problems
• scientific article; zbMATH DE number 4039349
• A Computational Study of Satisfiability Algorithms for Propositional Logic

Cites work

• A Computational Study of Satisfiability Algorithms for Propositional Logic
• Boolean unification - the story so far
• Branch-and-cut solution of inference problems in propositional logic
• Embedding Boolean expressions into logic programming
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 4162324 (Why is no real title available?)
• scientific article; zbMATH DE number 3902554 (Why is no real title available?)
• scientific article; zbMATH DE number 4104410 (Why is no real title available?)
• scientific article; zbMATH DE number 3501560 (Why is no real title available?)
• Solving large combinatorial problems in logic programming
• Solving propositional satisfiability problems
• The equivalence of an LCP to a parametric linear program with a scalar parameter

Cited in

(1)

• Simplifying clausal satisfiability problems

This page was built for publication: Running time experiments on some algorithms for solving propositional satisfiability problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897402)