检索结果-内蒙古大学图书馆

5th International Symposium on Rules: Research Based and Industry Focused (RuleML 2011)

作者： Morcillo, Pedro-Jose Moreno, Gines Penabad, Jaime Vazquez, Carlos Univ Castilla La Mancha Fac Comp Sci Engn Albacete 2071 Spain

ISBN: (纸本)9783642225451;9783642225468

fuzzy logic programming is a growing declarative paradigm aiming to integrate fuzzy logic into logic programming. In this setting, the so-called Multi-Adjoint logic programming approach, MALP in brief, represents an extremely flexible fuzzy language for which we are developing the FLOPER tool (fuzzy logic programming Environment for Research). Currently, the platform is useful for compiling (to standard Prolog code), executing and debugging fuzzy programs in a safe way and it is ready for being extended in the near future with powerful transformation and optimization techniques designed in our research group in the recent past. In this paper, we focus in a nice property of the system regarding its ability for easily collecting declarative traces at execution time, without modifying the underlying procedural principle. The clever point is the use of lattices modeling truth degrees (beyond {true, false}) enriched with constructs for directly visualizing on fuzzy computed answers not only the sequence of program rules exploited when reaching solutions, but also the set of evaluated fuzzy connectives together with the sequence of primitive (arithmetic) operators they call, thus giving a detailed description of their computational complexities.

关键词： fuzzy logic programming Declarative Traces Lattices

来源：评论

学校读者我要写书评

暂无评论

A Declarative Semantics for Bousi∼Prolog.

A Declarative Semantics for Bousi∼Prolog.

引用

11th International ACM SIGPLAN Symposium on Principles and Practice of Declarative programming (PPDP 09)

作者： Julian-Iranzo, Pascual Rubio-Manzano, Clemente Univ Castilla La Mancha Dep Informat Technol & Syst E-13071 Ciudad Real Spain

ISBN: (纸本)9781605585680

Bousi similar to Prolog is a fuzzy logic programming language with an operational semantics which is an adaptation of the SLD resolution principle, where classical unification has been replaced by a fuzzy unification algorithm based on proximity relations. Hence, it is a programming language well suited for dealing with uncertainty and approximate reasoning. There are several practical applications where Bousi similar to Prolog can be useful: flexible query answering;advanced pattern matching;information retrieval where textual information is selected or analyzed using an ontology;text cataloging and analysis;etc. In this paper we give a model-theoretic semantics for a pure subset of this language: we formalize the notion of least fuzzy Herbrand model as the declarative semantics for definite programs. We prove various important properties of these models. Finally we define an immediate consequences operator, which is proved monotonous and continuous, obtaining a fixpoint characterization of the least fuzzy Herbrand model.

关键词： fuzzy logic programming Declarative Semantics fuzzy Herbrand Model Fixpoint Semantics Proximity Relations

来源：评论

学校读者我要写书评

暂无评论

The Stable Model Semantics of Normal fuzzy Linguistic logic Programs 11th

The Stable Model Semantics of Normal Fuzzy Linguistic Logic ...

引用

11th International Conference on Computational Collective Intelligence (ICCCI)

作者： Van Hung Le Hanoi Univ Min & Geol Fac Informat Technol Hanoi Vietnam

ISBN: (纸本)9783030283773;9783030283766

fuzzy linguistic logic programming is a framework for representing and reasoning with linguistically-expressed human knowledge. It is well known that allowing the representation and the manipulation of negation is an important feature for many real-world applications. In this work, we extend the framework by allowing negation connectives to occur in rule bodies, resulting in normal fuzzy linguistic logic programs, and study the stable model semantics of such logic programs.

关键词： fuzzy logic programming Stable model Hedge algebra

来源：评论

学校读者我要写书评

暂无评论

A Proximity-Based Method for Discovery of Generalized Knowledge and Its Incorporation to the Bousi∼Prolog System

A Proximity-Based Method for Discovery of Generalized Knowle...

引用

12th International Work-Conference on Artificial Neural Networks (IWANN)

作者： Julian-Iranzo, Pascual Rubio-Manzano, Clemente Univ Castilla La Mancha Dept Informat Technol & Syst E-13071 Ciudad Real Spain Univ Bio Bio Dept Informat Syst Concepcion Chile

ISBN: (纸本)9783642386817

In this work, a proximity-based generic method for discovery of generalized knowledge is presented and implemented in the framework of a fuzzy logic programming language with a weak unification procedure that uses proximity relations to model uncertainty. This method makes use of the concept of lambda-block characterizing the notion of equivalence when working with proximity relations. When the universe of discourse is composed of concepts which are related by proximity, the sets of lambda-blocks extracted from that proximity relation can be seen as hierarchical sets of concepts grouped by abstraction level. Then, each group (forming a lambda-block) can be labeled, with user help, by way of a more general descriptor in order to simulate a generalization process based on proximity. Thanks to this process, the system can learn concepts that were unknown initially and reply queries that it was not able to answer. The novelty of this work is that it is the first time a method, with analogous features to the one aforementioned, has been implemented inside a fuzzy logic programming framework. In order to check the feasibility of the method we have developed a software tool which have been integrated into the Bousk similar to Prolog system.

关键词： fuzzy logic programming Proximity/Similarity Relations Discovery of Generalized Knowledge

来源：评论

学校读者我要写书评

暂无评论

Revisiting Reductants in the Multi-adjoint logic programming Framework

Revisiting Reductants in the Multi-adjoint Logic Programming...

引用

14th European Conference on logics in Artificial Intelligence (JELIA)

作者： Julian-Iranzo, Pascual Medina, Jesus Ojeda-Aciego, Manuel Univ Castilla La Mancha Dept Informat Technol & Syst E-13071 Ciudad Real Spain Univ Cadiz Dept Matemat Cadiz Spain Univ Malaga Dept Matemat Aplicada Malaga Spain

ISBN: (纸本)9783319115580;9783319115573

In this work, after revisiting the different notions of reductant arisen in the framework of multi-adjoint logic programming and akin frameworks, we introduce a new, more adequate, notion of reductant in the context of multi-adjoint logic programs. We study some of its properties and its relationships with other notions of reductants.

关键词： fuzzy logic programming Multi-adjoint logic programming Reductants

来源：评论

学校读者我要写书评

暂无评论

A completeness theorem for multi-adjoint logic programming

A completeness theorem for multi-adjoint logic programming

引用

10th IEEE International Conference on fuzzy Systems

作者： Medina, J Ojeda-Aciego, M Vojtás, P Univ Malaga Dept Matemat Aplicada E-29071 Malaga Spain

ISBN: (纸本)078037293X

Multi-adjoint logic programs generalise monotonic and residuated logic programs [1] in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. As our approach has continuous fixpoint semantics, in this work, a procedural semantics is given for the paradigm of multi-adjoint logic programming and a completeness result is proved. Some applications which could benefit from this theoretical approach, such as threshold computation, fuzzy databases and general fuzzy resolution, are commented on.

关键词： approximate reasoning fuzzy logic programming completeness results continuous fix-point semantics

来源：评论

学校读者我要写书评

暂无评论

Some properties of substitutions in the framework of similarity relations

引用

fuzzy SETS AND SYSTEMS 2023年 465卷

作者： Julian-Iranzo, Pascual Moreno, Gines Riaza, Jose Antonio UCLM Dept Technol & Informat Syst Ciudad Real 13071 Spain UCLM Dept Comp Syst Albacete 02071 Spain

A substitution is a mapping from variables to terms. There is a consensus in the logic programming community that the work with substitutions is a source of errors due to their poor algebraic properties. This problem increases when we manipulate substi-tutions in the framework of similarity relations, where some classical concepts have more complex definitions and the intuition of the result of the operations involving them is easily *** this work we analyze some algebraic properties of substitutions in the framework of similarity relations. Specifically, we study the lattice structure of the set of idempotent substitutions with the definition of the weak parallel composition and weak parallel factorization operations, acting as the join and meet of the lattice. Also we relate these operations with the classical operation of composition of substitutions. The aim is to provide fuzzy logic programming researchers with reasoning tools with richer properties that facilitate formal proofs and, even, able to define compositional and parallel semantics.(c) 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http:// creativecommons .org /licenses /by -nc -nd /4 .0/).

关键词： Substitutions Similarity relations Weak unification Weak parallel composition Weak anti-unification Weak parallel factorization fuzzy logic programming

来源：评论

学校读者我要写书评

暂无评论

Seeking a safe and efficient similarity-based unfolding rule

引用

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING 2023年 163卷

作者： Julian-Iranzo, Pascual Moreno, Gines Riaza, Jose Antonio UCLM Dept Technol & Informat Syst Ciudad Real 13071 Spain UCLM Dept Comp Syst Albacete 02071 Spain

The unfolding transformation has been widely used in many declarative frameworks for improving the efficiency of programs. Inspired by our previous experiences in fuzzy logic languages that do not deal with similarity relations, in this work we try to adapt such operation to the framework of the fuzzy logic programming language FASILL (acronym of "fuzzy Aggregators and Similarity Into a logic Language") which has been developed in our research group for coping with implicit/explicit truth degree annotations, a great variety of connectives and unification by similarity. The traditional unfolding transformation is based on the application of unifiers on the heads and computational steps on the bodies of program rules. However, when considering similarity relations, the premature generation and application of weak (similarity-based) unifiers at unfolding time could destroy the correctness (i.e., the soundness and completeness) of the transformation. In this paper we study how to avoid the risk, by imposing some conditions on programs in order to be safely unfolded. We show that these conditions are sufficient to guarantee the correctness of the unfolding transformation, and we present some experiments performed with the implemented online tool for illustrating the improved efficiency of unfolded programs.

关键词： fuzzy logic programming Similarity relations Unfolding

来源：评论

学校读者我要写书评

暂无评论

Unfolding-based Improvements on fuzzy logic Programs

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2005年第1期137卷 69-103页

作者： Julian, Pascual Moreno, Gines Penabad, Jaime Univ Castilla La Mancha ESI Dept Comp Sci Paseo Univ 4 E-13071 Ciudad Real Spain Univ Castilla La Mancha EPSA Dept Comp Sci Albacete 02071 Spain

Unfolding is a semantics-preserving program transformation technique that consists in the expansion of subexpressions of a program using their own definitions. In this paper we define two unfolding-based transformation rules that extend the classical definition of the unfolding rule (for pure logic programs) to a fuzzy logic setting. We use a fuzzy variant of Prolog where each program clause can be interpreted under a different (fuzzy) logic. We adapt the concept of a computation rule, a mapping that selects the subexpression of a goal involved in a computation step, and we prove the independence of the computation rule. We also define a basic transformation system and we demonstrate its strong correctness, that is, original and transformed programs compute the same fuzzy computed answers. Finally, we prove that our transformation rules always produce an improvement in the efficiency of the residual program, by reducing the length of successful fuzzy SLD-derivations.

关键词： fuzzy logic programming Program Transformation

来源：评论

学校读者我要写书评

暂无评论

A Cloud Scheduler Assisted by a fuzzy Affinity-Aware Engine

A Cloud Scheduler Assisted by a Fuzzy Affinity-Aware Engine

引用

IEEE International Conference on fuzzy Systems

作者： Carlos Vázquez Ginés Moreno Luis Tomás Johan Tordsson Department of Computing Systems University of Castilla-La Mancha Spain Department of Computing Science Ume? University Sweden

ISBN: (纸本)9781467374293

Recent advances on declarative paradigms have introduced expressive resources based on fuzzy logic. These are very useful for increasing the flexibility of the so-called fuzzy logic programming paradigm, resulting in highly expressive languages where the treatment of uncertainty and approximate reasoning is performed in a natural, efficient way. Therefore, making it extremely useful for decision-making scenarios dealing with high levels of uncertainty. One such scenario is capacity management in cloud environments, where the amount of resources that users will request is unknown and can vary significantly over time, usually leading to poor resource utilization. Overbooking techniques allow cloud providers to increase utilization, but the risk of degrading application performance due to exhausting resources also increases as applications need to share the servers. fuzzy logic programming can be used to decide how cloud applications should be co-located with each other, minimizing the interference among them. Therefore, we propose a new scheduling mechanism based on fuzzy logic cores clustering, and applications-cores affinity estimation to decide which applications to co-locate reducing the interference. An experimental evaluation confirms that our affinity-aware fuzzy logic assisted scheduler minimizes the interference among applications, enabling a more safe overbooking and consequently higher cloud provider revenue.

关键词： Cloud Computing Clustering fuzzy logic programming In-Server Scheduling Overbooking Cloud Computing fuzzy logic CLOUDS Clouds Cluster Analysis scheduler program Soft computing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：