A comparison between SAT and CSP techniques

DOI10.1023/B:CONS.0000024048.03454.C0MaRDI QIDQ1768751zbMATH OpenOpenAlexFDO

Authors Hachemi Bennaceur

Publication date 15 March 2005

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:cons.0000024048.03454.c0

zbMATH Keywords

constraint satisfactionsatisfiability

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2080324
• Propagation in CSP and SAT
• On the relations between SAT and CSP enumerative algorithms
• Resolution versus search: Two strategies for SAT
• scientific article; zbMATH DE number 956866

Cited in

(8)

• scientific article; zbMATH DE number 1241716 (Why is no real title available?)
• scientific article; zbMATH DE number 4162321 (Why is no real title available?)
• Interleaved Alldifferent Constraints: CSP vs. SAT Approaches
• GAC Via Unit Propagation
• scientific article; zbMATH DE number 2080324 (Why is no real title available?)
• On the relations between SAT and CSP enumerative algorithms
• Propagation in CSP and SAT
• Argumentation frameworks as constraint satisfaction problems

This page was built for publication: A comparison between SAT and CSP techniques

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