scientific article; zbMATH DE number 1113999

zbMATH Open0891.68026MaRDI QIDQ4375765FDOQ4375765

Jinchang Wang

Publication date: 8 February 1998

Title of this publication is not available (Why is that?)

zbMATH Keywords

binary treessearching method

Mathematics Subject Classification ID

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

Cited In (8)

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

   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 👍 👎
• Title not available (Why is that?) 👍 👎
• Propositional SAT Solving 👍 👎
• Satisfiability testing for Boolean formulas using \(\Delta\)-trees 👍 👎
• Title not available (Why is that?) 👍 👎

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)