Qualification has been recently introduced as a generalization of uncertainty in the field of Logic Programming. In this paper 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. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Caballero, R., Rodríguez-Artalejo, M., & Romero-Díaz, C. A. (2009). Qualified computations in functional logic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5649 LNCS, pp. 449–463). https://doi.org/10.1007/978-3-642-02846-5_36
Mendeley helps you to discover research relevant for your work.