{"type":"ScholarlyArticle","title":"On the Integration of CP-nets in ASPRIN","authors":[{"name":"Mario Alviano","slug":"mario-alviano","given":"Mario","family":"Alviano","affiliation":"University of Calabria , Italy"},{"name":"Javier Romero","slug":"javier-romero","given":"Javier","family":"Romero","affiliation":"University of Potsdam , Germany"},{"name":"Torsten Schaub","slug":"torsten-schaub","given":"Torsten","family":"Schaub","affiliation":"University of Potsdam , Germany"}],"abstract":"Conditional preference networks (CP-nets) express qualitative preferences over features of interest.A Boolean CP-net can express that a feature is preferable under some conditions, as long as all other features have the same value.This is often a convenient representation, but sometimes one would also like to express a preference for maximizing a set of features, or some other objective function on the features of interest.ASPRIN is a flexible framework for preferences in ASP, where one can mix heterogeneous preference relations, and this paper reports on the integration of Boolean CP-nets.In general, we extend ASPRIN with a preference program for CP-nets in order to compute most preferred answer sets via an iterative algorithm.For the specific case of acyclic CP-nets, we provide an approximation by partially ordered set preferences, which are in turn normalized by ASPRIN to take advantage of several highly optimized algorithms implemented by ASP solvers for computing optimal solutions.Finally, we take advantage of a linear-time computable function to address dominance testing for tree-shaped CP-nets.","doi":"10.24963/ijcai.2019/207","url":"https://ijcai.org/proceedings/2019/207","pdf":"https://ijcai.org/proceedings/2019/0207.pdf","markdown":"https://ijcai.org/proceedings/2019/207.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/207","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":207,"pages":{"first":1495,"last":1501},"keywords":["Knowledge Representation and Reasoning: Non-classical Logics for Knowledge Representation","Knowledge Representation and Reasoning: Preference Modelling and Preference-Based Reasoning","Knowledge Representation and Reasoning: Non-monotonic Reasoning"],"videos":[],"references":[{"position":1,"raw":"[Allen et al., 2017] Thomas E. Allen, Judy Goldsmith, Hay- den Elizabeth Justice, Nicholas Mattei, and Kayla Raines. Uniform random generation and dominance testing for cp- nets. J. Artif. Intell. Res., 59:771-813, 2017.","title":"Uniform random generation and dominance testing for cpnets","authors":"Thomas E Allen, Judy Goldsmith, Hayden Elizabeth Justice, Nicholas Mattei, Kayla Raines","year":"2017","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alviano and Dodaro, 2016] Mario Alviano and Carmine Dodaro. Anytime answer set optimization via unsatisfi- able core shrinking. TPLP, 16(5-6):533-551, 2016.","title":"Anytime answer set optimization via unsatisfiable core shrinking","authors":"Mario Alviano, Carmine Dodaro","year":"2016","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Alviano and Dodaro, 2017] Mario Alviano and Carmine Dodaro. Unsatisfiable core shrinking for anytime answer set optimization. In Carles Sierra, editor, Proceedings of the Twenty-Sixth International Joint Conference on Artifi- cial Intelligence, IJCAI 2017, Melbourne, Australia, Au- gust 19-25, 2017, pages 4781-4785. ijcai.org, 2017.","title":"Unsatisfiable core shrinking for anytime answer set optimization","authors":"Mario Alviano, Carmine Dodaro","year":"2017","venue":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017","doi":null,"url":null,"internal_url":"/proceedings/2017/666"},{"position":4,"raw":"[Alviano et al., 2018] Mario Alviano, Javier Romero, and Torsten Schaub. Preference relations by approximation. In Michael Thielscher, Francesca Toni, and Frank Wolter, editors, Principles of Knowledge Representation and Rea- soning: Proceedings of the Sixteenth International Confer- ence, KR 2018, Tempe, Arizona, 30 October -2 November 2018., pages 2-11. AAAI Press, 2018.","title":"Preference relations by approximation","authors":"Mario Alviano, Javier Romero, Torsten Schaub","year":"2018","venue":"Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Andres et al., 2012] Benjamin Andres, Benjamin Kaufmann, Oliver Matheis, and Torsten Schaub. Unsatisfiability-based optimization in clasp. In Agostino Dovier and Vítor Santos Costa, editors, Technical Commu- nications of ICLP 2012, September 4-8, 2012, Budapest, Hungary, volume 17 of LIPIcs, pages 211-221.","title":"Unsatisfiability-based optimization in clasp","authors":"Benjamin Andres, Benjamin Kaufmann, Oliver Matheis, Torsten Schaub","year":"2012","venue":"Technical Communications of ICLP 2012","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bigot et al., 2013] Damien Bigot, Bruno Zanuttini, Hélène Fargier, and Jérôme Mengin. Probabilistic conditional preference networks. In Ann Nicholson and Padhraic Smyth, editors, Proceedings of the Twenty-Ninth Confer- ence on Uncertainty in Artificial Intelligence, UAI 2013, Bellevue, WA, USA, August 11-15, 2013, pages 72-81. AUAI Press, 2013.","title":"Probabilistic conditional preference networks","authors":"Damien Bigot, Bruno Zanuttini, Hélène Fargier, Jérôme Mengin","year":"2013","venue":"Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, UAI 2013","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Boutilier et al., 2004a] Craig Boutilier, Ronen I. Brafman, Carmel Domshlak, Holger H. Hoos, and David Poole. Cp- nets: A tool for representing and reasoning with condi- tional ceteris paribus preference statements. J. Artif. Intell. Res., 21:135-191, 2004.","title":"Cpnets: A tool for representing and reasoning with conditional ceteris paribus preference statements","authors":"Boutilier","year":"2004","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Boutilier et al., 2004b] Craig Boutilier, Ronen I. Brafman, Carmel Domshlak, Holger H. Hoos, and David Poole. Preference-based constrained optimization with cp-nets. Computational Intelligence, 20(2):137-157, 2004.","title":"Preference-based constrained optimization with cp-nets","authors":"Boutilier","year":"2004","venue":"Computational Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Brewka et al., 2003] Gerhard Brewka, Ilkka Niemelä, and Miroslaw Truszczynski. Answer set optimization. In Georg Gottlob and Toby Walsh, editors, IJCAI-03, Pro- ceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August 9-15, 2003, pages 867-872.","title":"Answer set optimization","authors":"Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski","year":"2003","venue":"IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"Morgan Kaufmann, 2003.","title":null,"authors":"Morgan Kaufmann","year":"2003","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Brewka et al., 2015a] Gerhard Brewka, James P. Delgrande, Javier Romero, and Torsten Schaub. Implementing pref- erences with ASPRIN. In Francesco Calimeri, Giovam- battista Ianni, and Miroslaw Truszczynski, editors, Logic Programming and Nonmonotonic Reasoning -13th Inter- national Conference, LPNMR 2015, Lexington, KY, USA, September 27-30, 2015. Proceedings, volume 9345 of Lec- ture Notes in Computer Science, pages 158-172. Springer, 2015.","title":"Implementing preferences with ASPRIN","authors":"Brewka","year":"2015","venue":"Logic Programming and Nonmonotonic Reasoning -13th International Conference, LPNMR 2015","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Brewka et al., 2015b] Gerhard Brewka, James P. Del- grande, Javier Romero, and Torsten Schaub. ASPRIN: Cus- tomizing answer set preferences without a headache. In Blai Bonet and Sven Koenig, editors, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA., pages 1467- 1474. AAAI Press, 2015.","title":"ASPRIN: Customizing answer set preferences without a headache","authors":"Brewka","year":"2015","venue":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Buccafurri et al., 2000] Francesco Buccafurri, Nicola Leone, and Pasquale Rullo. Enhancing Disjunctive Datalog by Constraints. IEEE Trans. Knowl. Data Eng., 12(5):845-860, 2000.","title":"Enhancing Disjunctive Datalog by Constraints","authors":"Francesco Buccafurri, Nicola Leone, Pasquale Rullo","year":"2000","venue":"IEEE Trans. Knowl. Data Eng","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Domshlak et al., 2006] Carmel Domshlak, Steven David Prestwich, Francesca Rossi, Kristen Brent Venable, and Toby Walsh. Hard and soft constraints for reasoning about qualitative conditional preferences. J. Heuristics, 12(4- 5):263-285, 2006.","title":"Hard and soft constraints for reasoning about qualitative conditional preferences","authors":"Carmel Domshlak, Steven David Prestwich, Francesca Rossi, Kristen Brent Venable, Toby Walsh","year":"2006","venue":"J. Heuristics","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gebser et al., 2008] Martin Gebser, Jörg Pührer, Torsten Schaub, and Hans Tompits. A meta-programming tech- nique for debugging answer-set programs. In Dieter Fox and Carla P. Gomes, editors, Proceedings of the Twenty- Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17, 2008, pages 448-453. AAAI Press, 2008.","title":"A meta-programming technique for debugging answer-set programs","authors":"Gebser","year":"2008","venue":"Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Gebser et al., 2013] Martin Gebser, Benjamin Kaufmann, Javier Romero, Ramón Otero, Torsten Schaub, and Philipp Wanko. Domain-specific heuristics in answer set pro- gramming. In Marie desJardins and Michael L. Littman, editors, Proceedings of the Twenty-Seventh AAAI Confer- ence on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA., pages 350-356. AAAI Press, 2013.","title":"Domain-specific heuristics in answer set programming","authors":"Martin Gebser, Benjamin Kaufmann, Javier Romero, Ramón Otero, Torsten Schaub, Philipp Wanko","year":"2013","venue":"Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gebser et al., 2015] Martin Gebser, Amelia Harrison, Roland Kaminski, Vladimir Lifschitz, and Torsten Schaub. Abstract gringo. TPLP, 15(4-5):449-463, 2015.","title":"Abstract gringo","authors":"Martin Gebser, Amelia Harrison, Roland Kaminski, Vladimir Lifschitz, Torsten Schaub","year":"2015","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Gelfond and Lifschitz, 1991] Michael Gelfond and Vladimir Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Comput., 9(3/4):365-386, 1991.","title":"Classical Negation in Logic Programs and Disjunctive Databases","authors":"Michael Gelfond, Vladimir Lifschitz","year":"1991","venue":"New Generation Comput","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Goldsmith et al., 2008] Judy Goldsmith, Jérôme Lang, Miroslaw Truszczynski, and Nic Wilson. The compu- tational complexity of dominance and consistency in cp- nets. J. Artif. Intell. Res., 33:403-432, 2008.","title":"The computational complexity of dominance and consistency in cpnets","authors":"Judy Goldsmith, Jérôme Lang, Miroslaw Truszczynski, Nic Wilson","year":"2008","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Rosa et al., 2010] Emanuele Di Rosa, Enrico Giunchiglia, and Marco Maratea. Solving satisfiability problems with preferences. Constraints, 15(4):485-515, 2010.","title":"Solving satisfiability problems with preferences","authors":"Emanuele Di, Rosa, Enrico Giunchiglia, Marco Maratea","year":"2010","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Simons et al., 2002] Patrik Simons, Ilkka Niemelä, and Timo Soininen. Extending and implementing the stable model semantics. Artif. Intell., 138(1-2):181-234, 2002.","title":"Extending and implementing the stable model semantics","authors":"Simons","year":"2002","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[van Harmelen et al., 2008] Frank van Harmelen, Vladimir Lifschitz, and Bruce W. Porter, editors. Handbook of Knowledge Representation, volume 3 of Foundations of Artificial Intelligence. Elsevier, 2008.","title":"Handbook of Knowledge Representation, volume 3 of Foundations of Artificial Intelligence","authors":"Van Harmelen","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Yaman and desJardins, 2007] Fusun Yaman and Marie des- Jardins. More-or-less cp-networks. In Ronald Parr and Linda C. van der Gaag, editors, UAI 2007, Proceedings of the Twenty-Third Conference on Uncertainty in Artificial Intelligence, Vancouver, BC, Canada, July 19-22, 2007, pages 434-441. AUAI Press, 2007.","title":"Fusun Yaman and Marie des-Jardins. More-or-less cp-networks","authors":"Yaman, Desjardins","year":"2007","venue":"UAI 2007, Proceedings of the Twenty-Third Conference on Uncertainty in Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}