Logic Programming with Solution Preferences: A Declarative Method.

Author

Miao Liu

Date of Award

5-1-2006

Document Type

Thesis

Degree Name

Master of Science (MS)

Department

Computer Science

First Advisor

Dr. Hai-feng Guo

Abstract

Preference logic programming (PLP) is an extension of constraint logic program­ming for declaratively specifying problems requiring optimization or comparison and selection among alternative solutions to a query. PLP essentially separates the programming of a problem itself from the criteria specification of its solution selection. This thesis presents a declarative method of specifying and executing preference logic programs based on a tabled Prolog system. The method intro­duces a formal predicate mode declaration for designating certain predicates as optimization predicates, and stating the criteria for determining their optimal so­lutions via preference rules. A flexible mode declaration scheme is implemented in a tabled Prolog system, which provides an easy implementation vehicle for programming with preferences. Finally, experimental results and performance analysis demonstrate the effectiveness of the method.

Comments

A Thesis Presented to the Department of Computer Science and the Faculty of the Graduate College University of Nebraska In Partial Fulfillment of the Requirements for the Degree Master of Science University of Nebraska at Omaha. Copyright 2006 Miao Liu

Recommended Citation

Liu, Miao, "Logic Programming with Solution Preferences: A Declarative Method." (2006). Student Work. 3587.
https://digitalcommons.unomaha.edu/studentwork/3587