The aim of the paper is to present a novel, general approach to preference modelling in the framework of the relational data model. To allow nonmonotonic operations, the preferences are defined between sets of relational instances. The aim is the generalization of the relational algebra that is as minimal as possible, in the sense that the formal fundamentlas of the relational data model are preserved. At the same time, the extended model should be formal enough to provide a sound basis for the investigation of other new preference constructors and operations and for new possible applications
As shown by Fodor, Ovchinikov and Roubens [3,4,7,14], a binary preference relation should be always ...
AbstractThe binary relation framework has been shown to be applicable to many real-life preference h...
Abstract—In implementing preference-aware query processing, a straightforward option is to build a p...
The paper proposes to extend the classical relational data model by the notion of preference realize...
Abstract. The paper gives an overview of recent advances in the field of logic of preference and dis...
This chapter provides the reader with a presentation of preference modelling fundamental notions as ...
Relational methods in computer science have been studied intensively in the last decades, especially...
There is a need for handling preferences in relational query languages that arises naturally in real...
Preference algebra, an extension of the algebra of database relations, is a well-studied field in th...
AbstractValue functions are defined over a fixed set of outcomes. In work on preference handling in ...
Preference relations are intensively studied in Economics, but they are also approached in AI, Know...
This paper proposes new concepts and new results which could lead to a more realistic preference mod...
This paper offers an overview of the literature on preference modelling. Our departure point is the ...
The design and implementation of advanced personalized database applications requires a preference-d...
The notion of user preference in database modeling has recently received much attention in advanced ...
As shown by Fodor, Ovchinikov and Roubens [3,4,7,14], a binary preference relation should be always ...
AbstractThe binary relation framework has been shown to be applicable to many real-life preference h...
Abstract—In implementing preference-aware query processing, a straightforward option is to build a p...
The paper proposes to extend the classical relational data model by the notion of preference realize...
Abstract. The paper gives an overview of recent advances in the field of logic of preference and dis...
This chapter provides the reader with a presentation of preference modelling fundamental notions as ...
Relational methods in computer science have been studied intensively in the last decades, especially...
There is a need for handling preferences in relational query languages that arises naturally in real...
Preference algebra, an extension of the algebra of database relations, is a well-studied field in th...
AbstractValue functions are defined over a fixed set of outcomes. In work on preference handling in ...
Preference relations are intensively studied in Economics, but they are also approached in AI, Know...
This paper proposes new concepts and new results which could lead to a more realistic preference mod...
This paper offers an overview of the literature on preference modelling. Our departure point is the ...
The design and implementation of advanced personalized database applications requires a preference-d...
The notion of user preference in database modeling has recently received much attention in advanced ...
As shown by Fodor, Ovchinikov and Roubens [3,4,7,14], a binary preference relation should be always ...
AbstractThe binary relation framework has been shown to be applicable to many real-life preference h...
Abstract—In implementing preference-aware query processing, a straightforward option is to build a p...