Results 1 
5 of
5
On Reducing the Search Space of HigherOrder Lazy Narrowing
, 1999
"... Higherorder lazy narrowing is a general method for solving Eunification problems in theories presented as sets of rewrite rules. In this paper we study the possibility to improve the search for normalized solutions of a higherorder lazy narrowing calculus LN. We introduce a new calculus, LNff, ob ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
Higherorder lazy narrowing is a general method for solving Eunification problems in theories presented as sets of rewrite rules. In this paper we study the possibility to improve the search for normalized solutions of a higherorder lazy narrowing calculus LN. We introduce a new calculus, LNff, obtained by extending LN and define an equation selection strategy Sn such that LNff with strategy Sn is complete. The main advantages of using LNff with strategy Sn instead of LN include the possibility to restrict the application of outermost narrowing at variable position, and the computation of more specific solutions because of additional inference rules for solving exex equations. We also show that for orthogonal pattern rewrite systems we can adopt an eager variable elimination strategy that makes the calculus LNff with strategy Sn even more deterministic.
A Distributed System for Solving Equational Constraints Based on Lazy Narrowing Calculi
, 1999
"... In this paper we describe the architecture and implementation of a system that aims at extending in a consistent way a functional logic programming language with solving techniques of various constraint solving systems. The system is called CFLP (Constrained Functional Logic Programming language), a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we describe the architecture and implementation of a system that aims at extending in a consistent way a functional logic programming language with solving techniques of various constraint solving systems. The system is called CFLP (Constrained Functional Logic Programming language), and consists of a lazy functional logic interpreter extended in two directions: the possibility to specify constraints, and the possibility to specify AND and ORparallelism. For solving the constraints, a distributed constraint solving system was implemented.
KnowledgeWeb
"... Training people on science and engineering as well as providing scientific and engineering solutions are key abilities in the technologydriven development of our society. Recent innovations in global networking and, in particular, the creation of the WorldWide Web and the widespread use of mob ..."
Abstract
 Add to MetaCart
Training people on science and engineering as well as providing scientific and engineering solutions are key abilities in the technologydriven development of our society. Recent innovations in global networking and, in particular, the creation of the WorldWide Web and the widespread use of mobilecode technology, put a new generation of software systems within our reach, which promise a new quality of knowledge dissemination and absorption. Herein we document our design of a combined software technology basis and content creation methodology (tentatively named KnowledgeWeb) that addresses both modern education methods and distributed solution providers in the area of science and engineering. In accordance with the twofold goal, we propose two main technologies: active books and knowledge on demand. The first component, active books, blurs the distinction between traditional textbooks and educational software by integrating contentdependent software into the static text...
Higherorder Lazy Narrowing Calculi in Perspective
, 2000
"... Higherorder lazy narrowing (HOLN for short) is a computational model for higherorder functional logic programming. It can be viewed as an extension of firstorder lazy narrowing with inference rules to solve equations involving lambdaabstractions and higherorder variables. A common feature of th ..."
Abstract
 Add to MetaCart
Higherorder lazy narrowing (HOLN for short) is a computational model for higherorder functional logic programming. It can be viewed as an extension of firstorder lazy narrowing with inference rules to solve equations involving lambdaabstractions and higherorder variables. A common feature of the HOLN calculi proposed so far is the high nondeterminism between the inference rules designed to solve equations which involve higherorder variables. In this paper we present various refinements of HOLN towards more deterministic versions. The refinements are defined for classes of higherorder functional logic programs which are useful for programming purposes. Our work draws on two sources: the calculus LN for pattern rewrite systems [Pre98] and the firstorder lazy narrowing calculus LNC and its deterministic refinements [MO98].
A HigherOrder Computational Model for Cooperative Constraint Programming
"... Abstract — This paper presents a theoretical framework for the integration of the cooperative constraint solving of several algebraic domains into higherorder functional and logic programming on λabstractions, using the instance CFLP(C) of the generic Constraint Functional Logic Programming (CFLP) ..."
Abstract
 Add to MetaCart
Abstract — This paper presents a theoretical framework for the integration of the cooperative constraint solving of several algebraic domains into higherorder functional and logic programming on λabstractions, using the instance CFLP(C) of the generic Constraint Functional Logic Programming (CFLP) scheme [7] over a socalled higherorder coordination domain C. We provide this framework as a powerful computational model for the higherorder cooperation of algebraic constraint domains over real numbers R and integers FD, which has been useful in practical applications involving the hybrid combination of its components, so that more declarative and efficient solutions can be promoted. Our proposal of computational model has been proved sound and complete with respect to the declarative semantics provided by the CFLP scheme, and enriched with new mechanisms for modeling the intended cooperation among the algebraic domains and a higherorder constraint domain ⋋ equipped with a sound and complete constraint solver for solving higherorder equations.