Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities
From MaRDI portal
Publication:5445307
DOI10.1007/978-3-540-77684-0_20zbMath1138.68391MaRDI QIDQ5445307
Allel Hadjali, Souhila Kaci, Henri Prade
Publication date: 4 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77684-0_20
Related Items
Strict and tolerant antidivision queries with ordinal layered preferences, Possibilistic nested logic programs and strong equivalence, On database queries involving competitive conditional preferences, Anti-division Queries with Ordinal Layered Preferences
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Possibilistic logic: a retrospective and prospective view
- Qualitative choice logic
- Preference structures and their numerical representations
- Database querying under changing preferences
- Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities
- Towards a possibilistic logic handling of preferences