Preference-Based Query Answering in Probabilistic Datalog+/–  Ontologies

Autores
Lukasiewicz, Thomas; Martinez, Maria Vanina; Simari, Gerardo I.; Tifrea Marciuska, Oana
Año de publicación
2015
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
The incorporation of preferences into information systems, such as databases, has recently seen a surge in interest, mainly fueled by the revolution in Web data availability. Modeling the preferences of a user on the Web has also increasingly become appealing to many companies since the explosion of popularity of social media. The other surge in interest is in modeling uncertainty in these domains, since uncertainty can arise due to many uncontrollable factors. In this paper, we propose an extension of the Datalog+/- family of ontology languages with two models: one representing user preferences and one representing the (probabilistic) uncertainty with which inferences are made. Assuming that more probable answers are in general more preferable, one asks how to rank answers to a user´s queries, since the preference model may be in conflict with the preferences induced by the probabilistic model, the need thus arises for preference combination operators. We propose four specific operators and study their semantic and computational properties. We also provide an algorithm for ranking answers based on the iteration of the well-known skyline answers to a query and show that, under certain conditions, it runs in polynomial time in the data complexity. Furthermore, we report on an implementation and experimental results.
Fil: Lukasiewicz, Thomas. University of Oxford; Reino Unido
Fil: Martinez, Maria Vanina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. University of Oxford; Reino Unido
Fil: Simari, Gerardo I.. University of Oxford; Reino Unido
Fil: Tifrea Marciuska, Oana. University of Oxford; Reino Unido
Materia
Probabilistic Datalog+/- Ontologies
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/44174
Acceder
id CONICETDig_09200a3368fa434d7e3ed6c7f7dc030b
oai_identifier_str oai:ri.conicet.gov.ar:11336/44174
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Preference-Based Query Answering in Probabilistic Datalog+/–  OntologiesLukasiewicz, ThomasMartinez, Maria VaninaSimari, Gerardo I.Tifrea Marciuska, OanaProbabilistic Datalog+/- Ontologieshttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1The incorporation of preferences into information systems, such as databases, has recently seen a surge in interest, mainly fueled by the revolution in Web data availability. Modeling the preferences of a user on the Web has also increasingly become appealing to many companies since the explosion of popularity of social media. The other surge in interest is in modeling uncertainty in these domains, since uncertainty can arise due to many uncontrollable factors. In this paper, we propose an extension of the Datalog+/- family of ontology languages with two models: one representing user preferences and one representing the (probabilistic) uncertainty with which inferences are made. Assuming that more probable answers are in general more preferable, one asks how to rank answers to a user´s queries, since the preference model may be in conflict with the preferences induced by the probabilistic model, the need thus arises for preference combination operators. We propose four specific operators and study their semantic and computational properties. We also provide an algorithm for ranking answers based on the iteration of the well-known skyline answers to a query and show that, under certain conditions, it runs in polynomial time in the data complexity. Furthermore, we report on an implementation and experimental results.Fil: Lukasiewicz, Thomas. University of Oxford; Reino UnidoFil: Martinez, Maria Vanina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. University of Oxford; Reino UnidoFil: Simari, Gerardo I.. University of Oxford; Reino UnidoFil: Tifrea Marciuska, Oana. University of Oxford; Reino UnidoSpringer Verlag Berlín2015-06info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/44174Lukasiewicz, Thomas; Martinez, Maria Vanina; Simari, Gerardo I.; Tifrea Marciuska, Oana; Preference-Based Query Answering in Probabilistic Datalog+/–  Ontologies; Springer Verlag Berlín; Journal on Data Semantics; 4; 2; 6-2015; 81-1011861-20321861-2040CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/http://link.springer.com/article/10.1007/s13740-014-0040-xinfo:eu-repo/semantics/altIdentifier/doi/10.1007/s13740-014-0040-xinfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-15T14:23:24Zoai:ri.conicet.gov.ar:11336/44174instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-15 14:23:25.075CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Preference-Based Query Answering in Probabilistic Datalog+/–  Ontologies
title Preference-Based Query Answering in Probabilistic Datalog+/–  Ontologies
spellingShingle Preference-Based Query Answering in Probabilistic Datalog+/–  Ontologies
Lukasiewicz, Thomas
Probabilistic Datalog+/- Ontologies
title_short Preference-Based Query Answering in Probabilistic Datalog+/–  Ontologies
title_full Preference-Based Query Answering in Probabilistic Datalog+/–  Ontologies
title_fullStr Preference-Based Query Answering in Probabilistic Datalog+/–  Ontologies
title_full_unstemmed Preference-Based Query Answering in Probabilistic Datalog+/–  Ontologies
title_sort Preference-Based Query Answering in Probabilistic Datalog+/–  Ontologies
dc.creator.none.fl_str_mv Lukasiewicz, Thomas
Martinez, Maria Vanina
Simari, Gerardo I.
Tifrea Marciuska, Oana
author Lukasiewicz, Thomas
author_facet Lukasiewicz, Thomas
Martinez, Maria Vanina
Simari, Gerardo I.
Tifrea Marciuska, Oana
author_role author
author2 Martinez, Maria Vanina
Simari, Gerardo I.
Tifrea Marciuska, Oana
author2_role author
author
author
dc.subject.none.fl_str_mv Probabilistic Datalog+/- Ontologies
topic Probabilistic Datalog+/- Ontologies
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv The incorporation of preferences into information systems, such as databases, has recently seen a surge in interest, mainly fueled by the revolution in Web data availability. Modeling the preferences of a user on the Web has also increasingly become appealing to many companies since the explosion of popularity of social media. The other surge in interest is in modeling uncertainty in these domains, since uncertainty can arise due to many uncontrollable factors. In this paper, we propose an extension of the Datalog+/- family of ontology languages with two models: one representing user preferences and one representing the (probabilistic) uncertainty with which inferences are made. Assuming that more probable answers are in general more preferable, one asks how to rank answers to a user´s queries, since the preference model may be in conflict with the preferences induced by the probabilistic model, the need thus arises for preference combination operators. We propose four specific operators and study their semantic and computational properties. We also provide an algorithm for ranking answers based on the iteration of the well-known skyline answers to a query and show that, under certain conditions, it runs in polynomial time in the data complexity. Furthermore, we report on an implementation and experimental results.
Fil: Lukasiewicz, Thomas. University of Oxford; Reino Unido
Fil: Martinez, Maria Vanina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. University of Oxford; Reino Unido
Fil: Simari, Gerardo I.. University of Oxford; Reino Unido
Fil: Tifrea Marciuska, Oana. University of Oxford; Reino Unido
description The incorporation of preferences into information systems, such as databases, has recently seen a surge in interest, mainly fueled by the revolution in Web data availability. Modeling the preferences of a user on the Web has also increasingly become appealing to many companies since the explosion of popularity of social media. The other surge in interest is in modeling uncertainty in these domains, since uncertainty can arise due to many uncontrollable factors. In this paper, we propose an extension of the Datalog+/- family of ontology languages with two models: one representing user preferences and one representing the (probabilistic) uncertainty with which inferences are made. Assuming that more probable answers are in general more preferable, one asks how to rank answers to a user´s queries, since the preference model may be in conflict with the preferences induced by the probabilistic model, the need thus arises for preference combination operators. We propose four specific operators and study their semantic and computational properties. We also provide an algorithm for ranking answers based on the iteration of the well-known skyline answers to a query and show that, under certain conditions, it runs in polynomial time in the data complexity. Furthermore, we report on an implementation and experimental results.
publishDate 2015
dc.date.none.fl_str_mv 2015-06
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/44174
Lukasiewicz, Thomas; Martinez, Maria Vanina; Simari, Gerardo I.; Tifrea Marciuska, Oana; Preference-Based Query Answering in Probabilistic Datalog+/–  Ontologies; Springer Verlag Berlín; Journal on Data Semantics; 4; 2; 6-2015; 81-101
1861-2032
1861-2040
CONICET Digital
CONICET
url http://hdl.handle.net/11336/44174
identifier_str_mv Lukasiewicz, Thomas; Martinez, Maria Vanina; Simari, Gerardo I.; Tifrea Marciuska, Oana; Preference-Based Query Answering in Probabilistic Datalog+/–  Ontologies; Springer Verlag Berlín; Journal on Data Semantics; 4; 2; 6-2015; 81-101
1861-2032
1861-2040
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://link.springer.com/article/10.1007/s13740-014-0040-x
info:eu-repo/semantics/altIdentifier/doi/10.1007/s13740-014-0040-x
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer Verlag Berlín
publisher.none.fl_str_mv Springer Verlag Berlín
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1846082643837321216
score 13.22299

Publicaciones similares