Database querying under changing preferences

DOI10.1007/s10472-007-9072-3zbMath1129.68030arXivcs/0607013OpenAlexW2040584916MaRDI QIDQ2385451

Jan Chomicki

Publication date: 12 October 2007

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0607013

zbMATH Keywords

Query evaluationWeak orderInterval orderPreference queriesPreference revisionStrict partial order

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (5)

Database preference queries -- a possibilistic logic approach with symbolic priorities ⋮ Contracting preference relations for database applications ⋮ Consistent union and prioritized consistent union: new operations for preference aggregation ⋮ Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities ⋮ Belief base contraction by belief accrual

Uses Software

• CP-nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Knowledgebase transformations
• On the revision of preferences and rational inference processes
• Interval graphs and interval orders
• Fixed-point extensions of first-order logic
• Changes in preference
• Constraint Databases
• Foundations of Information and Knowledge Systems
• Preference queries in deductive databases

This page was built for publication: Database querying under changing preferences