Back to search

National and Kapodistrian University of Athens

Extensions of logic programming for preference representation

Abstract

dc:description

We consider the problem of preference representation using extensions of logic programming. The effective representation of preferences is crucial in many scientific disciplines and it can be proven useful in many real-world applications. Preference representation formalisms in the literature usually fall into two basic categories: in the qualitative approach (where preferences are expressed with binary preference relations) and in the quantitative approach (where preferences are represented with the use of numerical values that express the degree of interest). In this dissertation, we propose two approaches for expressing preferences. The first approach uses an infinite-valued extension of logic programming for expressing quantitative preferences, while the second approach uses higher-order logic programming for expressing qualitative preferences.We propose PrefLog, a logic programming language which uses an underlying infinite-valued truth domain in order to support quantitative preference operators. We introduce the syntax and the semantics of the language, and we study the properties of the PrefLog operators that are needed in order for programs to behave well from a semantic point of view. In addition, we introduce a terminating bottom-up evaluation method for a well-defined class of function-free PrefLog programs. Ensuring termination is not a straightforward task, because the underlying truth domain of PrefLog and the set of all possible interpretations of a function-free PrefLog program are both infinite.We propose the use of higher-order logic programming as a framework for representing qualitative preferences. In this approach, relations, preferences between tuples, preferences between sets of tuples and operations on preferences are expressed in the same, higher-order language. The programs can be evaluated by standard higher-order programming systems, and their performance can be enhanced with generic and specialized optimization techniques. Among these techniques, we propose a novel program transformation technique for translating higher-order programs into first-order ones and we use this technique for optimizing the higher-order programs of our interest. Finally, we demonstrate the feasibility of our approach by presenting an implementation and an experimental evaluation of all the proposed concepts in the higher-order logic programming language HiLog.

Degree

thesis:*
Grantor dc:publisher
National and Kapodistrian University of Athens
Year dc:date
2019

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Troumpoukis, Antonios
  • Τρουμπούκης, Αντώνιος

Subjects

dc:subject × 10

Rights

dc:rights
Statement dc:rights
  • BY
Language dc:language
eng

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/46117

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Troumpoukis, Antonios; Τρουμπούκης, Αντώνιος. Extensions of logic programming for preference representation. National and Kapodistrian University of Athens, 2019. http://hdl.handle.net/10442/hedi/46117