{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T11:27:24Z","timestamp":1769599644145,"version":"3.49.0"},"reference-count":37,"publisher":"Cambridge University Press (CUP)","issue":"4-6","license":[{"start":{"date-parts":[[2010,7,9]],"date-time":"2010-07-09T00:00:00Z","timestamp":1278633600000},"content-version":"unspecified","delay-in-days":8,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2010,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves arc, bound or range consistency. Experiments with our encodings demonstrate their computational impact.<\/jats:p>","DOI":"10.1017\/s1471068410000220","type":"journal-article","created":{"date-parts":[[2010,7,9]],"date-time":"2010-07-09T12:44:40Z","timestamp":1278679480000},"page":"465-480","source":"Crossref","is-referenced-by-count":18,"title":["A translational approach to constraint answer set solving"],"prefix":"10.1017","volume":"10","author":[{"given":"CHRISTIAN","family":"DRESCHER","sequence":"first","affiliation":[]},{"given":"TOBY","family":"WALSH","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2010,7,9]]},"reference":[{"key":"S1471068410000220_ref33","volume-title":"Handbook of Constraint Programming","author":"Rossi","year":"2006"},{"key":"S1471068410000220_ref32","first-page":"930","volume-title":"Proceedings of CP'03","author":"Petrie","year":"2003"},{"key":"S1471068410000220_ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217859"},{"key":"S1471068410000220_ref29","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018930122475"},{"key":"S1471068410000220_ref28","first-page":"112","article-title":"A SAT solver primer","volume":"85","author":"Mitchell","year":"2005","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"S1471068410000220_ref25","first-page":"23","volume-title":"Proceedings of ICLP'99","author":"Lifschitz","year":"1999"},{"key":"S1471068410000220_ref23","volume-title":"CP'96, Second International Workshop on Constraint-based Reasoning","author":"Leconte","year":"1996"},{"key":"S1471068410000220_ref12","unstructured":"Gebser M. , Hinrichs H. , Schaub T. , and Thiele S. 2009. Xpanda: A (simple) preprocessor for adding multi-valued propositions to ASP. In Proceedings of WLP'09."},{"key":"S1471068410000220_ref22","first-page":"155","volume-title":"Proceedings of LPNMR'09","author":"J\u00e4rvisalo","year":"2009"},{"key":"S1471068410000220_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90033-7"},{"key":"S1471068410000220_ref19","first-page":"221","volume-title":"Proceedings of AAAI'97","author":"Gomes","year":"1997"},{"key":"S1471068410000220_ref17","first-page":"121","volume-title":"Proceedings of ECAI'02","author":"Gent","year":"2002"},{"key":"S1471068410000220_ref11","first-page":"52","volume-title":"Proceedings of IJCAI'93","author":"Fujita","year":"1993"},{"key":"S1471068410000220_ref10","first-page":"67","volume-title":"Proceedings of ICLP'05","author":"Dovier","year":"2005"},{"key":"S1471068410000220_ref9","volume-title":"Constraint Processing","author":"Dechter","year":"2003"},{"key":"S1471068410000220_ref34","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"S1471068410000220_ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-009-9116-y"},{"key":"S1471068410000220_ref6","volume-title":"Handbook of Satisfiability","author":"Biere","year":"2009"},{"key":"S1471068410000220_ref36","first-page":"441","volume-title":"Proceedings of CP'00","author":"Walsh","year":"2000"},{"key":"S1471068410000220_ref3","doi-asserted-by":"crossref","unstructured":"Baral C. , Chancellor K. , Tran N. , Tran N. , Joy A. , and Berens M. 2004. A knowledge based approach for representing and reasoning about signaling networks. In Proceedings of ISMB\/ECCB'04. 15\u201322.","DOI":"10.1093\/bioinformatics\/bth918"},{"key":"S1471068410000220_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"S1471068410000220_ref1","first-page":"402","volume-title":"Proceedings of LPNMR'09","author":"Balduccini","year":"2009"},{"key":"S1471068410000220_ref14","first-page":"386","volume-title":"Proceedings of IJCAI'07","author":"Gebser","year":"2007"},{"key":"S1471068410000220_ref18","first-page":"480","volume-title":"Proceedings of CP'99","author":"Gent","year":"1999"},{"key":"S1471068410000220_ref26","first-page":"15","volume-title":"Proceedings of FLOPS'08","author":"Mellarkod","year":"2008"},{"key":"S1471068410000220_ref16","first-page":"1070","volume-title":"Proceedings of ICLP'88","author":"Gelfond","year":"1988"},{"key":"S1471068410000220_ref5","volume-title":"Proceedings of IJCAI'09","author":"Bessi\u00e8re","year":"2009"},{"key":"S1471068410000220_ref4","first-page":"52","volume-title":"Proceedings of ICLP'05","author":"Baselice","year":"2005"},{"key":"S1471068410000220_ref7","first-page":"1092","volume-title":"Proceedings of AAAI'94","author":"Crawford","year":"1994"},{"key":"S1471068410000220_ref35","first-page":"590","volume-title":"Proceedings of CP'06","author":"Tamura","year":"2006"},{"key":"S1471068410000220_ref37","first-page":"314","volume-title":"Proceedings of ICLP'04","author":"You","year":"2004"},{"key":"S1471068410000220_ref31","first-page":"169","volume-title":"Proceedings of PADL'01","author":"Nogueira","year":"2001"},{"key":"S1471068410000220_ref20","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001790"},{"key":"S1471068410000220_ref24","first-page":"503","volume-title":"Proceedings of IJCAI'05","author":"Lee","year":"2005"},{"key":"S1471068410000220_ref15","first-page":"235","volume-title":"Proceedings of ICLP'09","author":"Gebser","year":"2009"},{"key":"S1471068410000220_ref13","first-page":"260","volume-title":"Proceedings of LPNMR'07","author":"Gebser","year":"2007"},{"key":"S1471068410000220_ref8","first-page":"115","volume-title":"Proceedings of ICLP'09","author":"Dal Pal\u00f9","year":"2009"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068410000220","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:32:33Z","timestamp":1556479953000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068410000220\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":37,"journal-issue":{"issue":"4-6","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["S1471068410000220"],"URL":"https:\/\/doi.org\/10.1017\/s1471068410000220","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7]]}}}