A weight-balanced branching rule for SAT
From MaRDI portal
Publication:597527
DOI10.1016/S0895-7177(03)90030-6zbMath1074.68024OpenAlexW1970516110MaRDI QIDQ597527
Publication date: 6 August 2004
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0895-7177(03)90030-6
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Resolution vs. cutting plane solution of inference problems: Some computational experience
- The equivalence of an LCP to a parametric linear program with a scalar parameter
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
- Solving propositional satisfiability problems
- Branching rules for satisfiability
- A Computational Study of Satisfiability Algorithms for Propositional Logic
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Depth-First Search and Linear Graph Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A weight-balanced branching rule for SAT
