Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Foundations of deductive databases and logic programming
A fuzzy Prolog database system
A fuzzy Prolog database system
Fuzzy sets and fuzzy logic: theory and applications
Fuzzy sets and fuzzy logic: theory and applications
Rules and strategies for transforming functional and logic programs
ACM Computing Surveys (CSUR)
A first course in fuzzy logic
Fuzzy Logic and the Resolution Principle
Journal of the ACM (JACM)
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
Fril- Fuzzy and Evidential Reasoning in Artificial Intelligence
Fril- Fuzzy and Evidential Reasoning in Artificial Intelligence
Algebraic Properties of Idempotent Substitutions
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Soundness and Completeness of Non-classical SLD-Resolution
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
Rules + strategies for transforming lazy functional logic programs
Theoretical Computer Science
Prolog-ELF incorporating fuzzy logic
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Hi-index | 0.00 |
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.