Preference queries in deductive databases

New Generation Computing

Volumn 19, Issue 1, 2001, Pages 57-86

  Govindarajan, Kannan ^a   Jayaraman, Bharat ^b   Mantha, Surya ^c  

^a HEWLETT PACKARD COMPANY   (United States)

^b State University of New York   (United States)

^c Pittiglio Todd Rabin and McGrath ^*  (United States)

Author keywords

Bottom up evaluation; Database query language; Datalog; Preferences and constraints; Relaxation queries

Indexed keywords

COMPUTER AIDED LANGUAGE TRANSLATION; CONSTRAINT THEORY; LOGIC PROGRAMMING; NONBIBLIOGRAPHIC RETRIEVAL SYSTEMS; OPTIMIZATION;

BOTTOM-UP EVALUATIONS; PREFERENCE DATALOG PROGRAMS (PDP); RELAXATION QUERIES;

QUERY LANGUAGES;

EID: 0034965215     PISSN: 02883635     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03037534     Document Type: Article

References (23)

1. Preference logics: Towards a unified approach to non-monotonicity in deductive reasoning
2. Minimum and maximum predicates in logic programming
3. The stable model semantics for logic programming
4. Preference logic programming
5. Optimization and relaxation in constraint logic languages
6. Constraint logic programming
7. Constraint query languages
8. Semantics of logic programs with aggregates
9. Preferences: Putting more knowledge into queries
10. Modal nonmonotonic logics: Ranges, characterization, computation
11. Magic templates: A spellbinding approach to logic programs
12. Efficient bottom-up evaluation of logic programs
13. Monotonic aggregation in deductive databases
14. Modular stratification and magic sets for datalog programs with negation
15. Pushing constraint selections
16. Aggregation and relevance in deductive databases
17. Extending the well-founded and valid semantics for aggregation
18. Bottom-up beats top-down for datalog
19. The well-founded semantics of aggregation
20. Unfounded sets and well-founded semantics for general logic programs
21. Hierarchical constraint logic programming