A logic query language to express lexicographic preferences

Postgraduate Thesis uoadl:1776898 695 Read counter

Unit:
Κατεύθυνση / ειδίκευση Θεωρητική Πληροφορική (ΘΕΩ)
Πληροφορική
Deposit date:
2017-08-07
Year:
2017
Author:
Papadimitriou George
Supervisors info:
Παναγιώτης Ροντογιάννης, Καθηγητής, Τμήμα Πληροφορικής και Τηλεπικοινωνιών, ΕΚΠΑ
Original Title:
Μία λογική γλώσσα επερωτήσεων για λεξικογραφικές προτιμήσεις
Languages:
Greek
Translated title:
A logic query language to express lexicographic preferences
Summary:
In this thesis we propose lxpQL, a new query language for expressing user-defined preference
constraints. Except from the usual logical operators ( ∧ , ∨ , ¬), this language uses a new
binary operator ≫ , which expresses a lexicographic preference between its arguments.
We also define a set of infinitesimals and we show that this set can be used in order to
give the proper semantics of our language, namely that the lexicographical property of the
expressed preferences is preserved. Finally, we provide an interpreter of lxpQL, which
was implemented in XSB Prolog.
Main subject category:
Technology - Computer science
Keywords:
Query languages for Preferences, Lexicographic Preferences
Index:
Yes
Number of index pages:
3
Contains images:
No
Number of references:
10
Number of pages:
91
phthesis - GSPapadimitriou.pdf (624 KB) Open in new window