The concept of a supercompiler
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Foundations of deductive databases and logic programming
A fuzzy Prolog database system
A fuzzy Prolog database system
Partial evaluation in logic programming
Journal of Logic Programming
Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Tutorial on specialisation of logic programs
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Tutorial notes on partial evaluation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Specialization of lazy functional logic programs
PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Partial evaluation of functional logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Approximate reasoning by similarity-based SLD resolution
Theoretical Computer Science
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Tabling for non-monotonic programming
Annals of Mathematics and Artificial Intelligence
An Introduction to Partial Deduction
META-92 Proceedings of the 3rd International Workshop on Meta-Programming in Logic
Partial Deduction and Driving are Equivalent
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
Controlling Conjunctive Partial Deduction
PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
A Uniform Approach for Compile-Time and Run-Time Specialization
Selected Papers from the Internaltional Seminar on Partial Evaluation
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
Efficient Reductants Calculi using Partial Evaluation Techniques with Thresholding
Electronic Notes in Theoretical Computer Science (ENTCS)
Prolog-ELF incorporating fuzzy logic
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
On fuzzy unfolding: A multi-adjoint approach
Fuzzy Sets and Systems
Query answering in normal logic programs under uncertainty
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
On the Declarative Semantics of Multi-Adjoint Logic Programs
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
A practical management of fuzzy truth-degrees using FLOPER
RuleML'10 Proceedings of the 2010 international conference on Semantic web rules
Fuzzy computed answers collecting proof information
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Declarative traces into fuzzy computed answers
RuleML'2011 Proceedings of the 5th international conference on Rule-based reasoning, programming, and applications
A comparative study of adjoint triples
Fuzzy Sets and Systems
Hi-index | 0.20 |
Partial evaluation (PE) is an automatic program transformation technique aiming to obtain, among other advantages, the optimization of a program with respect to parts of its input: hence, it is also known as program specialization. This paper introduces the subject of PE into the field of fuzzy logic programming. We define the concept of PE for multi-adjoint logic programs and goals, and apart from discussing the benefits achieved by this technique, we also introduce in the fuzzy setting a completely novel application of PE which allows us the computation of reductants guaranteeing completeness properties without harming the computational efficiency. Reductants are a special kind of fuzzy rules which constitute an essential theoretical tool for proving correctness properties. As observed in the specialized literature, a multi-adjoint logic program, when interpreted on a partially ordered lattice, has to include all its reductants in order to preserve the (approximate) completeness property. This introduces severe penalties in the implementation of efficient multi-adjoint logic programming systems: not only the size of programs increases but also their execution time. In this paper we define a refinement to the notion of reductant based on PE techniques, that we call PE-reductant. We establish the main properties of PE-reductants (i.e., the classical concept of reductant and the new notion of PE-reductant are both, semantically and operationally, equivalent) and, what is the best, we demonstrate that our refined notion of PE-reductant is even able to increase the efficiency of multi-adjoint logic programs.