On database queries involving competitive conditional preferences

DOI10.1002/INT.20463MaRDI QIDQ3018516zbMATH OpenOpenAlexFDO

Authors Allel Hadjali, Olivier Pivert, Patrick Bosc

Publication date 27 July 2011

Published in International Journal of Intelligent Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/int.20463

zbMATH Keywords

competitive conditional preference clauses

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Preference queries in deductive databases
• Combining totalitarian and Ceteris Paribus semantics in database preference queries
• Database preference queries -- a possibilistic logic approach with symbolic priorities
• Preference decomposition and the expressiveness of preference query languages
• Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities
• Algebraic Optimization of Relational Queries with Various Kinds of Preferences
• Contracting preference relations for database applications
• scientific article; zbMATH DE number 2086265

Cites work

• Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities
• scientific article; zbMATH DE number 1107524 (Why is no real title available?)
• scientific article; zbMATH DE number 2243357 (Why is no real title available?)
• Weighted minimum and maximum operations in fuzzy set theory

Cited in

(16)

• Skyline queries over possibilistic RDF data
• Database querying under changing preferences
• Towards an efficient processing of outranking-based preference queries
• A model based on outranking for database preference queries
• Decomposition of Database Preferences on the Power Set of the Domain
• A flexible model for the evaluation of soft conditional preferences in fuzzy databases
• Combining totalitarian and Ceteris Paribus semantics in database preference queries
• Preferential regular path queries
• Anti-division Queries with Ordinal Layered Preferences
• Database preference queries -- a possibilistic logic approach with symbolic priorities
• Towards a gradual QCL model for database querying
• Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities
• Constraint Databases
• Foundations of Information and Knowledge Systems
• Preference queries in deductive databases
• Strict and tolerant antidivision queries with ordinal layered preferences

Describes a project that uses

Uses Software

• CP-nets

This page was built for publication: On database queries involving competitive conditional preferences

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