A comparison between SAT and CSP techniques

DOI10.1023/B:CONS.0000024048.03454.c0zbMath1074.68059OpenAlexW1982890979MaRDI QIDQ1768751

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

satisfiabilityconstraint satisfaction

Mathematics Subject Classification ID

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

Related Items (2)

GAC Via Unit Propagation ⋮ Argumentation frameworks as constraint satisfaction problems

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