(Enter summary)
Abstract: Traditional database query languages such as Datalog and SQL allow the user to specify only mandatory
requirements on the data to be retrieved from a database. In many applications, it may be
natural to express not only mandatory requirements but also preferences on the data to be retrieved.
Lacroix and Lavency [12] extended SQL with a notion of preference and showed how the resulting
query language could still be translated into the domain relational calculus. We explore the use of
preference... (Update)
Context of citations to this paper: More
.... 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...
.... 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...
Cited by: More
Querying with Preferences in a Digital Library - Nicolas Spyratos And
(Correct)
Which Are My Preferred Items? - Torlone, Ciaccia
(Correct)
Logic Programming with Preferences and Constraints - Jayaraman, Govindarajan, al.
(Correct)
Similar documents (at the sentence level):
59.0%: Preference Datalog - Summary Kannan
(Correct)
6.4%: Optimization and Relaxation in Constraint Logic Languages - Govindarajan, Jayaraman.. (1996)
(Correct)
Active bibliography (related documents): More All
0.9: Preference Logic Programming - Govindarajan (1995)
(Correct)
0.5: Preference Logic Programming: Optimization as Inference - Kannan Govindarajan (1994)
(Correct)
0.2: Intensional Algorithmic Debugging : Preliminary Version - Govindarajan, Jayaraman (1994)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.2: Preference Logic Grammars - Crowner, Govindarajan, Jayaraman..
(Correct)
0.2: Relaxation in Constraint Logic Languages - Govindarajan, Jayaraman, Mantha (1995)
(Correct)
Related documents from co-citation: More All
3: Preferences: putting more knowledge into queries (context) - Lacroix, Lavency - 1987
2: A Framework For Expressing and Combining Preferences (context) - Agrawal, Wimmers - 2000
2: Querying with Intrinsic Preferences (context) - Chomicki - 2002
BibTeX entry: (Update)
K. Govindarajan, B. Jayaraman, and S. Mantha. Preference Queries in Deductive Databases. Technical Report 95-50, Department of Computer Science, SUNY at Buffalo, 1995. http://citeseer.ist.psu.edu/article/govindarajan95preference.html More
@inproceedings{ govindarajan95preference,
author = "Kannan Govindarajan and Bharat Jayaraman and Surya Mantha",
title = "Preference Logic Programming",
booktitle = "International Conference on Logic Programming",
pages = "731-745",
year = "1995",
url = "citeseer.ist.psu.edu/article/govindarajan95preference.html" }
Citations (may not include all citations):
858
The stable model semantics for logic programming
- Gelfond, Lifschitz - 1988 DBLP
561
Constraint Logic Programming (context) - Jaffar, Lassez - 1987 ACM DBLP
315
Constraint Query Languages
- Kannelakis, Kuper et al. - 1990 ACM DBLP
118
Unfounded Sets and Well-Founded Semantics for General Logic .. (context) - van Gelder, Ross et al. - 1991 ACM DBLP
115
Magic templates: A spellbinding approach to logic programs
- Ramakrishnan - 1988 DBLP
113
Cambridge University Press (context) - Chellas, An - 1980
61
Monotonic Aggregation in Deductive Databases
- Ross, Sagiv - 1992 ACM DBLP
54
Complexity of Modal Logics (context) - Spaan - 1993
50
Bottom-up beats Top-down for Datalog (context) - Ullman - 1989 ACM DBLP
50
Hierarchical Constraint Logic Programming
- Wilson, Borning - 1993 ACM DBLP
46
Modal Nonmonotonic Logics: Ranges (context) - Marek, Schwarz et al. - 1993
41
Aggregation and Relevance in Deductive Databases
- Sudarshan, Ramakrishnan - 1991 ACM DBLP
40
Semantics of Logic Programs with Aggregates
- Kemp, Stuckey - 1991 DBLP
33
Minimum and Maximum Predicates in Logic Programming
- Ganguly, Greco et al. - 1991
28
The Well-founded Semantics of Aggregation (context) - Van Gelder - 1992 ACM DBLP
25
Preference Logic Programming
- Govindarajan, Jayaraman et al. - 1995 DBLP
16
Efficient Bottom-up Evaluation of Logic Programs
- Ramakrishnan, Srivastava et al. - 1992
14
Extending the Well-Founded and Valid Semantics for Aggregati..
- Sudarshan, Srivastava et al. - 1993 ACM DBLP
12
First-Order Preference Theories and their Applications (context) - Mantha - 1991
12
Preferences: Putting More Knowledge into Queries (context) - Lacroix, Lavency - 1987
11
Optimization and Relaxation in Constraint Logic Languages
- Govindarajan, Jayaraman et al. - 1996 ACM DBLP
11
Top-down Beats Bottom-up for Constraint Based Extensions of .. (context) - Toman - 1995 DBLP
11
Partial Order Programming (context) - Jayaraman, Osorio et al. - 1995 DBLP
8
Preference Logics: Towards a Unified Approach to Non-Monoton.. (context) - Brown, Mantha et al. - 1994
4
Implementation of Subset-Equational Languages (context) - Jayaraman - 1992
Documents on the same site (http://www.cs.buffalo.edu/~govin-k/proglang.html): More
Optimization and Relaxation in Constraint Logic Languages - Govindarajan, Jayaraman.. (1996)
(Correct)
Preference Logic Programming - Kannan Govindarajan (1995)
(Correct)
Relaxation in Constraint Logic Languages - Govindarajan, Jayaraman, Mantha (1995)
(Correct)
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