SAT as an Effective Solving Technology for Constraint Problems-Reference-Cited by-同舟云学术

SAT as an Effective Solving Technology for Constraint Problems

Published:2006 Issue: Volume: Page:540-549
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Cadoli Marco,Mancini Toni,Patrizi Fabio

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11875604_61.pdf

Reference16 articles.

1. Lecture Notes in Artificial Intelligence;M. Cadoli,2005

2. Cadoli, M., Mancini, T.: Automated reformulation of specifications by safe delay of constraints. Artif. Intell. (to appear, 2006)

3. Cadoli, M., Schaerf, A.: Compiling problem specifications into SAT. Artif. Intell. 162, 89–120 (2005)

4. Crawford, J.M., Ginsberg, M.L., Luks, E.M., Roy, A.: Symmetry-breaking predicates for search problems. In: Proc. of KR 1996, pp. 148–159. Morgan Kaufmann, San Francisco (1996)

5. Fourer, R., Gay, D.M., Kernigham, B.W.: AMPL: A Modeling Language for Mathematical Programming. Intl. Thomson Publ. (1993)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Effective Analysis of Industry-Relevant Cyber-Physical Systems via Statistical Model Checking;AIxIA 2021 – Advances in Artificial Intelligence;2022

2. A Comparative Study of AI Search Methods for Personalised Cancer Therapy Synthesis in COPASI;AIxIA 2021 – Advances in Artificial Intelligence;2022

3. Effectively solving NP-SPEC encodings by translation to ASP;Journal of Experimental & Theoretical Artificial Intelligence;2015-01-12

4. Solving constraint satisfaction problems with SAT modulo theories;Constraints;2012-05-26

5. A System for Solving Constraint Satisfaction Problems with SMT;Theory and Applications of Satisfiability Testing – SAT 2010;2010