Equivalency reasoning to solve a class of hard SAT problems.

DOI10.1016/S0020-0190(00)00126-5MaRDI QIDQ1589482zbMATH OpenOpenAlexFDO

Authors 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

Automatic theorem provingComputational complexityDavis-Putnam procedureSAT

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• A machine program for theorem-proving
• A two-phase algorithm for solving a class of hard satisfiability problems
• SATO: An efficient propositional prover
• Ten challenges \textit{redux}: recent progress in propositional reasoning and search

Cited in

(1)

• SAT, gadgets, Max2XOR, and quantum annealers

Describes a project that uses

Uses Software

• SATO

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

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