Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Handling qualitative conditional preferencequeries in SPARQL: Possibilistic logic approach

View through CrossRef
AbstractBecause of the rise in data volume of knowledge bases that are being published as a result of Open Data initiatives, new approaches are required to assist users in locating the items that most closely matches their preference criteria. In many approaches, the user is called to supply quantitative weights that may not be known in advance to manage the ranking of results.Contrary to the quantitative technique, preference criteria are sometimes more intuitive and can be conveyed more readily under the qualitative approach. We are interested in this paper to the problem of evaluating SPARQL qualitative preference queries over user preferences in SPARQL. Many approaches address this problem based on different frameworks as CP-net, skyline, fuzzy set and top-k. This article outlines a novel approach for dealing with SPARQL preference queries, where preferences are represented through symbolic weights using the possibilistic logic framework. It is possible to manage symbolic weights without using numerical values where a partial ordering is used instead. This approach is compared to numerous other approaches, including those based on skylines, fuzzy sets, and CP-nets.
Springer Science and Business Media LLC
Title: Handling qualitative conditional preferencequeries in SPARQL: Possibilistic logic approach
Description:
AbstractBecause of the rise in data volume of knowledge bases that are being published as a result of Open Data initiatives, new approaches are required to assist users in locating the items that most closely matches their preference criteria.
In many approaches, the user is called to supply quantitative weights that may not be known in advance to manage the ranking of results.
Contrary to the quantitative technique, preference criteria are sometimes more intuitive and can be conveyed more readily under the qualitative approach.
We are interested in this paper to the problem of evaluating SPARQL qualitative preference queries over user preferences in SPARQL.
Many approaches address this problem based on different frameworks as CP-net, skyline, fuzzy set and top-k.
This article outlines a novel approach for dealing with SPARQL preference queries, where preferences are represented through symbolic weights using the possibilistic logic framework.
It is possible to manage symbolic weights without using numerical values where a partial ordering is used instead.
This approach is compared to numerous other approaches, including those based on skylines, fuzzy sets, and CP-nets.

Related Results

Handling qualitative conditional preference queries in SPARQL: possibilistic logic approach
Handling qualitative conditional preference queries in SPARQL: possibilistic logic approach
Purpose The purpose of this paper is to address the need for new approaches in locating items that closely match user preference criteria due to the rise in data volume of knowledg...
Creating RESTful APIs over SPARQL endpoints using RAMOSE
Creating RESTful APIs over SPARQL endpoints using RAMOSE
Semantic Web technologies are widely used for storing RDF data and making them available on the Web through SPARQL endpoints, queryable using the SPARQL query language. While the u...
Three-valued possibilistic networks
Three-valued possibilistic networks
Possibilistic networks are graphical models that compactly encode joint possibility distributions. This paper studies a new form of possibilistic graphical models called three-valu...
Mastering the Processing of Preferences by Using Symbolic Priorities in Possibilistic Logic
Mastering the Processing of Preferences by Using Symbolic Priorities in Possibilistic Logic
The paper proposes a new approach to the handling of preferences expressed in a compact way under the form of conditional statements. These conditional statements are translated in...
Castor : a constraint-based SPARQL engine with active filter processing
Castor : a constraint-based SPARQL engine with active filter processing
Castor : un moteur SPARQL basé sur les contraintes avec exploitation actif de filtres SPARQL est le langage de requête standard pour les graphes de données du Web S...
Automated extraction of attributes of IFC objects based on graph theory and SPARQL query
Automated extraction of attributes of IFC objects based on graph theory and SPARQL query
Abstract Building Information Modelling (BIM) has been widely adopted as an effective means for supporting information exchange in Architectural, Engineering and Con...
Skyline Queries in SPARQL: An Overview
Skyline Queries in SPARQL: An Overview
The growth of RDF (Resource Description Framework) datasets and the expansion of their use in conjunction with the definition of SPARQL, a declarative query language, have made RDF...
SPORTAL
SPORTAL
Access to hundreds of knowledge bases has been made available on the Web through public SPARQL endpoints. Unfortunately, few endpoints publish descriptions of their content (e.g., ...

Back to Top