Qualified Computations in Functional Logic Programming

Authors:
Rafael Caballero;Mario Rodríguez-Artalejo;Carlos A. Romero-Díaz
Affiliations:
Departamento de Sistemas Informáticos y Computación, Universidad Complutense Facultad de Informática, Madrid, Spain 28040;Departamento de Sistemas Informáticos y Computación, Universidad Complutense Facultad de Informática, Madrid, Spain 28040;Departamento de Sistemas Informáticos y Computación, Universidad Complutense Facultad de Informática, Madrid, Spain 28040
Venue:
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Year:
2009

Citing 10
Cited 1

A needed narrowing strategy

Journal of the ACM (JACM)
Functional and constraint logic programming

Constraints in computational logics
Approximate reasoning by similarity-based SLD resolution

Theoretical Computer Science
Quantitative Constraint Logic Programming for Weighted Grammar Applications

LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
A lazy narrowing calculus for declarative constraint programming

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
A new generic scheme for functional logic programming with constraints

Higher-Order and Symbolic Computation
Formal Properties of Needed Narrowing with Similarity Relations

Electronic Notes in Theoretical Computer Science (ENTCS)
Similarity-based reasoning in qualified logic programming

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Quantitative logic programming revisited

FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Declarative constraint programming with definitional trees

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems

A declarative semantics for clp with qualification and proximity*

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.