Preference queries in deductive databases
From MaRDI portal
Recommendations
- Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities
- Database preference queries -- a possibilistic logic approach with symbolic priorities
- Preference decomposition and the expressiveness of preference query languages
- scientific article; zbMATH DE number 2086265
- On database queries involving competitive conditional preferences
- Combining totalitarian and Ceteris Paribus semantics in database preference queries
Cites work
- Heterotic M(atrix) theory at generic points in Narain moduli space
- Hierarchical constraint logic programming
- Modal nonmonotonic logics
- Modular stratification and magic sets for Datalog programs with negation
- Monotonic aggregation in deductive databases
- Preference logic grammars
- Preference logics: Towards a unified approach to nonmonotonicity in deductive reasoning
- Pushing constraint selections
- The well-founded semantics for general logic programs
Cited in
(10)- Preference decomposition and the expressiveness of preference query languages
- Decomposition of Database Preferences on the Power Set of the Domain
- An algebra of database preferences
- Preference Query Analysis and Optimization
- On database queries involving competitive conditional preferences
- Preferential regular path queries
- The semantics of incomplete databases as an expression of preferences
- Constraint Databases
- Database querying under changing preferences
- Combining totalitarian and Ceteris Paribus semantics in database preference queries
This page was built for publication: Preference queries in deductive databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929096)
