Evaluating ASP and commercial solvers on the CSPLib

Frontiers in Artificial Intelligence and Applications

Volumn 141, Issue , 2006, Pages 68-72

  Cadoli, Marco ^a   Mancini, Toni ^a   Micaletto, Davide ^a   Patrizi, Fabio ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL PROBLEM; COMMERCIAL SOLVERS; EXPERIMENTAL METHODOLOGY; GLOBAL CONSTRAINTS; MODELING ASPECTS; RELATIVE PERFORMANCE; SMODELS; STATE OF THE ART; SYMMETRY BREAKINGS; THIRD PARTIES;

LOGIC PROGRAMMING;

EID: 84886055039     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Article

References (17)

1. E. Castillo, A. J. Conejo, P. Pedregal, R. Garca, and N. Alguacil, Building and Solving Mathematical Programming Models in Engineering and Science, John Wiley & Sons, 2001.
2. P. Codognet and D. Diaz, 'Compiling constraints in clp(FD)', J. of Logic Programming, 27, 185-226, (1996).
3. J. M. Crawford, M. L. Ginsberg, E. M. Luks, and A. Roy, 'Symmetrybreaking predicates for search problems', in Proc. of KR'96, pp. 148-159, Cambridge, MA, USA, (1996). Morgan Kaufmann, Los Altos.
4. A. Dovier, A. Formisano, and E. Pontelli, 'A comparison of CLP(FD) and ASP solutions to NP-complete problems', in Proc. of ICLP 2005, volume 3668 of LNCS, pp. 67-82, Sitges, Spain, (2005). Springer.
5. A. J. Fernández and P. M. Hill, 'A comparative study of eight constraint programming languages over the Boolean and Finite Domains', Constraints, 5(3), 275-301, (2000).
6. P. Flener, A. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, and T. Walsh, 'Breaking row and column symmetries in matrix models', in Proc. of CP 2002, volume 2470 of LNCS, p. 462 ff., Ithaca, NY, USA, (2002). Springer.
7. R. Fourer, D. M. Gay, and B. W. Kernigham, AMPL: A Modeling Language for Mathematical Programming, Intl. Thomson Publ., 1993.
8. N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri, and F. Scarcello, 'The DLV System for Knowledge Representation and Reasoning', ACM Trans. on Comp. Logic. To appear.
9. F. Lin and Z. Yuting, 'ASSAT: Computing answer sets of a logic program by SAT solvers', Artif. Intell., 157(1-2), 115-137, (2004).
10. T. Mancini and M. Cadoli, 'Detecting and breaking symmetries by reasoning on problem specifications', in Proc. of SARA 2005, volume 3607 of LNAI, pp. 165-181, Airth Castle, Scotland, UK, (2005). Springer.
11. I. Niemelä, 'Logic programs with stable model semantics as a constraint programming paradigm', Annals of Math. and Artif. Intell., 25(3,4), 241-273, (1999).
12. N. Pelov, E. De Mot, and M. Denecker, 'Logic Programming approaches for representing and solving Constraint Satisfaction Problems: A comparison', in Proc. of LPAR 2000, volume 1955 of LNCS, pp. 225-239, Reunion Island, FR, (2000). Springer.
13. A. Ramani, F. A. Aloul, I. L. Markov, and K. A. Sakallak, 'Breaking instance-independent symmetries in exact graph coloring', in Proc. of DATE 2004, pp. 324-331, Paris, France, (2004). IEEE Comp. Society Press.
14. O Shcherbina, A. Neumaier, D. Sam-Haroud, X.-H. Vu, and T.-V. Nguyen, 'Benchmarking global optimization and constraint satisfaction codes', in Proc. of COCOS 2002), volume 2861 of LNCS, pp. 211-222, Valbonne-Sophia Antipolis, France, (2003). Springer.
15. G. Smolka, 'The Oz programming model', in Computer Science Today: Recent Trends and Developments, volume 1000 of LNCS, 324-343, Springer, (1995).
16. P. Van Hentenryck, The OPL Optimization Programming Language, The MIT Press, 1999.
17. M. Wallace, J. Schimpf, K. Shen, and W. Harvey, 'On benchmarking constraint logic programming platforms. response to [5]', Constraints, 9(1), 5-34, (2004).