{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T13:23:35Z","timestamp":1777728215781,"version":"3.51.4"},"reference-count":67,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018,1,1]]},"abstract":"<jats:p>Answer set programming (ASP) is a declarative language for nonmonotonic\n                        reasoning based on stable model semantics. A stable model is a classical\n                        model of the input program satisfying the following stability condition:\n                        only necessary information is included in the model under the assumptions\n                        provided by the model itself for the unknown knowledge in the program, where\n                        unknown knowledge is encoded by means of default negation. Rational agents\n                        acting in the real world often have to reason in presence of unknown\n                        knowledge. It is also common that real world agents cannot meet all their\n                        desiderata. For this reason, ASP programs may include weak constraints for\n                        representing numerical preferences over jointly incompatible conditions.\n                        Stable models are therefore associated with a cost given by the unsatisfied\n                        weak constraints, and stable models of minimum cost are preferred. This\n                        paper summarizes algorithms and strategies for computing optimal stable\n                        models, and hints on how these algorithms can be extended to handle some\n                        qualitative preferences that have a natural representation in\n                        circumscription, that is, those based on subset-minimality and\n                        superset-maximality.<\/jats:p>","DOI":"10.3233\/ia-180119","type":"journal-article","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T15:37:54Z","timestamp":1733153874000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms for solving optimization problems in answer set\n                        programming"],"prefix":"10.1177","volume":"12","author":[{"given":"Mario","family":"Alviano","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Calabria, Via Pietro Bucci, Rende (CS), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2018,7,22]]},"reference":[{"issue":"1","key":"ref001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2016-1441","volume":"149","author":"Alviano M.","year":"2016","journal-title":"Fundam Inform"},{"key":"ref002","first-page":"1","volume-title":"Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic, CEUR Workshop Proceedings","volume":"1949","author":"Alviano M.","year":"2017"},{"key":"ref003","first-page":"1","volume-title":"Proceedings of the 24th RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion 2017 (RCRA 2017) A workshop of the XVI International Conference of the Italian Association for Artificial Intelligence (AI*IA 2017), Bari, Italy, November 14, 2017, CEUR Workshop Proceedings","volume":"2011","author":"Alviano M.","year":"2017"},{"key":"ref004","volume-title":"Technical Communications of the 33rd International Conference on Logic Programming, ICLP 2017 TCs, August 28-September 1, 2017, Melbourne, Australia","author":"Alviano M.","year":"2017"},{"issue":"5","key":"ref005","first-page":"708","volume":"17","author":"Alviano M.","year":"2017","journal-title":"TPLP"},{"key":"ref006","doi-asserted-by":"crossref","unstructured":"AlvianoM. and DodaroC., Answer set enumeration via\n                            assumption literals. In AdorniGiovanni, CagnoniStefano, GoriMarco and\n                            MarateaMarco, editors, AI*IA 2016: Advances in Artificial Intelligence -\n                            XVth International Conference of the Italian Association for Artificial\n                            Intelligence, Genova, Italy, November 29 - December 1, 2016,\n                            Proceedings, volume 10037 of LNCS, 2016, pp. 149\u2013163. Springer. doi:\n                            10.1007\/978-3-319-49130-1_12. URL\n                            http:\/\/dx.doi.org\/10.1007\/978-3-319-49130-1_12 .","DOI":"10.1007\/978-3-319-49130-1_12"},{"issue":"5","key":"ref007","first-page":"533","volume":"16","author":"Alviano M.","year":"2016","journal-title":"TPLP"},{"key":"ref008","first-page":"4781","volume-title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017","author":"Alviano M.","year":"2017"},{"key":"ref009","doi-asserted-by":"crossref","unstructured":"AlvianoM. and FaberW., The complexity boundary of\n                            answer set programming with generalized atoms under the FLP semantics.\n                            In CabalarPedro and SonTran Cao, editors, Logic Programming and\n                            Nonmonotonic Reasoning, 12th International Conference, LPNMR 2013,\n                            Corunna, Spain, September 15-19, 2013. Proceedings, volume 8148 of\n                            Lecture Notes in Computer Science, 2013, pp. 67\u201372. Springer. doi:\n                            10.1007\/978-3-642-40564-8_7. URL\n                            https:\/\/doi.org\/10.1007\/978-3-642-40564-8_","DOI":"10.1007\/978-3-642-40564-8_7"},{"issue":"4","key":"ref010","first-page":"755","volume":"14","author":"Alviano M.","year":"2014","journal-title":"TPLP"},{"key":"ref011","doi-asserted-by":"crossref","unstructured":"AlvianoM., DodaroC., LeoneN. and RiccaF., Advances in\n                            WASP. In CalimeriFrancesco, IanniGiovambattista and\n                            TruszczynskiMiroslaw, editors, Proceedings of Logic Programming and\n                            Nonmonotonic Reasoning - 13th International Conference, LPNMR 2015,\n                            volume 9345 of LNCS, 2015, pp. 40\u201354. Springer. doi:\n                            10.1007\/978-3-319-23264-5_5. URL\n                            http:\/\/dx.doi.org\/10.1007\/978-3-319-23264-5_","DOI":"10.1007\/978-3-319-23264-5_5"},{"key":"ref012","author":"Alviano M.","year":"2015","journal-title":"Journal of Logic and Computation"},{"key":"ref013","unstructured":"AlvianoM., DodaroC. and RiccaF., A maxsat algorithm\n                            using cardinality constraints of bounded size. In YangQiang and\n                            WooldridgeMichael, editors, Proceedings of the Twenty-Fourth\n                            International Joint Conference on Artificial Intelligence, IJCAI 2015,\n                            Buenos Aires, Argentina, July 25-31, 2015, 2015, pp. 2677\u20132683. AAAI\n                            Press. URL http:\/\/ijcai.org\/Abstract\/15\/379"},{"issue":"4","key":"ref014","first-page":"559","volume":"15","author":"Alviano M.","year":"2015","journal-title":"TPLP"},{"key":"ref015","doi-asserted-by":"crossref","unstructured":"AlvianoM., CalimeriF., DodaroC., Fusc\u00e1D., LeoneN.,\n                            PerriS., RiccaF., VeltriP. and ZangariJ., The ASP system DLV2. In\n                            BalducciniMarcello and JanhunenTomi, editors, Logic Programming and\n                            Nonmonotonic Reasoning - 14th International Conference, LPNMR 2017,\n                            Espoo, Finland, July 3-6, 2017, Proceedings, volume 10377 of Lecture\n                            Notes in Computer Science, 2017, pp. 215\u2013221. Springer. doi:\n                            10.1007\/978-3-319-61660-5_19. URL\n                            https:\/\/doi.org\/10.1007\/978-3-319-61660-5_1","DOI":"10.1007\/978-3-319-61660-5_19"},{"key":"ref016","doi-asserted-by":"crossref","unstructured":"AlvianoM., DodaroC. and MarateaM., An advanced answer\n                            set programming encoding for nurse scheduling. In EspositoFloriana,\n                            BasiliRoberto, FerilliStefano and LisiF. A, editors, AI*IA 2017 Advances\n                            in Artificial Intelligence - XVIth International Conference of the\n                            Italian Association for Artificial Intelligence, Bari, Italy, November\n                            14-17, 2017, Proceedings, volume 10640 of Lecture Notes in Computer\n                            Science, 2017, pp. 468\u2013482. Springer. doi: 10.1007\/978-3-319-70169-1_35.\n                            URL https:\/\/doi.org\/10.1007\/978-3-319-70169-1_3","DOI":"10.1007\/978-3-319-70169-1_35"},{"key":"ref017","unstructured":"AndresB., KaufmannB., MatheisO. and SchaubT.,\n                            Unsatisfiability-based optimization in clasp. In DovierAgostino and\n                            CostaV\u00edtor Santos, editors, Technical Communications of the 28th\n                            International Conference on Logic Programming, ICLP 2012, volume 17 of\n                            LIPIcs, pp. 211\u2013221. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,\n                            2012. doi: 10.4230\/LIPIcs.ICLP.2012.211. URL\n                            http:\/\/dx.doi.org\/10.4230\/LIPIcs.ICLP.2012.21"},{"key":"ref018","doi-asserted-by":"crossref","unstructured":"AndresB., BiewerA., RomeroJ., HaubeltC. and SchaubT.,\n                            Improving coordinated smt-based system synthesis by utilizing\n                            domain-specific heuristics. In CalimeriFrancesco, IanniGiovambattista\n                            and TruszczynskiMiroslaw, editors, Logic Programming and Nonmonotonic\n                            Reasoning - 13th International Conference, LPNMR 2015, Lexington, KY,\n                            USA, September 27- 30, 2015. Proceedings, volume 9345 of Lecture Notes\n                            in Computer Science, 2015, pp. 55\u201368. Springer. doi:\n                            10.1007\/978-3-319-23264-5_6. URL\n                            https:\/\/doi.org\/10.1007\/978-3-319-23264-5_","DOI":"10.1007\/978-3-319-23264-5_6"},{"key":"ref019","doi-asserted-by":"crossref","unstructured":"Ans\u00f3teguiC., BonetM.L. and LevyJ., Solving (weighted)\n                            partial maxsat through satisfiability testing. In KullmannOliver,\n                            editor, Proceedings of Theory and Applications of Satisfiability\n                            Testing, SAT 2009, volume 5584 of Lecture Notes in Computer Science,\n                            2009, pp. 427\u2013440. Springer. doi: 10.1007\/978-3-642-02777-2_39. URL\n                            http:\/\/dx.doi.org\/10.1007\/978-3-642-02777-2_3","DOI":"10.1007\/978-3-642-02777-2_39"},{"key":"ref020","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.artint.2013.01.002","volume":"196","author":"Ans\u00f3tegui C.","year":"2013","journal-title":"Artif Intell"},{"key":"ref021","doi-asserted-by":"crossref","unstructured":"BalducciniM., GelfondM., WatsonR. and NogueiraM., The\n                            usa-advisor: A case study in answer set planning. In EiterThomas,\n                            FaberWolfgang, and TruszczynskiMiroslaw, editors, Logic Programming and\n                            Nonmonotonic Reasoning, 6th International Conference, LPNMR 2001,\n                            Vienna, Austria, September 17-19, 2001, Proceedings, volume 2173 of\n                            Lecture Notes in Computer Science, 2001, pp. 439\u2013442. Springer. doi:\n                            10.1007\/3-540-45402-0_39. URL\n                            https:\/\/doi.org\/10.1007\/3-540-45402-0_3","DOI":"10.1007\/3-540-45402-0_39"},{"issue":"4","key":"ref022","first-page":"591","volume":"17","author":"Balduccini M.","year":"2017","journal-title":"TPLP"},{"issue":"4","key":"ref023","first-page":"783","volume":"13","author":"Banbara M.","year":"2013","journal-title":"TPLP"},{"issue":"4","key":"ref024","first-page":"408","volume":"17","author":"Banbara M.","year":"2017","journal-title":"TPLP"},{"key":"ref025","doi-asserted-by":"crossref","unstructured":"BaralC. and UyanC., Declarative specification and\n                            solution of combinatorial auctions using logic programming. In\n                            EiterThomas, FaberWolfgang, and TruszczynskiMiroslaw, editors, Logic\n                            Programming and Nonmonotonic Reasoning, 6th International Conference,\n                            LPNMR 2001, Vienna, Austria, September 17-19, 2001, Proceedings, volume\n                            2173 of Lecture Notes in Computer Science, 2001, pp. 186\u2013199. Springer.\n                            doi: 10.1007\/3-540-45402-0_14. URL\n                            https:\/\/doi.org\/10.1007\/3-540-45402-0_1","DOI":"10.1007\/3-540-45402-0_14"},{"issue":"5","key":"ref026","first-page":"744","volume":"17","author":"Beck H.","year":"2017","journal-title":"TPLP"},{"key":"ref027","volume-title":"ASP for Anytime Dynamic Programming on Tree Decompositions","author":"Bliem B.","year":"2016"},{"issue":"6","key":"ref028","first-page":"783","volume":"15","author":"Bruynooghe M.","year":"2015","journal-title":"TPLP"},{"issue":"5","key":"ref029","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1109\/69.877512","volume":"12","author":"Buccafurri F.","year":"2000","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref030","unstructured":"ChaB., IwamaK., KambayashiY. and MiyazakiS., Local\n                            search algorithms for partial MAXSAT. In Fourteenth National Conference\n                            on Artificial Intelligence and Ninth Innovative Applications of\n                            Artificial Intelligence Conference, 1997, pp. 263\u2013268. AAAI Press\/The\n                            MIT Press."},{"issue":"5","key":"ref031","first-page":"780","volume":"17","author":"Cuteri B.","year":"2017","journal-title":"TPLP"},{"issue":"5","key":"ref032","first-page":"636","volume":"16","author":"Devriendt J.","year":"2016","journal-title":"TPLP"},{"issue":"5","key":"ref033","first-page":"653","volume":"16","author":"Dodaro C.","year":"2016","journal-title":"TPLP"},{"issue":"4","key":"ref034","first-page":"418","volume":"16","author":"Eiter T.","year":"2016","journal-title":"TPLP"},{"issue":"5","key":"ref035","first-page":"545","volume":"8","author":"Faber W.","year":"2008","journal-title":"TPLP"},{"issue":"1","key":"ref036","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.artint.2010.04.002","volume":"175","author":"Faber W.","year":"2011","journal-title":"Artif Intell"},{"issue":"4","key":"ref037","doi-asserted-by":"crossref","first-page":"25:1","DOI":"10.1145\/1970398.1970401","volume":"12","author":"Ferraris P.","year":"2011","journal-title":"ACM Trans Comput Log"},{"key":"ref038","doi-asserted-by":"crossref","unstructured":"FuZ. and MalikS., On Solving the Partial MAXSAT\n                            Problem. In BiereArmin and GomesC. P, editors, Proceedings of Theory and\n                            Applications of Satisfiability Testing, SAT 2006, volume 4121 of Lecture\n                            Notes in Computer Science, 2006, pp. 252\u2013265. Springer. doi:\n                            10.1007\/11814948_ 25. URL\n                            http:\/\/dx.doi.org\/10.1007\/11814948_2","DOI":"10.1007\/11814948_25"},{"key":"ref039","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.artint.2012.04.001","volume":"187","author":"Gebser M.","year":"2012","journal-title":"Artif Intell"},{"key":"ref040","doi-asserted-by":"crossref","unstructured":"GebserM., KaminskiR., KaufmannB., RomeroJ. and\n                            SchaubT., Progress in clasp series 3. In CalimeriFrancesco,\n                            IanniGiovambattista, and TruszczynskiMiroslaw, editors, Logic\n                            Programming and Nonmonotonic Reasoning - 13th International Conference,\n                            LPNMR 2015, Lexington, KY, USA, September 27-30, 2015. Proceedings,\n                            volume 9345 of Lecture Notes in Computer Science, 2015, pp. 368\u2013383.\n                            Springer. doi: 10.1007\/978-3-319-23264-5_31. URL\n                            https:\/\/doi.org\/10.1007\/978-3-319-23264-5_3","DOI":"10.1007\/978-3-319-23264-5_31"},{"key":"ref041","doi-asserted-by":"crossref","unstructured":"GebserM., RyabokonA. and SchennerG., Combining\n                            heuristics for configuration problems using answer set programming. In\n                            CalimeriFrancesco, IanniGiovambattista, and TruszczynskiMiroslaw,\n                            editors, Logic Programming and Nonmonotonic Reasoning - 13th\n                            International Conference, LPNMR 2015, Lexington, KY, USA, September\n                            27-30, 2015. Proceedings, volume 9345 of Lecture Notes in Computer\n                            Science, 2015, pp. 384\u2013397. Springer. doi: 10.1007\/978-3-319-23264-5_32.\n                            URL https:\/\/doi.org\/10.1007\/978-3-319-23264-5_3","DOI":"10.1007\/978-3-319-23264-5_32"},{"key":"ref042","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139342124","volume-title":"Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer- Set Programming Approach","author":"Gelfond M.","year":"2014"},{"issue":"3","key":"ref043","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"Gelfond M.","year":"1991","journal-title":"New Generation Comput"},{"issue":"4","key":"ref044","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10817-006-9033-2","volume":"36","author":"Giunchiglia E.","year":"2006","journal-title":"J Autom Reasoning"},{"issue":"1","key":"ref045","first-page":"117","volume":"15","author":"Hoos Holger H.","year":"2015","journal-title":"TPLP"},{"issue":"5","key":"ref046","first-page":"872","volume":"17","author":"Janhunen T.","year":"2017","journal-title":"TPLP"},{"issue":"4","key":"ref047","first-page":"675","volume":"13","author":"Kaminski R.","year":"2013","journal-title":"TPLP"},{"issue":"4","key":"ref048","first-page":"604","volume":"15","author":"Koponen L.","year":"2015","journal-title":"TPLP"},{"key":"ref049","doi-asserted-by":"crossref","unstructured":"LierlerY. and MarateaM., Cmodels-2: Sat-based answer\n                            set solver enhanced to non-tight programs. In LifschitzVladimir and\n                            Niemel\u00e4Ilkka, editors, Logic Programming and Nonmonotonic Reasoning, 7th\n                            International Conference, LPNMR 2004, Fort Lauderdale, FL, USA, January\n                            6-8, 2004, Proceedings, volume 2923 of Lecture Notes in Computer\n                            Science, 2004, pp. 346\u2013350. Springer. doi: 10.1007\/978-3-540-24609-1_32.\n                            URL https:\/\/doi.org\/10.1007\/978-3-540-24609-1_3","DOI":"10.1007\/978-3-540-24609-1_32"},{"issue":"1","key":"ref050","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0004-3702(86)90028-7","volume":"28","author":"Lifschitz V.","year":"1986","journal-title":"Artif Intell"},{"key":"ref051","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00186-8"},{"key":"ref052","volume-title":"Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012","author":"Liu G.","year":"2012"},{"key":"ref053","doi-asserted-by":"crossref","unstructured":"ManquinhoV.M., Marques SilvaJ.P. and PlanesJ.,\n                            Algorithms for weighted boolean optimization. In KullmannOliver, editor,\n                            Proceedings of Theory and Applications of Satisfiability Testing, SAT\n                            2009 volume 5584 of Lecture Notes in Computer Science, 2009, pp.\n                            495\u2013508. Springer. doi: 10.1007\/978-3-642-02777-2_45. URL\n                            http:\/\/dx.doi.org\/10.1007\/978-3-642-02777-2_4","DOI":"10.1007\/978-3-642-02777-2_45"},{"issue":"6","key":"ref054","first-page":"841","volume":"14","author":"Maratea M.","year":"2014","journal-title":"TPLP"},{"key":"ref055","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/978-3-642-60085-2_17","volume-title":"The Logic Programming Paradigm \u2013 A 25-Year Perspective","author":"Marek V.W.","year":"1999"},{"key":"ref056","first-page":"211","volume-title":"Hans Kleine B\u00fcning and Xishun Zhao, editors, Theory and Applications of Satisfiability Testing - SAT 11th International Conference, SAT Guangzhou, China, May 12-15, Proceedings","author":"Mari\u00ebn M.","year":"2008"},{"issue":"6","key":"ref057","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.datak.2010.01.005","volume":"69","author":"Marileo M.C.","year":"2010","journal-title":"Data Knowl Eng"},{"key":"ref058","doi-asserted-by":"crossref","unstructured":"Marques-SilvaJ. and ManquinhoV.M., Towards more\n                            effective unsatisfiability-based maximum satisfiability algorithms. In\n                            B\u00fcningHans Kleine and ZhaoXishun, editors, Proceedings of Theory and\n                            Applications of Satisfiability Testing, SAT 2008, volume 4996 of Lecture\n                            Notes in Computer Science, 2008, pp. 225\u2013230. Springer. doi:\n                            10.1007\/978-3-540-79719-7_21. URL\n                            http:\/\/dx.doi.org\/10.1007\/978-3-540-79719-7_2","DOI":"10.1007\/978-3-540-79719-7_21"},{"key":"ref059","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1109\/DATE.2008.4484715","volume-title":"Design, Automation and Test in Europe, DATE 2008","author":"Marques-Silva J.","year":"2008"},{"issue":"1","key":"ref060","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"McCarthy J.","year":"1980","journal-title":"Artif Intell"},{"key":"ref061","doi-asserted-by":"crossref","unstructured":"MorgadoA., DodaroC. and Marques-SilvaJ., Core-Guided\n                            MaxSAT with Soft Cardinality Constraints. In Proceedings of Principles\n                            and Practice of Constraint Programming - 20th International Conference,\n                            CP 2014, 2014, pp. 564\u2013573, Lyon, France,\n                            Springer.","DOI":"10.1007\/978-3-319-10428-7_41"},{"key":"ref062","unstructured":"NadelA., Boosting minimal unsatisfiable core\n                            extraction. In BloemRoderick and SharyginaNatasha, editors, Proceedings\n                            of 10th International Conference on Formal Methods in Computer-Aided\n                            Design, FMCAD 2010, 2010, pp. 221\u2013229. IEEE. URL\n                            http:\/\/ieeexplore.ieee.org\/xpls\/abs_all.jsp?arnumber=5770953"},{"key":"ref063","first-page":"27","volume":"9","author":"Nadel A.","year":"2014","journal-title":"JSAT"},{"key":"ref064","unstructured":"NarodytskaNina and BacchusF., Maximum satisfiability\n                            using core-guided maxsat resolution. In BrodleyCarla E. and StonePeter,\n                            editors, Proceedings of the Twenty- Eighth AAAI Conference on Artificial\n                            Intelligence, July 27 - 31, 2014, Qu\u00e9bec City, Qu\u00e9bec, Canada, 2014, pp.\n                            2717\u20132723. AAAI Press. URL\n                            http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI14\/paper\/view\/8513"},{"key":"ref065","doi-asserted-by":"crossref","unstructured":"NguyenV., ObermeierP., SonT.C., SchaubT. and YeohW.,\n                            Generalized target assignment and path finding using answer set\n                            programming. In SierraCarles, editor, Proceedings of the Twenty-Sixth\n                            International Joint Conference on Artificial Intelligence, IJCAI 2017,\n                            Melbourne, Australia, August 19-25, 2017, 2017, pp. 1216\u20131223.\n                            ijcai.org. doi: 10.24963\/ijcai.2017\/169. URL\n                            https:\/\/doi.org\/10.24963\/ijcai.2017\/16","DOI":"10.24963\/ijcai.2017\/169"},{"issue":"3","key":"ref066","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"Niemel\u00e4 I.","year":"1999","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3","key":"ref067","first-page":"361","volume":"12","author":"Ricca F.","year":"2012","journal-title":"TPLP"}],"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-180119","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/IA-180119","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/IA-180119","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:51:32Z","timestamp":1777459892000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/IA-180119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,1]]},"references-count":67,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1,1]]}},"alternative-id":["10.3233\/IA-180119"],"URL":"https:\/\/doi.org\/10.3233\/ia-180119","relation":{},"ISSN":["1724-8035","2211-0097"],"issn-type":[{"value":"1724-8035","type":"print"},{"value":"2211-0097","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,1]]}}}