Strict and tolerant antidivision queries with ordinal layered preferences
From MaRDI portal
Publication:622283
DOI10.1016/J.IJAR.2010.04.004zbMATH Open1209.68189OpenAlexW2016992158MaRDI QIDQ622283FDOQ622283
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
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
- Preference structures and their numerical representations
- 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
Cited In (1)
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)