Strict and tolerant antidivision queries with ordinal layered preferences

DOI10.1016/J.IJAR.2010.04.004MaRDI QIDQ622283zbMATH OpenOpenAlexFDO

Authors Patrick Bosc, Olivier Pivert, Olivier Soufflet

Publication date 31 January 2011

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2010.04.004

zbMATH Keywords

quotientquery relaxationantidivisiondatabase queryingfuzzy quantifiersordinal preferences

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Anti-division Queries with Ordinal Layered Preferences
• Preference decomposition and the expressiveness of preference query languages
• Flexible queries in relational databases -- The example of the division operator
• An Algebra of Layered Complex Preferences
• On database queries involving competitive conditional preferences

Cites work

• A computational approach to fuzzy quantifiers in natural languages
• An overview of fuzzy quantifiers. I. Interpretations
• Characterizing the result of the division of fuzzy relations
• Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities
• Preference structures and their numerical representations

Cited in

(1)

• Anti-division Queries with Ordinal Layered Preferences

This page was built for publication: Strict and tolerant antidivision queries with ordinal layered preferences

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