Author:
Dimopoulos Yannis,Stergiou Kostas
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Bacchus, F.: Enhancing Davis Putnam with Extended Binary Clause Reasoning. In: Proceedings of AAAI 2002, pp. 613–619 (2002)
2. Bennaceur, H.: The satisfiability problem regarded as a constraint satisfaction problem. In: Proceedings of ECAI 1996, pp. 125–130 (1996)
3. Bennaceur, H.: A Comparison between SAT and CSP Techniques. Constraints 9, 123–138 (2004)
4. Lecture Notes in Computer Science;C. Bessière,2004
5. Debruyne, R., Bessière, C.: Domain Filtering Consistencies. Journal of Artificial Intelligence Research 14, 205–230 (2001)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. SAT Encoding and CSP Reduction for Interconnected Alldiff Constraints;MICAI 2009: Advances in Artificial Intelligence;2009
2. The Log-Support Encoding of CSP into SAT;Principles and Practice of Constraint Programming – CP 2007
3. GAC Via Unit Propagation;Principles and Practice of Constraint Programming – CP 2007
4. Mapping CSP into Many-Valued SAT;Theory and Applications of Satisfiability Testing – SAT 2007