Efficient Unfolding of Fuzzy Connectives for Multi-adjoint Logic Programs

DOI10.1007/978-3-319-74681-4_5zbMath1429.68039OpenAlexW2793276195WikidataQ130571663 ScholiaQ130571663MaRDI QIDQ5214098

Pedro J. Morcillo, Ginés Moreno

Publication date: 7 February 2020

Published in: Interactions Between Computational Intelligence and Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-74681-4_5

zbMATH Keywords

unfoldingconnectivesfuzzy logic programming

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Logic programming (68N17)

Related Items (1)

Extended multi-adjoint logic programming

Uses Software

• XPath
• FRIL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sequentiality in orthogonal term rewriting systems
• Similarity-based unification: A multi-adjoint approach
• Rules + strategies for transforming lazy functional logic programs
• Termination of term rewriting using dependency pairs
• On fuzzy unfolding: A multi-adjoint approach
• Symbolic execution and thresholding for efficiently tuning fuzzy logic programs
• Modeling Interpretive Steps in Fuzzy Logic Computations
• A Transformation System for Developing Recursive Programs
• Term Rewriting and All That
• The size-change principle for program termination
• Optimizing Fuzzy Logic Programs by Unfolding, Aggregation and Folding
• Quantitative Logic Programming Revisited
• Fuzzy Logic and the Resolution Principle
• Programming in Haskell
• SOFSEM 2006: Theory and Practice of Computer Science

This page was built for publication: Efficient Unfolding of Fuzzy Connectives for Multi-adjoint Logic Programs