Abstract A Declarative Debugging System for Lazy Functional Logic Programs

We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), the debugger locates a program fragment (function defining rule) responsible for the error. The notions of symptom and error have a declarative meaning w.r.t. to an intended program semantics. Debugging is performed by searching in a computation tree which is a logical representation of the computation. Following a known technique, our tool is based on a program transformation: transformed programs return computation trees along with the results expected by source programs. Our transformation is provably correct w.r.t. well-typing and program semantics. As additional improvements w.r.t. related approaches, we solve a previously open problem concerning the use of curried functions, and we provide a correct method for avoiding redundant questions to the user during debugging. A prototype implementation of the debugger is available. Case studies and extensions are planned as future work.

An architecture for knowledge intensive CBR systems

Abstract. In this paper we describe a domain independent architecture to help in the design of knowledge intensive CBR systems. It is based on the knowledge incorporation from a library of application-independent ontologies and the use of an ontology with the common CBR terminology that guides the case representation and allows the description of flexible, generic and homogeneous CBR processes based on classification.