{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:35:53Z","timestamp":1760708153254},"reference-count":49,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2010,1,18]],"date-time":"2010-01-18T00:00:00Z","timestamp":1263772800000},"content-version":"unspecified","delay-in-days":0,"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,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents a logic language for expressing <jats:private-char><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" mimetype=\"image\" xlink:type=\"simple\" xlink:href=\"S1471068409990251_char3\" \/><\/jats:private-char> search and optimization problems. Specifically, first a language obtained by extending (positive) <jats:monospace>DATALOG<\/jats:monospace> with intuitive and efficient constructs (namely, stratified negation, constraints, and exclusive disjunction) is introduced. Next, a further restricted language only using a restricted form of disjunction to define (nondeterministically) subsets (or partitions) of relations is investigated. This language, called <jats:private-char><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" mimetype=\"image\" xlink:type=\"simple\" xlink:href=\"S1471068409990251_char3\" \/><\/jats:private-char><jats:private-char><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" mimetype=\"image\" xlink:type=\"simple\" xlink:href=\"S1471068409990251_char4\" \/><\/jats:private-char><jats:italic>atalog<\/jats:italic>, captures the power of <jats:monospace>DATALOG<\/jats:monospace><jats:sup>\u00ac<\/jats:sup> in expressing search and optimization problems. A system prototype implementing <jats:private-char><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" mimetype=\"image\" xlink:type=\"simple\" xlink:href=\"S1471068409990251_char3\" \/><\/jats:private-char><jats:private-char><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" mimetype=\"image\" xlink:type=\"simple\" xlink:href=\"S1471068409990251_char4\" \/><\/jats:private-char><jats:italic>atalog<\/jats:italic> is presented. The system translates <jats:private-char><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" mimetype=\"image\" xlink:type=\"simple\" xlink:href=\"S1471068409990251_char3\" \/><\/jats:private-char><jats:private-char><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" mimetype=\"image\" xlink:type=\"simple\" xlink:href=\"S1471068409990251_char4\" \/><\/jats:private-char><jats:italic>atalog<\/jats:italic> queries into Optimization Programming Language (OPL) programs which are executed by the ILOG OPL Development Studio. Our proposal combines easy formulation of problems, expressed by means of a declarative logic language, with the efficiency of the ILOG System. Several experiments show the effectiveness of this approach.<\/jats:p>","DOI":"10.1017\/s1471068409990251","type":"journal-article","created":{"date-parts":[[2010,1,18]],"date-time":"2010-01-18T08:58:25Z","timestamp":1263805105000},"page":"125-166","source":"Crossref","is-referenced-by-count":7,"title":["atalog: A logic language for expressing  search and optimization problems"],"prefix":"10.1017","volume":"10","author":[{"given":"SERGIO","family":"GRECO","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CRISTIAN","family":"MOLINARO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"IRINA","family":"TRUBITSYNA","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ESTER","family":"ZUMPANO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2010,1,18]]},"reference":[{"key":"S1471068409990251_ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35602-0_22"},{"key":"S1471068409990251_ref49","first-page":"692","volume-title":"Proc. of the ACM Symppsium on Applied Computing","author":"Zumpano","year":"2004"},{"key":"S1471068409990251_ref47","first-page":"365","volume-title":"Proc. of the International Workshop on Practical Aspects of Declarative Languages","author":"Wallace","year":"1999"},{"key":"S1471068409990251_ref19","first-page":"574","volume-title":"Proc. of the International Conference on Database Theory","author":"Greco","year":"1995"},{"key":"S1471068409990251_ref8","first-page":"163","volume-title":"Proc. of the National Conference on Artificial Intelligence","author":"East","year":"2000"},{"key":"S1471068409990251_ref35","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90023-X"},{"key":"S1471068409990251_ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90033-2"},{"key":"S1471068409990251_ref27","unstructured":"Lierler Y. 2005. Disjunctive answer set programming via satisfiability. In Proc. of the International Workshop on Answer Set Programming, De Vos M. and Provetti A. , Eds. CEUR Workshop Proceedings 142, 85\u201397."},{"key":"S1471068409990251_ref30","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116836"},{"key":"S1471068409990251_ref34","volume-title":"Combinatorial Optimization \u2013 Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"S1471068409990251_ref12","doi-asserted-by":"publisher","DOI":"10.1002\/spe.623"},{"key":"S1471068409990251_ref18","first-page":"181","volume-title":"Symposium on Logic Programming","author":"Greco","year":"1997"},{"key":"S1471068409990251_ref11","first-page":"43","volume-title":"Complexity of Computation","author":"Fagin","year":"1974"},{"key":"S1471068409990251_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45632-5_16"},{"key":"S1471068409990251_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0096-0551(01)00010-8"},{"key":"S1471068409990251_ref22","first-page":"67","volume-title":"Handbook of Theoretical Computer Science","author":"Johnson","year":"1990"},{"key":"S1471068409990251_ref1","volume-title":"Foundations of Databases","author":"Abiteboul","year":"1995"},{"key":"S1471068409990251_ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(96)00021-4"},{"key":"S1471068409990251_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45632-5_3"},{"key":"S1471068409990251_ref13","unstructured":"Gebser M. , Kaufmann B. , Neumann A. and Schaub T. 2007. Conflict-driven answer set solving. In Proc. of the International Joint Conference on Artificial Intelligence, Veloso M. M. , Ed., 386\u2013392."},{"key":"S1471068409990251_ref37","first-page":"431","volume-title":"Proc. of the International Conference on Logic Programming and Nonmonotonic Reasoning","author":"Rao","year":"1997"},{"key":"S1471068409990251_ref2","unstructured":"Balduccini M. , Gelfond M. and Nogueira M. 2000. A-Prolog as a tool for declarative programming. In Proc. of the International Conference on Software Engineering and Knowledge Engineering 63\u201372."},{"key":"S1471068409990251_ref20","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068401001090"},{"key":"S1471068409990251_ref21","doi-asserted-by":"publisher","DOI":"10.1145\/129393.129398"},{"key":"S1471068409990251_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63255-7_27"},{"key":"S1471068409990251_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.01.006"},{"key":"S1471068409990251_ref6","first-page":"518","volume-title":"Proc. of the International Conference on Principles of Knowledge Representation and Reasoning","author":"Cholewinski","year":"1996"},{"key":"S1471068409990251_ref14","first-page":"1070","volume-title":"Proc. of the International Conference on Logic Programming","author":"Gelfond","year":"1988"},{"key":"S1471068409990251_ref7","first-page":"703","volume-title":"Proc. of the International Conference on Computational Logic","author":"Denecker","year":"2000"},{"key":"S1471068409990251_ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1119439.1119441"},{"key":"S1471068409990251_ref25","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1031"},{"key":"S1471068409990251_ref36","volume-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"S1471068409990251_ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"S1471068409990251_ref28","doi-asserted-by":"publisher","DOI":"10.1007\/11546207_44"},{"key":"S1471068409990251_ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.004"},{"key":"S1471068409990251_ref33","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46767-X_23"},{"key":"S1471068409990251_ref38","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1446"},{"key":"S1471068409990251_ref32","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with Constraints: An Introduction","author":"Marriott","year":"1998"},{"key":"S1471068409990251_ref39","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1053"},{"key":"S1471068409990251_ref40","doi-asserted-by":"publisher","DOI":"10.1109\/32.58788"},{"key":"S1471068409990251_ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30227-8_12"},{"key":"S1471068409990251_ref44","volume-title":"The OPL Optimization Programming Language","author":"Van Hentenryck","year":"1988"},{"key":"S1471068409990251_ref41","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"S1471068409990251_ref42","volume-title":"Principles of Data and Knowledge-Base Systems","author":"Ullman","year":"1988"},{"key":"S1471068409990251_ref45","doi-asserted-by":"publisher","DOI":"10.1007\/10704567_6"},{"key":"S1471068409990251_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"S1471068409990251_ref43","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116838"},{"key":"S1471068409990251_ref16","doi-asserted-by":"publisher","DOI":"10.1109\/69.761663"},{"key":"S1471068409990251_ref46","first-page":"38","volume-title":"Proc. of the International Conference on Logic Programming","author":"Van Roy","year":"1999"}],"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\/S1471068409990251","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T20:26:26Z","timestamp":1556483186000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068409990251\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,18]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["S1471068409990251"],"URL":"https:\/\/doi.org\/10.1017\/s1471068409990251","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,18]]}}}