Combining RDF and SPARQL with CP-theories to reason about preferences in a Linked Data setting
- 14 April 2020
- journal article
- research article
- Published by IOS Press in Semantic Web
- Vol. 11 (3), 391-419
- https://doi.org/10.3233/sw-180339
Abstract
Preference representation and reasoning play a central role in supporting users with complex and multi-factorial decision processes. In fact, user tastes can be used to filter information and data in a personalized way, thus maximizing their expectedKeywords
This publication has 32 references indexed in Scilit:
- Learning conditional preference network from noisy samples using hypothesis testingKnowledge-Based Systems, 2013
- Preferences in AI: An overviewArtificial Intelligence, 2011
- Computational techniques for a simple theory of conditional preferencesArtificial Intelligence, 2011
- Democratic approximation of lexicographic preference modelsArtificial Intelligence, 2011
- Learning conditional preference networksArtificial Intelligence, 2010
- Partially ordered regular languages for graph queriesJournal of Computer and System Sciences, 2005
- Qualitative choice logicArtificial Intelligence, 2004
- Prospects for PreferencesComputational Intelligence, 2004
- Preference formulas in relational queriesACM Transactions on Database Systems, 2003
- The Semantic WebScientific American, 2001