scientific article; zbMATH DE number 1113999

MaRDI QIDQ4375765zbMATH OpenFDO

Authors Jinchang Wang

Publication date 8 February 1998

zbMATH Keywords

binary treessearching method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Recommendations

• Branching rules for satisfiability
• Branch-and-cut solution of inference problems in propositional logic
• Algorithms for testing the satisfiability of propositional formulae
• A weight-balanced branching rule for SAT
• Satisfiability, branch-width and Tseitin tautologies
• scientific article; zbMATH DE number 2119722
• Propositional SAT solving
• Satisfiability testing for Boolean formulas using -trees
• scientific article; zbMATH DE number 1737608

Cited in

(8)

• How good are branching rules in DPLL?
• A cost-reducing question-selection algorithm for propositional knowledge-based systems
• Branching rules for satisfiability
• Solving satisfiability problems using elliptic approximations -- effective branching rules
• The propositional formula checker HeerHugo
• A complete adaptive algorithm for propositional satisfiability
• Backtracking tactics in the backtrack method for SAT
• A weight-balanced branching rule for SAT

This page was built for publication:

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