A model based on outranking for database preference queries

DOI10.1007/978-3-642-14058-7_10MaRDI QIDQ3164087zbMATH OpenOpenAlexFDO

Authors Olivier Pivert, Grégory Smits, Patrick Bosc

Publication date 27 October 2010

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14058-7_10

zbMATH Keywords

incommensurabilityoutrankingpreference queries

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Towards an efficient processing of outranking-based preference queries
• On database queries involving competitive conditional preferences
• Database preference queries -- a possibilistic logic approach with symbolic priorities
• Preference decomposition and the expressiveness of preference query languages
• Database querying under changing preferences

Cited in

(5)

• Database querying under changing preferences
• Towards an efficient processing of outranking-based preference queries
• Database preference queries -- a possibilistic logic approach with symbolic priorities
• Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities
• Preference update for e-commerce applications: Model, language, and processing

Describes a project that uses

Uses Software

• CP-nets

This page was built for publication: A model based on outranking for database preference queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3164087)