Symbolic unfolding of multi-adjoint logic programs
From MaRDI portal
Publication:5215752
DOI10.1007/978-3-030-00485-9_5zbMATH Open1430.68026OpenAlexW2897220894WikidataQ130349517 ScholiaQ130349517MaRDI QIDQ5215752FDOQ5215752
Authors: Ginés Moreno, Jaime Penabad, José A. Riaza
Publication date: 13 February 2020
Published in: Trends in Mathematics and Computational Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-00485-9_5
Recommendations
Cites Work
- A Transformation System for Developing Recursive Programs
- Title not available (Why is that?)
- Similarity-based unification: A multi-adjoint approach
- On fuzzy unfolding: A multi-adjoint approach
- Fuzzy Logic and the Resolution Principle
- A First Course in Fuzzy Logic
- Thresholded semantic framework for a fully integrated fuzzy logic language
- Symbolic execution and thresholding for efficiently tuning fuzzy logic programs
Cited In (7)
- Title not available (Why is that?)
- The fuzzy logic programming language FASILL: design and implementation
- Extended multi-adjoint logic programming
- SOFSEM 2006: Theory and Practice of Computer Science
- Right adjoint algebras versus operator left residuated posets
- Efficient Unfolding of Fuzzy Connectives for Multi-adjoint Logic Programs
- Unfolding-based improvements on fuzzy logic programs
Uses Software
This page was built for publication: Symbolic unfolding of multi-adjoint logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215752)