Database querying under changing preferences

DOI10.1007/S10472-007-9072-3zbMATH Open1129.68030arXivcs/0607013OpenAlexW2040584916MaRDI QIDQ2385451FDOQ2385451

Jan Chomicki

Publication date: 12 October 2007

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

Abstract: We present here a formal foundation for an iterative and incremental approach to constructing and evaluating preference queries. Our main focus is on query modification: a query transformation approach which works by revising the preference relation in the query. We provide a detailed analysis of the cases where the order-theoretic properties of the preference relation are preserved by the revision. We consider a number of different revision operators: union, prioritized and Pareto composition. We also formulate algebraic laws that enable incremental evaluation of preference queries. Finally, we consider two variations of the basic framework: finite restrictions of preference relations and weak-order extensions of strict partial order preference relations.

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

zbMATH Keywords

Query evaluationInterval orderWeak orderPreference queriesPreference revisionStrict partial order

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fixed-point extensions of first-order logic
• Title not available (Why is that?)
• Interval graphs and interval orders
• Changes in preference
• On the revision of preferences and rational inference processes
• Title not available (Why is that?)
• Knowledgebase transformations
• Title not available (Why is that?)
• Constraint Databases
• Foundations of Information and Knowledge Systems
• Preference queries in deductive databases

Cited In (5)

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

Uses Software

• CP-nets

   Recommendations

• Foundations of Information and Knowledge Systems 👍 👎
• On database queries involving competitive conditional preferences 👍 👎
• An algebra of database preferences 👍 👎
• A model based on outranking for database preference queries 👍 👎
• Combining totalitarian and Ceteris Paribus semantics in database preference queries 👍 👎

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

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