the aim of this paper is to provide theoretical foundations for the declarative debugging of wrong answers in lazy functionallogicprogramming. We rely on a logical framework which formalizes boththe intended meanin...
详细信息
In this paper we start the design of a functional-logic deductive database language. Given that most logic deductive languages consider bottom-up evaluation as operational mechanism, here we will focus on the developm...
详细信息
In this work, we consider the extension of the Inductive functionallogicprogramming (IFLP) framework in order to learn functions in an incremental way. In general, incremental learning is necessary when the number o...
详细信息
CLNC is a lazy narrowing calculus for goal solving in the context of CRWL, a rewriting logic for functionallogicprogrammingthat deals with non-deterministic functions. the JUMP-machine is an abstract machine model ...
详细信息
ISBN:
(纸本)3540417397
CLNC is a lazy narrowing calculus for goal solving in the context of CRWL, a rewriting logic for functionallogicprogrammingthat deals with non-deterministic functions. the JUMP-machine is an abstract machine model for the efficient implementation of functionallogic languages. In this paper, we propose the integration of these two abstract models into an experimental system, for which extensibility and modifiability are major concerns. this leads us to the selection of an object-oriented approach and the use of design patterns for the system design and implementation.
the paper presents a novel approach to the analysis of typed logic programs. We assume regular type descriptions of logic program variables provided by regular tree grammars. Types are used to identify components of t...
详细信息
In this paper we consider the theory of fuzzy logicprogramming without negation. Our results cover logical systems with a wide variety of connectives ranging from t-norm and conorms, through conjunctors and disjuncto...
详细信息
In this paper we consider the theory of fuzzy logicprogramming without negation. Our results cover logical systems with a wide variety of connectives ranging from t-norm and conorms, through conjunctors and disjunctors and their residuals to aggregation operators. Rules of our programs are many valued implications. We emphasize, that in contrast to other approaches, our logic is truthfunctional, i.e. according to P. Hajek, we work in fuzzy logic in narrow sense. We prove the soundness and the completeness of our formal model. We deal with applications to threshold computation, abduction, fuzzy unification based on similarity. We show that fuzzy unification based on similarities has applications to fuzzy databases and flexible querying. (C) 2001 Elsevier Science B.V. All rights reserved.
We consider prescriptive type systems for logic programs (as in Gödel or Mercury). In such systems, the typing is static, but it guarantees an operational property: if a program is "well-typed", then al...
详细信息
We present a framework for the combination of Constraint logicprogramming (CLP) and higher-order Hereditary Harrop Formulas (hoHH). Our aim is to improve the expressiveness of traditional logicprogramming withthe b...
详细信息
ISBN:
(纸本)3540417397
We present a framework for the combination of Constraint logicprogramming (CLP) and higher-order Hereditary Harrop Formulas (hoHH). Our aim is to improve the expressiveness of traditional logicprogramming withthe benefits of both fields: CLP and hoHH. the result is denoted higher-order Hereditary Harrop Formulas with Constraints (hoHH(C)). the syntax of hoHH is introduced using lambda-terms and is enriched with a basic constraint system. then an intuitionistic sequent calculus is defined for this combined logic, that preserves the property of an abstract logicprogramming language. In addition, a sound and complete procedure for goal solving is presented as a transformation system that explains the operational semantics.
暂无评论