{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T13:26:11Z","timestamp":1777728371906,"version":"3.51.4"},"reference-count":32,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T00:00:00Z","timestamp":1715990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Intelligenza Artificiale: The international journal of the AIxIA"],"published-print":{"date-parts":[[2024,10,9]]},"abstract":"<jats:p>Marketplaces bring together products from multiple providers and automatically manage orders that involve several suppliers. We document the use of Answer Set Programming to automatically choose products from various warehouses within a marketplace network to fulfill a specified order. The proposed solution seamlessly adapts to various objective functions utilized at different stages of order management, leading to cost savings for customers and simplifying logistics for both the marketplace and its suppliers.<\/jats:p>","DOI":"10.3233\/ia-240024","type":"journal-article","created":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T11:06:13Z","timestamp":1716289573000},"page":"261-278","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Addressing marketplace logistic tasks in answer set programming"],"prefix":"10.1177","volume":"18","author":[{"given":"Mario","family":"Alviano","sequence":"first","affiliation":[{"name":"DEMACS, University of Calabria, Rende (CS), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danilo","family":"Amendola","sequence":"additional","affiliation":[{"name":"Oliveru - Smartly Engineering, Rende, Italy and Joint Research Centre, European Commission, Geel, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis Angel","family":"Rodriguez Reiners","sequence":"additional","affiliation":[{"name":"DEMACS, University of Calabria, Rende (CS), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2024,5,18]]},"reference":[{"key":"ref001","doi-asserted-by":"publisher","DOI":"10.3233\/IA-180119"},{"key":"ref002","doi-asserted-by":"publisher","DOI":"10.1017\/S147106841600020X"},{"key":"ref003","unstructured":"Mario Alviano, Carmine Dodaro, Francesco Ricca A MaxSAT algorithm using cardinality constraints of bounded size, In Qiang Yang and Michael J. Wooldridge, editors, Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25\u201331, 2015, pages 2677\u20132683. AAAI Press, 2015. URL http:\/\/ijcai.org\/Abstract\/15\/379"},{"key":"ref004","unstructured":"Mario Alviano, Davide Cirimele, Luis Angel Rodriguez Reiners Introducing ASP recipes and ASP chef, In Joaquin Arias, Sotiris Batsakis, Wolfgang Faber, Gopal Gupta, Francesco Pacenza, Emmanuel Papadakis, Livio Robaldo, Kilian Ruckschlos, Elmer Salazar, Zeynep Gozen Saribatur, Ilias Tachmazidis, Felix Weitkamper, and Adam Z. Wyner, editors, Proceedings of the International Conference on Logic Programming 2023, Workshops co-located with the 39th International Conference on Logic Programming (ICLP 2023), London, United Kingdom, July 9th and 10th, 2023, volume 3437 of CEUR Workshop Proceedings. CEUR-WS.org, 2023. URL https:\/\/ceur-ws.org\/Vol-3437\/paper4ASPOCP.pdf."},{"key":"ref005","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2023.103931"},{"key":"ref006","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-52038-9_4"},{"key":"ref007","doi-asserted-by":"publisher","DOI":"10.1007\/s00354-016-0301-3"},{"key":"ref008","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00364-6"},{"key":"ref009","doi-asserted-by":"publisher","DOI":"10.1109\/69.877512"},{"key":"ref010","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000450"},{"key":"ref011","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.2166687"},{"key":"ref012","unstructured":"Byungki Cha, Kazuo Iwama, Yahiko Kambayashi, Shuichi Miyazaki, Local search algorithms for partial MAXSAT. In Benjamin Kuipers and Bonnie L. Webber, editors, Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, AAAI 97, IAAI 97, July 27\u201331, 1997, Providence, Rhode Island, USA, pages 263\u2013268. AAAI Press\/The MIT Press, 1997. URL http:\/\/www.aaai.org\/Library\/AAAI\/1997\/aaai97-041.php"},{"key":"ref013","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068421000363"},{"key":"ref014","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2019.119348"},{"key":"ref015","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000329"},{"key":"ref016","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.04.001"},{"key":"ref017","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068420000241"},{"key":"ref018","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90039-6"},{"key":"ref019","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107406"},{"key":"ref020","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.2753810"},{"key":"ref021","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"ref022","doi-asserted-by":"publisher","DOI":"10.1016\/j.petrol.2020.107512"},{"key":"ref023","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"ref024","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018930122475"},{"key":"ref025","unstructured":"OECD, Unpacking E-commerce: Business Models, Trend and Policies, OECD Publishing, Paris, 2019. doi; https:\/\/doi.org\/10.1787\/23561431-en. URL https:\/\/www.oecd-ilibrary.org\/content\/publication\/23561431-en."},{"key":"ref026","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2019.102153"},{"key":"ref027","doi-asserted-by":"publisher","DOI":"10.47392\/irjash.2021.026"},{"key":"ref028","doi-asserted-by":"publisher","DOI":"10.3390\/a16040216"},{"key":"ref029","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v35i2.2539"},{"key":"ref030","unstructured":"TsangE., FruehwirthT. Foundations of Constraint Satisfaction: The Classic Text, Books on Demand, 2014. ISBN 9783735723666. URL https:\/\/books.google.it\/books?id=UFmRAwAAQBAJ."},{"key":"ref031","doi-asserted-by":"publisher","DOI":"10.1016\/J.CIE.2021.107724"},{"key":"ref032","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.07.004"}],"container-title":["Intelligenza Artificiale: The international journal of the AIxIA"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/IA-240024","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/IA-240024","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/IA-240024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:51:54Z","timestamp":1777459914000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/IA-240024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,18]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,10,9]]}},"alternative-id":["10.3233\/IA-240024"],"URL":"https:\/\/doi.org\/10.3233\/ia-240024","relation":{},"ISSN":["1724-8035","2211-0097"],"issn-type":[{"value":"1724-8035","type":"print"},{"value":"2211-0097","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,18]]}}}