{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T15:12:57Z","timestamp":1697123577087},"reference-count":35,"publisher":"Informa UK Limited","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Experimental & Theoretical Artificial Intelligence"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1080\/09528130701538174","type":"journal-article","created":{"date-parts":[[2009,5,20]],"date-time":"2009-05-20T14:58:09Z","timestamp":1242831489000},"page":"79-121","source":"Crossref","is-referenced-by-count":19,"title":["An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems"],"prefix":"10.1080","volume":"21","author":[{"given":"Agostino","family":"Dovier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Formisano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Pontelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","volume":"17","author":"Anger C","year":"2004","journal-title":"ALP Newsletter"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"CIT0003","volume-title":"Computational Molecular Biology","author":"Clote P","year":"2001"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1998.5.423"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-5-186"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1145\/321033.321034"},{"key":"CIT0008","volume":"6","author":"Diaz D","year":"2001","journal-title":"Journal of Functional and Logic Programming"},{"key":"CIT0009","unstructured":"Dovier, A, Formisano, A and Pontelli, E. 2005. \u201cA Comparison of CLP(FD) and ASP in Tackling Hard Combinatorial Problems\u201d. www.di.univaq.it\/ formisano\/CLPASP"},{"key":"CIT0010","doi-asserted-by":"crossref","unstructured":"Elkabani, I, Pontelli, E and Son, TC. 2004. Smodels with CLP and its Applications: A Simple and Effective Approach to Aggregates in ASP. Proceedings of ICLP04. 2004. pp.73\u201389.","DOI":"10.1007\/978-3-540-27775-0_6"},{"key":"CIT0011","doi-asserted-by":"crossref","unstructured":"Elkhatib, O, Pontelli, E and Son, TC. 2004. A Tool for Reasoning About Answer Sets in Prolog. Proceedings of PADL. 2004. pp.148\u2013162.","DOI":"10.1007\/978-3-540-24836-1_11"},{"key":"CIT0012","first-page":"499","volume-title":"TPLP","volume":"3","author":"Erdem E","year":"2004"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009816801567"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45632-5_16"},{"key":"CIT0015","unstructured":"Gelfond, M and Lifschitz, V. 1988. The Stable Model Semantics for Logic Programming. Proceedings of ICLP88. 1988. pp.1070\u20131080. Boston, MA: MIT Press."},{"key":"CIT0016","first-page":"193","volume":"2","author":"Gelfond M","year":"1998","journal-title":"Electronic Transactions on Artificial Intelligence"},{"key":"CIT0017","unstructured":"Giunchiglia, E, Lierler, Y and Maratea, M. SAT-based Answer Set Programming. Proceedings of AAAI'04. 2004. pp.61\u201366."},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-006-9033-2"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90033-7"},{"key":"CIT0020","doi-asserted-by":"crossref","unstructured":"Lee, J and Lifschitz, V. 2003. Loop Formulas for Disjunctive Logic Programs. Proceedings of ICLP03. 2003. pp.451\u2013465.","DOI":"10.1007\/978-3-540-24599-5_31"},{"key":"CIT0021","doi-asserted-by":"crossref","unstructured":"Lierler, Y and Maratea, M. 2004. CMODELS-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs. Proceedings of LPNMR04. 2004. pp.346\u2013350.","DOI":"10.1007\/978-3-540-24609-1_32"},{"key":"CIT0022","unstructured":"Lifschitz, V. 1999. Answer Set Planning. Proceedings of ICLP99. 1999. pp.23\u201337."},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1145\/1131313.1131316"},{"key":"CIT0024","unstructured":"Lin, F and Zhao, Y. ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. Proceedings of AAAI'02. 2004. pp.112\u2013117."},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116836"},{"key":"CIT0026","doi-asserted-by":"crossref","unstructured":"Marek, VW and Truszczy\u0144ski, M. 1999. Stable Models and an Alternative Logic Programming Paradigm. The Logic Programming Paradigm. 1999, Berlin. pp.375\u2013398. Springer Verlag.","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"CIT0027","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with Constraints","author":"Marriott K","year":"1998"},{"key":"CIT0028","doi-asserted-by":"crossref","unstructured":"Moskewicz, MW, Madigan, CF, Zhao, Y, Zhang, L and Malik, S. 2001. Chaff: Engineering an Efficient SAT Solver. Proceedings of Design Automation Conference. 2001. pp.530\u2013535.","DOI":"10.1145\/378239.379017"},{"key":"CIT0029","volume-title":"Computational Complexity","author":"Papadimitriou CH","year":"1994"},{"key":"CIT0030","unstructured":"Prestwich, SD. 2003. Local Search on SAT-encoded Colouring Problems. Proceedings of SAT 2003, 6th International Conference. 2003. pp.105\u2013119."},{"key":"CIT0031","volume-title":"Doctoral dissertation","author":"Simons P","year":"2000"},{"key":"CIT0032","doi-asserted-by":"crossref","unstructured":"Son, TC, Baral, C and McIlraith, S. 2003. Planning with Different Forms of Domain-dependent Control Knowledge \u2014 An Answer Set Programming Approach. Proceedings of LPNMR01. 2003. pp.226\u2013239.","DOI":"10.1007\/3-540-45402-0_17"},{"key":"CIT0033","doi-asserted-by":"crossref","unstructured":"Thielscher, M. 2002. Reasoning about Actions with CHRs and Finite Domain Constraints. Proceedings of ICLP02. 2002. pp.70\u201384.","DOI":"10.1007\/3-540-45619-8_6"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1023\/B:CONS.0000006181.40558.37"},{"key":"CIT0035","unstructured":"Weisstein, EW. 2005. \u201cSchur Number\u201d. mathworld.wolfram.com\/SchurNumber.html"}],"container-title":["Journal of Experimental & Theoretical Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/09528130701538174","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T03:51:39Z","timestamp":1558324299000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/09528130701538174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["10.1080\/09528130701538174"],"URL":"https:\/\/doi.org\/10.1080\/09528130701538174","relation":{},"ISSN":["0952-813X","1362-3079"],"issn-type":[{"value":"0952-813X","type":"print"},{"value":"1362-3079","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}