Equivalency reasoning to solve a class of hard SAT problems.

DOI10.1016/S0020-0190(00)00126-5zbMath1063.68591OpenAlexW1979093351MaRDI QIDQ1589482

Chu-Min Li

Publication date: 12 December 2000

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00126-5

zbMATH Keywords

Computational complexitySATAutomatic theorem provingDavis-Putnam procedure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Uses Software

• SATO

Cites Work

• A two-phase algorithm for solving a class of hard satisfiability problems
• SATO: An efficient propositional prover
• A machine program for theorem-proving
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: Equivalency reasoning to solve a class of hard SAT problems.