{"type":"ScholarlyArticle","title":"Query Answering in Ontologies under Preference Rankings","authors":[{"name":"İsmail İlkan Ceylan","slug":"ismail-ilkan-ceylan","given":"İsmail İlkan","family":"Ceylan","affiliation":"Theoretical Computer Science , Technische Universität Dresden , Germany"},{"name":"Thomas Lukasiewicz","slug":"thomas-lukasiewicz","given":"Thomas","family":"Lukasiewicz","affiliation":"Department of Computer Science , University of Oxford , UK"},{"name":"Rafael Peñaloza","slug":"rafael-penaloza","given":"Rafael","family":"Peñaloza","affiliation":"KRDB Research Centre , Free University of Bozen-Bolzano , Italy"},{"name":"Oana Tifrea-Marciuska","slug":"oana-tifrea-marciuska","given":"Oana","family":"Tifrea-Marciuska","affiliation":"The Alan Turing Institute , London , UK"}],"abstract":"We present an ontological framework, based on preference rankings, that allows users to express their preferences between the knowledge explicitly available in the ontology. Using this formalism, the answers for a given query to an ontology can be ranked by preference, allowing users to retrieve the most preferred answers only. We provide a host of complexity results for the main computational tasks in this framework, for the general case, and for EL and DL-Lite_core as underlying ontology languages.","doi":"10.24963/ijcai.2017/131","url":"https://ijcai.org/proceedings/2017/131","pdf":"https://ijcai.org/proceedings/2017/0131.pdf","markdown":"https://ijcai.org/proceedings/2017/131.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/131","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Knowledge Representation, Reasoning, and Logic","track":"Main track","number":131,"pages":{"first":943,"last":949},"keywords":["Knowledge Representation, Reasoning, and Logic: Logics for Knowledge Representation","Knowledge Representation, Reasoning, and Logic: Description Logics and Ontologies","Knowledge Representation, Reasoning, and Logic: Preference modelling and preference-based reasoning","Knowledge Representation, Reasoning, and Logic: Computational Complexity of Reasoning"],"videos":[],"references":[{"position":1,"raw":"[Amor et al., 2015] Nahla Ben Amor, Didier Dubois, Héla Gouider, and Henri Prade. Possibilistic conditional preference networks. In Proc. ECSQARU, pp. 36-46, 2015.","title":"Possibilistic conditional preference networks","authors":"Amor","year":"2015","venue":"Proc. ECSQARU","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Artale et al., 2009] Alessandro Artale, Diego Calvanese, Roman Kontchakov, and Michael Zakharyaschev. The DL-Lite family and relations. J. Artif. Intell. Res., 36:1-69, 2009.","title":"The DL-Lite family and relations","authors":"Alessandro Artale, Diego Calvanese, Roman Kontchakov, Michael Zakharyaschev","year":"2009","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baader et al., 2005] Franz Baader, Sebastian Brandt, and Carsten Lutz. Pushing the EL envelope. In Proc. IJCAI, 2005.","title":"Pushing the EL envelope","authors":"Franz Baader, Sebastian Brandt, Carsten Lutz","year":"2005","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Baader et al., 2007] Franz Baader, Diego Calvanese, Deborah L. McGuinness, Daniele Nardi, and Peter F. Patel-Schneider (eds.). The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, 2nd edition, 2007.","title":"The Description Logic Handbook: Theory, Implementation, and Applications","authors":null,"year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Ben Amor et al., 2003] Nahla Ben Amor, Salem Benferhat, and Khaled Mellouli. Anytime propagation algorithm for min-based possibilistic graphs. Soft Comput., 8(2):150-161, 2003.","title":"Anytime propagation algorithm for min-based possibilistic graphs","authors":"Ben Amor","year":"2003","venue":"Soft Comput","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Ben Amor et al., 2014] Nahla Ben Amor, Didier Dubois, Héla Gouider, and Henri Prade. Possibilistic networks: A new setting for modeling preferences. In Proc. SUM, pp. 1-7, 2014.","title":"Possibilistic networks: A new setting for modeling preferences","authors":"Ben Amor","year":"2014","venue":"Proc. SUM","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Benferhat et al., 1999] Salem Benferhat, Didier Dubois, Laurent Garcia, and Henri Prade. Possibilistic logic bases and possibilis- tic graphs. In Proc. UAI, pp. 57-64, 1999.","title":"Possibilistic logic bases and possibilistic graphs","authors":"Benferhat","year":"1999","venue":"Proc. UAI","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Benferhat et al., 2001] Salem Benferhat, Didier Dubois, and Henri Prade. Towards a possibilistic logic handling of preferences. Appl. Intell., 14(3):303-317, 2001.","title":"Towards a possibilistic logic handling of preferences","authors":"Benferhat","year":"2001","venue":"Appl. Intell","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Benferhat et al., 2002] Salem Benferhat, Didier Dubois, Laurent Garcia, and Henri Prade. On the transformation between pos- sibilistic logic bases and possibilistic causal networks. Int. J. Ap- prox. Reason., 29(2):135-173, 2002.","title":"On the transformation between possibilistic logic bases and possibilistic causal networks","authors":"Benferhat","year":"2002","venue":"Int. J. Approx. Reason","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Borgelt and Kruse, 2003] Christian Borgelt and Rudolf Kruse. Op- erations and evaluation measures for learning possibilistic graph- ical models. Artif. Intell., 148(1/2):385-418, 2003.","title":"Christian Borgelt and Rudolf Kruse. Operations and evaluation measures for learning possibilistic graphical models","authors":"Kruse Borgelt","year":"2003","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Borgwardt et al., 2016] Stefan Borgwardt, Bettina Fazzinga, Thomas Lukasiewicz, Akanksha Shrivastava, and Oana Tifrea- Marciuska. Preferential query answering over the Semantic Web with possibilistic networks. In Proc. IJCAI, pp. 994-1000, 2016.","title":"Preferential query answering over the Semantic Web with possibilistic networks","authors":"Stefan Borgwardt, Bettina Fazzinga, Thomas Lukasiewicz, Akanksha Shrivastava, Oana Tifrea-Marciuska","year":"2016","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/145"},{"position":12,"raw":"[Boutilier et al., 2004] Craig Boutilier, Ronen I. Brafman, Carmel Domshlak, Holger H. Hoos, and David Poole. CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res., 21:135-191, 2004.","title":"CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements","authors":"Craig Boutilier, Ronen I Brafman, Carmel Domshlak, H Holger, David Hoos, Poole","year":"2004","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Brini et al., 2005] Asma H. Brini, Mohand Boughanem, and Di- dier Dubois. A model for information retrieval based on possi- bilistic networks. In Proc. SPIRE, pp. 271-282, 2005.","title":"A model for information retrieval based on possibilistic networks","authors":"H Asma, Mohand Brini, Didier Boughanem, Dubois","year":"2005","venue":"Proc. SPIRE","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Calvanese et al., 2007] Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Autom. Reasoning, 39(3), 2007.","title":"Tractable reasoning and efficient query answering in description logics: The DL-Lite family","authors":"Calvanese","year":"2007","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Ceylan and Peñaloza, 2015] İsmail İlkan Ceylan and Rafael Peñaloza. Probabilistic query answering in the Bayesian descrip- tion logic BEL. In Proc. SUM, pp. 1-15, 2015.","title":"İsmail İlkan Ceylan and Rafael Peñaloza. Probabilistic query answering in the Bayesian description logic BEL","authors":"Peñaloza Ceylan","year":"2015","venue":"Proc. SUM","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Ceylan and Peñaloza, 2017] İsmail İlkan Ceylan and Rafael Peñaloza. The Bayesian ontology language BEL. J. Autom. Rea- soning, 58(1):67-95, 2017.","title":"İsmail İlkan Ceylan and Rafael Peñaloza. The Bayesian ontology language BEL","authors":"Peñaloza Ceylan","year":"2017","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Chandra and Merlin, 1977] Ashok K. Chandra and Philip M. Mer- lin. Optimal implementation of conjunctive queries in relational data bases. In Proc. STOC, pp. 77-90, 1977.","title":"Optimal implementation of conjunctive queries in relational data bases","authors":"K Ashok, Philip M Chandra, Merlin","year":"1977","venue":"Proc. STOC","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"['Amato et al., 2008] Claudia d'Amato, Nicola Fanizzi, and Thomas Lukasiewicz. Tractable reasoning with Bayesian de- scription logics. In Proc. SUM, pp. 146-159, 2008.","title":"Tractable reasoning with Bayesian description logics","authors":"Amato","year":"2008","venue":"Proc. SUM","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Darwiche, 2009] Adnan Darwiche. Modeling and Reasoning with Bayesian Networks. Cambridge University Press, 2009.","title":"Modeling and Reasoning with Bayesian Networks","authors":"Adnan Darwiche","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Di Noia et al., 2013] Tommaso Di Noia, Thomas Lukasiewicz, and Gerardo I. Simari. Reasoning with semantic-enabled qual- itative preferences. In Proc. SUM, pp. 374-386, 2013.","title":"Reasoning with semantic-enabled qualitative preferences","authors":"Tommaso Di Noia, Thomas Lukasiewicz, Gerardo I Simari","year":"2013","venue":"Proc. SUM","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Di Noia et al., 2015] Tommaso Di Noia, Thomas Lukasiewicz, Maria Vanina Martinez, Gerardo I. Simari, and Oana Tifrea- Marciuska. Combining existential rules with the power of CP- theories. In Proc. IJCAI, pp. 2918-2925, 2015.","title":"Combining existential rules with the power of CPtheories","authors":"Tommaso Di Noia, Thomas Lukasiewicz, Maria Vanina Martinez, Gerardo I Simari, Oana Tifrea-Marciuska","year":"2015","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Dubois and Prade, 2004] Didier Dubois and Henri Prade. Possi- bilistic logic: A retrospective and prospective view. Fuzzy Sets and Systems, 144(1):3-23, 2004.","title":"Possibilistic logic: A retrospective and prospective view","authors":"Prade Dubois, Didier Dubois, Henri Prade","year":"2004","venue":"Fuzzy Sets and Systems","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Dubois et al., 2006] Didier Dubois, Jérôme Mengin, and Henri Prade. Possibilistic uncertainty and fuzzy features in description logic: A preliminary discussion. In Fuzzy Logic and the Semantic Web, Capturing Intelligence, pages 101-114. Elsevier, 2006.","title":"Possibilistic uncertainty and fuzzy features in description logic: A preliminary discussion","authors":"Didier Dubois, Jérôme Mengin, Henri Prade","year":"2006","venue":"Fuzzy Logic and the Semantic Web, Capturing Intelligence","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Dubois et al., 2013] Didier Dubois, Henri Prade, and Fayc ¸al Touazi. Conditional preference nets and possibilistic logic. In Proc. ECSQUARU, pp. 181-193, 2013.","title":"Conditional preference nets and possibilistic logic","authors":"Didier Dubois, Henri Prade, Touazi","year":"2013","venue":"Proc. ECSQUARU","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Giese et al., 2015] Martin Giese, Ahmet Soylu, Guillermo Vega- Gorgojo, Arild Waaler, Peter Haase, Ernesto Jiménez-Ruiz, Da- vide Lanti, Martín Rezk, Guohui Xiao, Özgür L. Özc ¸ep, and Ric- cardo Rosati. Optique: Zooming in on Big Data. IEEE Computer, 48(3):60-67, 2015.","title":"and Riccardo Rosati. Optique: Zooming in on Big Data","authors":"Martin Giese, Ahmet Soylu, Guillermo Vega-Gorgojo, Arild Waaler, Peter Haase, Ernesto Jiménez-Ruiz, Davide Lanti, Martín Rezk, Guohui Xiao, L Özgür, Özc","year":"2015","venue":"IEEE Computer","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[HadjAli et al., 2011] Allel HadjAli, Souhila Kaci, and Henri Prade. Database preference queries-A possibilistic logic ap- proach with symbolic priorities. AMAI, 63(3/4): 357-383, 2011.","title":"Database preference queries-A possibilistic logic approach with symbolic priorities","authors":"Hadjali","year":"2011","venue":"AMAI","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Hollunder, 1995] Bernhard Hollunder. An alternative proof method for possibilistic logic and its application to terminolog- ical logics. Int. J. Approx. Reason., 12(2):85-109, 1995.","title":"An alternative proof method for possibilistic logic and its application to terminological logics","authors":"Bernhard Hollunder, Hollunder","year":"1995","venue":"Int. J. Approx. Reason","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Joachims, 2002] Thorsten Joachims. Optimizing search engines using clickthrough data. In Proc. SIGKDD, pp. 133-142, 2002.","title":"Optimizing search engines using clickthrough data","authors":"Thorsten Joachims","year":"2002","venue":"Proc. SIGKDD","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Krentel, 1988] Mark W. Krentel. The complexity of optimization problems. J. Comput. Syst. Sci., 36(3):490-509, 1988.","title":"The complexity of optimization problems","authors":"Mark W Krentel","year":"1988","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Liau and Yao, 2001] Churn-Jung Liau and Y. Y. Yao. Information retrieval by possibilistic reasoning. In Proc. DEXA, 2001.","title":"Information retrieval by possibilistic reasoning","authors":"Yao ; Churn-Jung Liau, Y Y Liau, Yao","year":"2001","venue":"Proc. DEXA","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Lukasiewicz and Schellhase, 2007] Thomas Lukasiewicz and Jörg Schellhase. Variable-strength conditional preferences for ranking objects in ontologies. J. Web Sem., 5(3):180-194, 2007.","title":"Variable-strength conditional preferences for ranking objects in ontologies","authors":"Schellhase Lukasiewicz, Thomas Lukasiewicz, Jörg Schellhase","year":"2007","venue":"J. Web Sem","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Lukasiewicz et al., 2013] Thomas Lukasiewicz, Maria V. Mar- tinez, and Gerard I. Simari. Preference-based query answering in Datalog+/-ontologies. In Proc. IJCAI, pp. 501-518, 2013.","title":"Preference-based query answering in Datalog+/-ontologies","authors":"Thomas Lukasiewicz, Maria V Martinez, Gerard I Simari","year":"2013","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/155"},{"position":33,"raw":"[Lukasiewicz et al., 2014] Thomas Lukasiewicz, Maria Vanina Martinez, and Gerardo I. Simari. Probabilistic preference logic networks. In Proc. ECAI, pp. 561-566, 2014.","title":"Probabilistic preference logic networks","authors":"Thomas Lukasiewicz, Maria Vanina Martinez, Gerardo I Simari","year":"2014","venue":"Proc. ECAI","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Pearl, 1988] Judea Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. 1988.","title":"Judea Pearl","authors":"Pearl","year":"1988","venue":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Poole, 1997] David Poole. The independent choice logic for mod- elling multiple agents under uncertainty. Artif. Intell., 94, 1997.","title":"The independent choice logic for modelling multiple agents under uncertainty","authors":"David Poole","year":"1997","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Qi et al., 2011] Guilin Qi, Qiu Ji, Jeff Z. Pan, and Jianfeng Du. Extending description logics with uncertainty reasoning in possi- bilistic logic. Int. J. Intell. Syst., 26(4):353-381, 2011.","title":"Extending description logics with uncertainty reasoning in possibilistic logic","authors":"Guilin Qi, Qiu Ji, Jeff Z Pan, Jianfeng Du","year":"2011","venue":"Int. J. Intell. Syst","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Rosati, 2007] Riccardo Rosati. On conjunctive query answering in EL. In Proc. DL, CEUR-WS.org, 2007.","title":"On conjunctive query answering in EL","authors":"Riccardo Rosati","year":"2007","venue":"Proc. DL, CEUR-WS.org","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Siberski et al., 2006] Wolf Siberski, Jeff Z. Pan, and Uwe Thaden. Querying the Semantic Web with preferences. In Proc. ISWC, pp. 612-624, 2006.","title":"Querying the Semantic Web with preferences","authors":"Wolf Siberski, Jeff Z Pan, Uwe Thaden","year":"2006","venue":"Proc. ISWC","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Suciu et al., 2011] Dan Suciu, Dan Olteanu, Christopher Ré, and Christoph Koch. Probabilistic Databases. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, 2011.","title":"Probabilistic Databases","authors":"Dan Suciu, Dan Olteanu, Christopher Ré, Christoph Koch","year":"2011","venue":"Synthesis Lectures on Data Management","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}