Mode-directed preferences for logic programs

Authors:
Hai-Feng Guo;Bharat Jayaraman
Affiliations:
University of Nebraska at Omaha, Omaha, NE;State University of New York at Buffalo, Buffalo, NY
Venue:
Proceedings of the 2005 ACM symposium on Applied computing
Year:
2005

Citing 8
Cited 2

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Minimum and maximum predicates in logic programming

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tabled evaluation with delaying for general logic programs

Journal of the ACM (JACM)
Optimization and relaxation in constraint logic languages

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Preference logic grammars: fixed point semantics and application to data standardization

Artificial Intelligence
A Simple Scheme for Implementing Tabled Logic Programming Systems Based on Dynamic Reordering of Alternatives

Proceedings of the 17th International Conference on Logic Programming
On the Semantics of Optimization Predicates in CLP Languages

Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Preference logic grammars

Computer Languages

Optimization with mode-directed preferences

PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Modeling preferences and conditional preferences on resource consumption and production in ASP

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Preference logic programming (PLP) is an extension of constraint logic programming 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. In this paper we provide a syntax for PLP based upon mode-directed preferences and a semantics based upon Herbrand models and fixed-point theory. Our method uses mode declarations to designate certain predicates as optimization predicates, and uses preference rules for stating the criteria for determining their optimal solutions. This paper also presents an elegant and easy method of executing preference logic programs in terms of tabled Prolog. Automatic transformation is applied to embed the preferences into the problem specification for efficient evaluation. We show that the procedural semantics of a preference logic program is equivalent to its declarative semantics.