Mario Rodríguez-Artalejo

Learn More
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. This paper speciies a computation strategy for lazy conditional narrowing, based on the idea of transforming patterns into decision trees to control the computation. The speciication(More)
We propose a new approach to declarative programming which integrates the functional and relational paradigms by taking possibly non-deterministic lazy functions as the fundamental notion. Programs in our paradigm are theories in a constructor based conditional rewriting logic. We present proof calculi and a model theory for this logic, and we prove the(More)
According to a well known conception, programs in a declarative programming language can be viewed as theories in some suitable logic, while computations can be viewed as deductions. In our opinion, there is yet no general assent on the logic to be viewed as the foundation of higher order, lazy functional logic languages. In this paper, we argue that a(More)
In this paper we propose a new generic scheme CFLP(D), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a para-metrically given constraint domain D. As in the case of the well known CLP(D) scheme for Constraint Logic Programming, D is assumed to provide domain specific data values and constraints. CFLP(D)(More)
Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause annotations based on uncertain truth values, qualification values as a generalization of uncertain truth values, and(More)
Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause annotations based on uncertain truth values, qualification values as a generalization of uncertain truth values, and(More)
This paper presents a computational model for the cooperation of constraint domains and an implementation for a particular case of practical importance. The computational model supports declarative programming with lazy and possibly higher-order functions, predicates, and the cooperation of different constraint domains equipped with their respective(More)