{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T18:54:28Z","timestamp":1694631268038},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,1,25]],"date-time":"2008-01-25T00:00:00Z","timestamp":1201219200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,25]],"date-time":"2008-01-25T00:00:00Z","timestamp":1201219200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10601-007-9028-6","type":"journal-article","created":{"date-parts":[[2008,1,24]],"date-time":"2008-01-24T06:57:06Z","timestamp":1201157826000},"page":"407-436","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Evaluating ASP and Commercial Solvers on the CSPLib"],"prefix":"10.1007","volume":"13","author":[{"given":"Toni","family":"Mancini","sequence":"first","affiliation":[]},{"given":"Davide","family":"Micaletto","sequence":"additional","affiliation":[]},{"given":"Fabio","family":"Patrizi","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Cadoli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,1,25]]},"reference":[{"key":"9028_CR1","unstructured":"Bosch, R., & Trick, M. (2002). Constraint programming and hybrid formulations for three life designs. In Proceedings of the fourth international workshop on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR\u00a02002) (pp. 77\u201391). Le Croisic."},{"issue":"8\u20139","key":"9028_CR2","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1016\/j.artint.2006.01.008","volume":"170","author":"M. Cadoli","year":"2006","unstructured":"Cadoli, M., & Mancini, T. (2006). Automated reformulation of specifications by safe delay of constraints. Artificial Intelligence, 170(8\u20139), 779\u2013801.","journal-title":"Artificial Intelligence"},{"issue":"4\/5","key":"9028_CR3","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1080\/08839510701252650","volume":"21","author":"M. Cadoli","year":"2007","unstructured":"Cadoli, M., & Mancini, T. (2007). Using a theorem prover for reasoning on constraint problems. Applied Artificial Intelligence, 21(4\/5), 383\u2013404.","journal-title":"Applied Artificial Intelligence"},{"key":"9028_CR4","unstructured":"Cadoli, M., Mancini, T., Micaletto, D., & Patrizi, F. (2006). Evaluating ASP and commercial solvers on the CSPLib. In Proceedings of the seventeenth european conference on artificial intelligence (ECAI\u00a02006) (pp.\u00a068\u201372). IOS Press."},{"key":"9028_CR5","doi-asserted-by":"crossref","unstructured":"Cadoli, M., Mancini, T., & Patrizi, F. (2006). SAT as an effective solving technology for constraint problems. In Proceedings of the sixteenth international symposium on methodologies for intelligent systems (ISMIS\u00a02006). Lecture Notes in Computer Science (Vol. 4203, pp.\u00a0540\u2013549). Bari, Italy: Springer.","DOI":"10.1007\/11875604_61"},{"key":"9028_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.artint.2004.01.006","volume":"162","author":"M. Cadoli","year":"2005","unstructured":"Cadoli, M., & Schaerf, A. (2005). Compiling problem specifications into SAT. Artificial Intelligence, 162, 89\u2013120.","journal-title":"Artificial Intelligence"},{"key":"9028_CR7","doi-asserted-by":"crossref","unstructured":"Castillo, E., Conejo, A. J., Pedregal, P., Garca, R., & Alguacil, N. (2001). Building and solving mathematical programming models in engineering and science. John Wiley & Sons.","DOI":"10.1002\/9780471225294"},{"issue":"2","key":"9028_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/A:1009894810205","volume":"4","author":"B. M. W. Cheng","year":"1999","unstructured":"Cheng, B. M. W., Choi, K. M. F., Lee, J. H.-M., & Wu, J.C.K. (1999). Increasing constraint propagation by redundant modeling: An experience report. Constraints, 4(2), 167\u2013192.","journal-title":"Constraints"},{"key":"9028_CR9","unstructured":"Crawford, J. M., Ginsberg, M. L., Luks, E. M., & Roy, A. (1996). Symmetry-breaking predicates for search problems. In Proceedings of the fifth international conference on the principles of knowledge representation and reasoning (KR\u201996) (pp.\u00a0148\u2013159). Morgan Kaufmann."},{"issue":"2","key":"9028_CR10","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1038\/scientificamerican0987-112","volume":"224","author":"A. K. Dewdney","year":"1987","unstructured":"Dewdney, A. K. (1987). The game life aquires some successors in three dimensions. Science American, 224(2), 112\u2013118.","journal-title":"Science American"},{"key":"9028_CR11","doi-asserted-by":"crossref","unstructured":"Dovier, A., Formisano, A., & Pontelli, E. (2005). A comparison of CLP(FD) and ASP solutions to NP-complete problems. In Proceedings of the twentyfirst international conference on logic programming (ICLP\u00a02005). Lecture Notes in Computer Science (Vol. 3668, pp.\u00a067\u201382). Springer.","DOI":"10.1007\/11562931_8"},{"key":"9028_CR12","unstructured":"Ellman, T. (1993). Abstraction via approximate symmetry. In Proceedings of the thirteenth international joint conference on artificial intelligence (IJCAI\u201993) (pp.\u00a0916\u2013921). Morgan Kaufmann."},{"issue":"3","key":"9028_CR13","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1023\/A:1009816801567","volume":"5","author":"A. J. Fern\u00e1ndez","year":"2000","unstructured":"Fern\u00e1ndez, A. J., & Hill, P. M. (2000). A comparative study of eight constraint programming languages over the Boolean and Finite Domains. Constraints, 5(3), 275\u2013301.","journal-title":"Constraints"},{"issue":"15","key":"9028_CR14","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1002\/spe.623","volume":"34","author":"R. A. Finkel","year":"2004","unstructured":"Finkel, R. A., Marek, V. W., & Truszczynski, M. (2004). Constraint Lingo: Towards high-level constraint programming. Software\u2014Practice and Experience, 34(15), 1481\u20131504.","journal-title":"Software\u2014Practice and Experience"},{"key":"9028_CR15","doi-asserted-by":"crossref","unstructured":"Flener, P., Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., et al. (2002). Breaking row and column symmetries in matrix models. In Proceedings of the eighth international conference on principles and practice of constraint programming (CP\u00a02002). Lecture Notes in Computer Science (Vol.\u00a02470, p.\u00a0462). Springer.","DOI":"10.1007\/3-540-46135-3_31"},{"key":"9028_CR16","unstructured":"Fourer, R., Gay, D. M., & Kernigham, B. W. (1993). AMPL: A modeling language for mathematical programming. International Thomson Publishing."},{"key":"9028_CR17","unstructured":"Freuder, E. C., & Sabin, D. (1997). Interchangeability supports abstraction and reformulation for multi-dimensional constraint satisfaction. In Proceedings of the fourteenth national conference on artificial intelligence (AAAI\u201997) (pp.\u00a0191\u2013196). AAAI Press\/The MIT Press."},{"key":"9028_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0004-3702(92)90021-O","volume":"57","author":"F. Giunchiglia","year":"1992","unstructured":"Giunchiglia, F., & Walsh, T. (1992). A theory of abstraction. Artificial Intelligence, 57, 323\u2013389.","journal-title":"Artificial Intelligence"},{"key":"9028_CR19","doi-asserted-by":"crossref","unstructured":"Gu, J., Purdom, P., Franco, J., & Wah, B. (1997). Algorithms for the satisfiability (SAT) problem: A survey. In Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science (pp.\u00a019\u2013152). American Mathematical Society.","DOI":"10.1090\/dimacs\/035\/02"},{"issue":"3","key":"9028_CR20","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., et al. (2006). The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic, 7(3), 499\u2013562.","journal-title":"ACM Transactions on Computational Logic"},{"key":"9028_CR21","doi-asserted-by":"crossref","unstructured":"Lierler, Y., & Maratea, M. (2004). Cmodels-2: SAT-based Answer Set Solver enhanced to non-tight programs. In V. Lifschitz & I. Niemel\u00e4 (Eds.), Proceedings of the seventh international conference on logic for programming and nonmonotonic reasoning (LPNMR\u00a02004). Lecture Notes in Computer Science (Vol.\u00a02923, pp.\u00a0346\u2013350). Fort Lauderdale, FL, USA: Springer.","DOI":"10.1007\/978-3-540-24609-1_32"},{"issue":"1\u20132","key":"9028_CR22","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","volume":"157","author":"F. Lin","year":"2004","unstructured":"Lin, F., & Yuting, Z. (2004). ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence, 157(1\u20132), 115\u2013137.","journal-title":"Artificial Intelligence"},{"key":"9028_CR23","doi-asserted-by":"crossref","unstructured":"Mancini, T., & Cadoli, M. (2005). Detecting and breaking symmetries by reasoning on problem specifications. In Proceedings of the sixth international symposium on abstraction, reformulation and approximation (SARA\u00a02005). Lecture Notes in Artificial Intelligence (Vol. 3607, pp.\u00a0165\u2013181). Springer.","DOI":"10.1007\/11527862_12"},{"key":"9028_CR24","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.artint.2007.04.017","volume":"171","author":"T. Mancini","year":"2007","unstructured":"Mancini, T., & Cadoli, M. (2007). Exploiting functional dependencies in declarative problem specifications. Artificial Intelligence, 171, 985\u20131010.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"9028_CR25","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10107-005-0585-4","volume":"103","author":"A. Neumaier","year":"2005","unstructured":"Neumaier, A., Shcherbina, O., Huyer, W., & Vink\u00f3, T. (2005). A comparison of complete global optimization solvers. Mathematical Programming, 103(2), 335\u2013356.","journal-title":"Mathematical Programming"},{"issue":"3,4","key":"9028_CR26","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I. (1999). Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4), 241\u2013273.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9028_CR27","doi-asserted-by":"crossref","unstructured":"Pelov, N., De\u00a0Mot, E., & Denecker, M. (2000). Logic Programming approaches for representing and solving Constraint Satisfaction Problems: A comparison. In M. Parigot & A. Voronkov (Eds.), Proceedings of the seventh international conference on logic for programming and automated reasoning (LPAR\u00a02000). Lecture Notes in Computer Science (Vol.\u00a01955, pp.\u00a0225\u2013239). Springer.","DOI":"10.1007\/3-540-44404-1_15"},{"key":"9028_CR28","doi-asserted-by":"crossref","unstructured":"Puget, J.-F. (1993). On the satisfiability of symmetrical constrained satisfaction problems. In H. J. Komorowski & Z. W. Ras (Eds.), Proceedings of the seventh international symposium on methodologies for intelligent systems (ISMIS\u201993). Lecture Notes in Computer Science (Vol. 689, pp.\u00a0350\u2013361). Springer.","DOI":"10.1007\/3-540-56804-2_33"},{"key":"9028_CR29","doi-asserted-by":"crossref","unstructured":"Ramani, A., Aloul, F. A., Markov, I. L., & Sakallak, K. A. (2004). Breaking instance-independent symmetries in exact graph coloring. In Proceedings of design automation and test conference in europe (DATE\u00a02004) (pp.\u00a0324\u2013331). IEEE Computer Society Press.","DOI":"10.1109\/DATE.2004.1268868"},{"key":"9028_CR30","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.-C. (2003). Global constraints and filtering algorithms. In M. Milano (Ed.) Constraint and Integer Programming \u2013 Toward a Unified Methodology, Operations Research\/Computer Science Interfaces, Vol.\u00a027, chapter\u00a04. Kluwer Academic Publisher.","DOI":"10.1007\/978-1-4419-8917-8_4"},{"key":"9028_CR31","doi-asserted-by":"crossref","unstructured":"Shcherbina, O., Neumaier, A., Sam-Haroud, D., Vu, X.-H., & Nguyen, T.-V. (2003). Benchmarking global optimization and constraint satisfaction codes. In Proceedings of the first international workshop on global constraint optimization and constraint satisfaction (COCOS 2002). Lecture Notes in Computer Science (Vol.\u00a02861, pp.\u00a0211\u2013222). Springer.","DOI":"10.1007\/978-3-540-39901-8_16"},{"key":"9028_CR32","doi-asserted-by":"crossref","unstructured":"Smith, B. M. (2002). A dual graph translation of a problem in \u2018life\u2019. In Proceedings of the eighth international conference on principles and practice of constraint programming (CP\u00a02002). Lecture Notes in Computer Science (Vol. 2470, pp.\u00a0402\u2013414). Springer.","DOI":"10.1007\/3-540-46135-3_27"},{"key":"9028_CR33","unstructured":"Smith, B. M., Stergiou, K., & Walsh, T. (2000). Using auxiliary variables and implied constraints to model non-binary problems. In Proceedings of the seventeenth national conference on artificial intelligence (AAAI\u00a02000) (pp.\u00a0182\u2013187). AAAI Press\/The MIT Press."},{"key":"9028_CR34","doi-asserted-by":"crossref","unstructured":"Smolka, G. (1995). The Oz programming model. In Computer Science Today: Recent Trends and Developments. Lecture Notes in Computer Science (Vol. 1000, pp.\u00a0324\u2013343). Springer.","DOI":"10.1007\/BFb0015252"},{"key":"9028_CR35","unstructured":"Ullman, J. D. (1988). Principles of database and knowledge base systems, Vol.\u00a01. Computer Science Press."},{"key":"9028_CR36","unstructured":"Van\u00a0Hentenryck, P. (1999). The OPL optimization programming language. The MIT Press."},{"issue":"1","key":"9028_CR37","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/B:CONS.0000006181.40558.37","volume":"9","author":"M. Wallace","year":"2004","unstructured":"Wallace, M., Schimpf, J., Shen, K., & Harvey, W. (2004). On benchmarking constraint logic programming platforms. Response to Fern\u00e1ndez and Hill\u2019s \u201cA comparative study of eight constraint programming languages over the Boolean and Finite Domains\u201d. Constraints, 9(1), 5\u201334","journal-title":"Constraints"},{"key":"9028_CR38","doi-asserted-by":"crossref","unstructured":"Walsh, T. (2001). Permutation problems and channelling constraints. In R. Nieuwenhuis & A, Voronkov (Eds.), Proceedings of the eighth international conference on logic for programming and automated reasoning (LPAR\u00a02001). Lecture Notes in Computer Science (Vol. 2250, pp.\u00a0377\u2013391). Springer.","DOI":"10.1007\/3-540-45653-8_26"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-007-9028-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-007-9028-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-007-9028-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-007-9028-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T00:34:39Z","timestamp":1652661279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-007-9028-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,25]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9028"],"URL":"https:\/\/doi.org\/10.1007\/s10601-007-9028-6","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,25]]},"assertion":[{"value":"9 March 2007","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2007","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2008","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}