Efficient Unfolding of Fuzzy Connectives for Multi-adjoint Logic Programs

DOI10.1007/978-3-319-74681-4_5MaRDI QIDQ5214098zbMATH OpenOpenAlexWikidataFDO

Authors 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

connectivesfuzzy logic programmingunfolding

Mathematics Subject Classification ID

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

Recommendations

• Optimizing fuzzy logic programs by unfolding, aggregation and folding
• Symbolic unfolding of multi-adjoint logic programs
• Unfolding-based improvements on fuzzy logic programs
• Fuzzy logic programming via multilattices
• scientific article; zbMATH DE number 1884400
• Two formalisms of extended possibilistic logic programming with context-dependent fuzzy unification: a comparative description

Cites work

• A narrowing-based instantiation rule for rewriting-based fold/unfold transformations
• A Transformation System for Developing Recursive Programs
• Fuzzy Logic and the Resolution Principle
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 2085246 (Why is no real title available?)
• scientific article; zbMATH DE number 1884400 (Why is no real title available?)
• Modeling Interpretive Steps in Fuzzy Logic Computations
• On fuzzy unfolding: A multi-adjoint approach
• Optimizing fuzzy logic programs by unfolding, aggregation and folding
• Programming in Haskell
• Quantitative Logic Programming Revisited
• Rules + strategies for transforming lazy functional logic programs
• Sequentiality in orthogonal term rewriting systems
• Similarity-based unification: A multi-adjoint approach
• SOFSEM 2006: Theory and Practice of Computer Science
• Symbolic execution and thresholding for efficiently tuning fuzzy logic programs
• Term Rewriting and All That
• Termination of term rewriting using dependency pairs
• The size-change principle for program termination

Cited in

(10)

• Extended multi-adjoint logic programming
• On fuzzy unfolding: A multi-adjoint approach
• Unfolding-based improvements on fuzzy logic programs
• Efficient reductants calculi using partial evaluation techniques with thresholding
• Measuring the Interpretive Cost in Fuzzy Logic Computations
• Modeling Interpretive Steps in Fuzzy Logic Computations
• Symbolic unfolding of multi-adjoint logic programs
• Optimizing fuzzy logic programs by unfolding, aggregation and folding
• SOFSEM 2006: Theory and Practice of Computer Science
• Seeking a safe and efficient similarity-based unfolding rule

Describes a project that uses

Uses Software

• XPath
• FRIL

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5214098)