Backtracking tactics in the backtrack method for SAT

DOI10.1016/S0895-7177(98)00087-9zbMath0995.68512OpenAlexW2027065553MaRDI QIDQ1596804

Jinchang Wang

Publication date: 5 May 2002

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(98)00087-9

zbMATH Keywords

SAT problembacktrack

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Algorithms for testing the satisfiability of propositional formulae
• Backtrack programming techniques
• A Computational Study of Satisfiability Algorithms for Propositional Logic
• A Computing Procedure for Quantification Theory
• Depth-First Search and Linear Graph Algorithms