A Generic Scheme for Qualified Constraint Functional Logic Progamming

Details A Generic Scheme for Qualified Constraint Functional Logic Progamming A Generic Scheme for Qualified Constraint Functional Logic Progamming

2011-01-11

arxiv.org/abs/1101.2146v1

Computer Science

Programming Languages

36 pages, 5 figures, extended version with full proofs of Qualified Computations in Functional Logic Programming, in P.M. Hill

Scientific paper

Qualification has been recently introduced as a generalization of uncertainty in the field of Logic Programming. In this report we investigate a more expressive language for First-Order Functional Logic Programming with Constraints and Qualification. We present a Rewriting Logic which characterizes the intended semantics of programs, and a prototype implementation based on a semantically correct program transformation. Potential applications of the resulting language include flexible information retrieval. As a concrete illustration, we show how to write program rules to compute qualified answers for user queries concerning the books available in a given library.

Affiliated with

Also associated with

No associations

Rating

A Generic Scheme for Qualified Constraint Functional Logic Progamming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Generic Scheme for Qualified Constraint Functional Logic Progamming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Generic Scheme for Qualified Constraint Functional Logic Progamming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-160742