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
Specialization of lazy functional logic programs
PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
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
Tabling for non-monotonic programming
Annals of Mathematics and Artificial Intelligence
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
A practical management of fuzzy truth-degrees using FLOPER
RuleML'10 Proceedings of the 2010 international conference on Semantic web rules
Declarative traces into fuzzy computed answers
RuleML'2011 Proceedings of the 5th international conference on Rule-based reasoning, programming, and applications
Hi-index | 0.00 |
Fuzzy logic programming represents a flexible and powerful declarative paradigm amalgamating fuzzy logic and logic programming, for which there exists different promising approaches described in the literature. In this paper we propose an improved fuzzy query answering procedure for the so called multi-adjoint logic programming approach, which avoids the re-evaluation of goals and the generation of useless computations thanks to the combined use of tabulation with thresholding techniques. The general idea is that, when trying to perform a computation step by using a given program rule R, we firstly analyze if such step might contribute to reach further significant solutions (non tabulated yet). When it is the case, it is possible to avoid a useless computation step via a rule R by using thresholds and filters based on the truth degree of R, as well as a safe, accurate and dynamic estimation of the maximum truth degree associated to its body.