Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities

DOI10.1007/978-3-540-77684-0_20zbMath1138.68391OpenAlexW1525667041MaRDI 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

zbMATH Keywords

possibilistic logicPreferences queries

Mathematics Subject Classification ID

Database theory (68P15) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (4)

Strict and tolerant antidivision queries with ordinal layered preferences ⋮ On database queries involving competitive conditional preferences ⋮ Anti-division Queries with Ordinal Layered Preferences ⋮ Possibilistic nested logic programs and strong equivalence

Uses Software

• CP-nets

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities