On the relations between SAT and CSP enumerative algorithms

DOI10.1016/S0166-218X(99)00205-XzbMath0965.03015OpenAlexW1987740407MaRDI QIDQ1841881

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)

Uses Software

• CHIP

Cites Work

• Unnamed Item
• Unnamed Item
• A theoretical evaluation of selected backtracking algorithms.
• Networks of constraints: Fundamental properties and applications to picture processing
• A proof procedure for quantification theory
• Many hard examples for resolution
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving

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