K. Govindarajan, B. Jayaraman, and S. Mantha. Preference Queries in Deductive Databases. New Generation Computing, 19(1):57--86, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Which Are My Preferred Items? - Torlone, Ciaccia (Correct)
.... be a subjective one, thus the system has to learn it and then to exploit the acquired knowledge about user preferences to retrieve the most relevant objects [3] In the database field, the problem of expressing and managing user preferences has received growing attention in the last few years [1, 4, 6, 8, 9, 11 15]. In many approaches [1, 7 9, 12] preferences are expressed quantitatively by defining a scoring function that is a weighted linear combination of attributes values (which have therefore to be numeric) Since the scoring function associates each tuple with a numeric score, tuple t 1 is preferred ....
K. Govindarajan, B. Jayaraman, and S. Mantha. Preference Queries in Deductive Databases. New Generation Computing, 19(1): 57--86, 2001.
Logic Programming with Preferences and Constraints - Jayaraman, Govindarajan, al. Self-citation (Govindarajan Jayaraman Mantha) (Correct)
....requiring optimization and relaxation. Recently, Jampel showed that there is a direct correspondence between the constraint hierarchies of HCLP and partial constraint satisfaction problems [20] We have also examined the application of the notion of preference in the area of deductive databases [14], but we do not go into these details here for the sake of brevity. Traditional database query languages allow the user to express only the mandatory requirements on the data to be retrieved from a database. In many applications, it is more natural to express queries in terms of both mandatory, or ....
....more expressiveness than the relational calculus by its ability to support transitive closures and general recursive queries. Just as datalog is a restriction of conventional logic programs, our proposed paradigm, called preference datalog, is a restriction of preference logic programs (PLPs) [14]. Our concept of preference is closely related to the notion of extreme value aggregate operations (such as min and max) in deductive databases. The concept of preference has also been studied in other fields including decision theory, economics, philosophical logic, artificial intelligence, and ....
K. Govindarajan, B. Jayaraman, and S. Mantha. Preference Queries in Deductive Databases. Technical Report 95-50, Department of Computer Science, SUNY at Buffalo, 1995.
Querying with Preferences in a Digital Library - Nicolas Spyratos And (Correct)
No context found.
K. Govindarajan, B. Jayaraman, and S. Mantha. Preference Queries in Deductive Databases. New Generation Computing, 19(1):57--86, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC