Foundations of deductive databases and logic programming
Rules and strategies for transforming functional and logic programs
ACM Computing Surveys (CSUR)
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
A Procedural Semantics for Multi-adjoint Logic Programming
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
Automatic Optimization of Multi-paradigm Declarative Programs
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
An Automatic Composition Algorithm for Functional Logic Programs
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Multi-adjoint Logic Programming with Continuous Semantics
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Rules + strategies for transforming lazy functional logic programs
Theoretical Computer Science
Transformation Rules and Strategies for Functional-Logic Programs: Thesis
AI Communications - CASC
On fuzzy unfolding: A multi-adjoint approach
Fuzzy Sets and Systems
Optimizing Fuzzy Logic Programs by Unfolding, Aggregation and Folding
Electronic Notes in Theoretical Computer Science (ENTCS)
A hybrid programming scheme combining fuzzy-logic and functional-logic resources
Fuzzy Sets and Systems
RFuzzy: An Expressive Simple Fuzzy Compiler
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Information Sciences: an International Journal
Declarative traces into fuzzy computed answers
RuleML'2011 Proceedings of the 5th international conference on Rule-based reasoning, programming, and applications
Programming with fuzzy logic and mathematical functions
WILF'05 Proceedings of the 6th international conference on Fuzzy Logic and Applications
| Hi-index | 0.00 |
Multi-adjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. Inspired by previous approaches largely used in other (crisp) declarative paradigms, in this paper we propose the development of a fold/unfold based transformation system for optimizing such kind of fuzzy logic programs. We prove that our set of transformation rules composed by definition introduction, folding, unfolding and facting, enjoys strong correctness properties (i.e. the semantics of computed substitutions and truth degrees is preserved) and it is able to significantly improve the execution of goals against transformed programs. To the best of our knowledge, this is the first approach to the construction of a complete transformation system in a fuzzy logic setting.