fuzzylogic programs are a useful framework for imperfect knowledge representation and reasoning using the formalism of logicprogramming. Nevertheless, there is the need for modeling adaptation of fuzzylogic program...
详细信息
fuzzylogic programs are a useful framework for imperfect knowledge representation and reasoning using the formalism of logicprogramming. Nevertheless, there is the need for modeling adaptation of fuzzylogic programs, so that machine learning techniques, such as connectionist-based learning, can be applied. Weighted fuzzylogic programs bring fuzzylogic programs and connectionist models closer together by associating a significant weight with each atom in the body of a fuzzy rule: by exploiting the existence of the weights, it is possible to construct a connectionist model that reflects the exact structure of a weighted fuzzylogic program. Based on the connectionist representation, we first define the weight adaptation problem as the task of adapting the weights of the rules of a weighted fuzzylogic program, so that they fit: best a set of training data, and then we develop a subgradient descent learning algorithm for the connectionist model that allows us to obtain an approximate solution for the weight adaptation problem. (C) 2008 Elsevier B.V. All rights reserved.
Starting from unification based on similarity, a logicprogramming language, called LIKEness in logic (Likelog) is derived, thorougly relying on similarity. An operational semantics and a fix-point semantics of the la...
详细信息
Starting from unification based on similarity, a logicprogramming language, called LIKEness in logic (Likelog) is derived, thorougly relying on similarity. An operational semantics and a fix-point semantics of the language are defined, using an extension principle for fuzzy operators. The two approaches are proved to be related and a fuzzy extension of the least Herbrand model is given. One of the principal feature of such a logicprogramming language is to allow flexible query answering to deductive databases, which we show through an example. Moreover, we describe a system for web information retrieval through Likelog.
We introduce a sufficient condition which guarantees the existence of stable models for a normal residuated logic program interpreted on the truth-space [0, 1](n). Specifically, the continuity of the connectives invol...
详细信息
We introduce a sufficient condition which guarantees the existence of stable models for a normal residuated logic program interpreted on the truth-space [0, 1](n). Specifically, the continuity of the connectives involved in the program ensures the existence of stable models. Then, we study conditions which guarantee the uniqueness of stable models in the particular case of the product t-norm, its residuated implication and the standard negation.
This work proposes a declarative semantics based on a fuzzy variant of the classical notion of least Herbrand model for the so-called FASILL language (acronym of "fuzzy Aggregators and Similarity Into a logic Lan...
详细信息
ISBN:
(纸本)9783319420196;9783319420189
This work proposes a declarative semantics based on a fuzzy variant of the classical notion of least Herbrand model for the so-called FASILL language (acronym of "fuzzy Aggregators and Similarity Into a logic Language") which has been recently designed and implemented in our research group for coping with implicit/explicit truth degree annotations, a great variety of connectives and unification by similarity.
fuzzy logic programming is a growing declarative paradigm aiming to integrate fuzzylogic into logicprogramming (LP). In this setting, the multi-adjoint logic approach represents an extremely flexible fuzzy language ...
详细信息
ISBN:
(纸本)9783642022814
fuzzy logic programming is a growing declarative paradigm aiming to integrate fuzzylogic into logicprogramming (LP). In this setting, the multi-adjoint logic approach represents an extremely flexible fuzzy language with a procedural principle structured in two separate phases. During the operational one, admissible steps are systematically applied in a similar way to classical resolution steps in LP, thus returning an expression where all atoms have been exploited. This last expression is then interpreted under a given lattice during the so called interpretive phase. Whereas the operational phase has been successfully formalized in the past, more effort is needed to clarify the notion of interpretive step. In this paper we firstly introduce a refinement of this concept which fairly models at a very low level the computational behaviour of the interpretive phase. Then, we present a simple but powerful cost measure induced from such definition which helps to estimate the computational (interpretive) effort required to solve a goal. The resulting method is much more accurate and realistic than other simpler cost measures (like counting the number or the weights of interpretive steps) that we have proposed in the past for proving efficiency properties in program transformation tasks such as fold/unfold, partial evaluation, and so on.
作者:
Julian, P.Moreno, G.Penabad, J.UCLM
Dep Informat Technol & Syst Calle Altagracia S-13071 Ciudad Real Spain UCLM
Dept Comp Syst S-02071 Albacete Spain UCLM
Dept Math S-02071 Albacete Spain
The notion of least Herbrand model has been traditionally accepted as the declarative semantics for programs in the context of pure logicprogramming. Some adaptations of this concept, using model-theory, were made fo...
详细信息
ISBN:
(纸本)9783642024771
The notion of least Herbrand model has been traditionally accepted as the declarative semantics for programs in the context of pure logicprogramming. Some adaptations of this concept, using model-theory, were made for a few number of fuzzy logic programming frameworks in the recent years. Unfortunately, this is not the case of multi-adjoint logicprogramming, one of the most expressive, powerful approaches for fuzzifying logicprogramming. To fulfill this gal), in this paper we propose a declarative Semantics for Such kind of fuzzylogic programs based on the so-called least frizzy Herbrand model. We prove and important "minimality" property of our construction which can not trivially be inherited from pure logicprogramming. Moreover, apart from relating our notion with other existing procedural and fix-point semantics (what is also instrumental to prove its properties), we provide evident;cases where our construction exists even when the rest of the aforementioned fuzzy semantics remain undefined.
In many declarative frameworks, unfolding is a very wellknown semantics-preserving transformation technique based on the application of computational steps on the bodies of program rules for improving efficiency. In t...
详细信息
ISBN:
(纸本)9783030205188;9783030205171
In many declarative frameworks, unfolding is a very wellknown semantics-preserving transformation technique based on the application of computational steps on the bodies of program rules for improving efficiency. In this paper we describe an online tool which allows us to unfold a symbolic extension of amodern fuzzylogic language where program rules can embed concrete and/or symbolic fuzzy connectives and truth degrees on their bodies. The system offers a comfortable interaction with users for unfolding symbolic programs and it also provides useful options to navigate along the sequence of unfolded programs. Finally, the symbolic unfolding transformation is connected with some fuzzy tuning techniques that we previously implemented on the same tool.
Bousi similar to Prolog is an extension of the standard Prolog language aiming at to make more flexible the query answering process and to deal with vagueness applying declarative techniques. In this paper we precise ...
详细信息
ISBN:
(纸本)9783642214981
Bousi similar to Prolog is an extension of the standard Prolog language aiming at to make more flexible the query answering process and to deal with vagueness applying declarative techniques. In this paper we precise a model-theoretic semantics for a pure subset of this language. Next, for the first time, we define a notion of correct answer which provides a declarative description of the output of a program and a goal in the context of a similarity relation. Afterwards, we recall both the WSLDresolution principle and a similarity-based unification algorithm which is the basis of its operational mechanism and then we prove the soundness of WSLD-resolution.
MALP (i.e., the so-called Multi-Adjoint logicprogramming approach) can be seen as a promising fuzzy extension of the popular, pure logic language Prolog, including too a wide repertoire of constructs based on fuzzy l...
详细信息
ISBN:
(纸本)9783642214981
MALP (i.e., the so-called Multi-Adjoint logicprogramming approach) can be seen as a promising fuzzy extension of the popular, pure logic language Prolog, including too a wide repertoire of constructs based on fuzzylogic in order to support uncertainty and approximated reasoning in a natural way. Moreover, the fuzzy logic programming Environment for Research, FLOPER in brief, that we have implemented in our research group, is intended to assists the development of real-world applications written with MALP syntax. Among other capabilities, the system is able to safely translate fuzzy code into Prolog clauses which can be directly executed inside any standard Prolog interpreter in a completely transparent way for the final user. In this fuzzy setting, it is mandatory the use of lattices modeling truth degrees beyond {true;false}. As described in this paper, FLOPER is able to successfully deal (in a very easy way) with sophisticated lattices modeling truth degrees in the real interval [0, 1], also documenting -via declarative traces-the proof procedures followed when solving queries, without extra computational cost.
The FASILL programming language (acronym of "fuzzy Aggregators and Similarity Into a logic Language") combines a weak unification algorithm, based on similarity relations, along with a rich repertoire of fuz...
详细信息
ISBN:
(纸本)9781509060207
The FASILL programming language (acronym of "fuzzy Aggregators and Similarity Into a logic Language") combines a weak unification algorithm, based on similarity relations, along with a rich repertoire of fuzzy connectives and aggregators, whose truth functions can be defined on a complete lattice. In this paper, after recalling the operational semantics of this language, we provide a notion of fuzzy correct answer for a program and a goal and we prove the soundness of FASILL for this operational semantics and the notion of correct answer introduced.
暂无评论