On the relations between SAT and CSP enumerative algorithms

DOI10.1016/S0166-218X(99)00205-XMaRDI QIDQ1841881zbMATH OpenOpenAlexFDO

Authors Richard Génisson, Philippe Jégou

Publication date 26 July 2001

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00205-x

zbMATH Keywords

constraint satisfactionpropositional calculusDavis-Putnam procedureForward Checking

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35)

Recommendations

• scientific article; zbMATH DE number 2080324
• A comparison between SAT and CSP techniques
• scientific article; zbMATH DE number 956866
• The logic of constraint satisfaction
• scientific article; zbMATH DE number 2080297

Cites work

• scientific article; zbMATH DE number 4162321 (Why is no real title available?)
• scientific article; zbMATH DE number 956858 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• A proof procedure for quantification theory
• A theoretical evaluation of selected backtracking algorithms.
• Many hard examples for resolution
• Networks of constraints: Fundamental properties and applications to picture processing

Cited in

(5)

• Equivalent literal propagation in the DLL procedure
• An enumerative algorithm for \#2SAT
• scientific article; zbMATH DE number 2080324 (Why is no real title available?)
• The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems
• A comparison between SAT and CSP techniques

Describes a project that uses

Uses Software

• CHIP

This page was built for publication: On the relations between SAT and CSP enumerative algorithms

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