Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Foundations of deductive databases and logic programming
Rules and strategies for transforming functional and logic programs
ACM Computing Surveys (CSUR)
A first course in fuzzy logic
Likelog: a logic programming language for flexible data retrieval
Proceedings of the 1999 ACM symposium on Applied computing
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
Algebraic Properties of Idempotent Substitutions
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
A Comparative Revisitation of Some Program Transformation Techniques
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)
Measuring the Interpretive Cost in Fuzzy Logic Computations
WILF '07 Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory
Formal concept analysis via multi-adjoint concept lattices
Fuzzy Sets and Systems
An improved reductant calculus using fuzzy partial evaluation techniques
Fuzzy Sets and Systems
Optimizing Fuzzy Logic Programs by Unfolding, Aggregation and Folding
Electronic Notes in Theoretical Computer Science (ENTCS)
Programming with Fuzzy Logic Rules by Using the FLOPER Tool
RuleML '08 Proceedings of the International Symposium on Rule Representation, Interchange and Reasoning on the Web
A hybrid programming scheme combining fuzzy-logic and functional-logic resources
Fuzzy Sets and Systems
Modeling Interpretive Steps in Fuzzy Logic Computations
WILF '09 Proceedings of the 8th International Workshop on Fuzzy Logic and Applications
Thresholded Tabulation in a Fuzzy Logic Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
Multi-adjoint t-concept lattices
Information Sciences: an International Journal
On multi-adjoint concept lattices: definition and representation theorem
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
Towards multi-adjoint property-oriented concept lattices
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
A practical management of fuzzy truth-degrees using FLOPER
RuleML'10 Proceedings of the 2010 international conference on Semantic web rules
Information Sciences: an International Journal
A static preprocess for improving fuzzy thresholded tabulation
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
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
Building a fuzzy transformation system
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Multi-adjoint property-oriented and object-oriented concept lattices
Information Sciences: an International Journal
A comparative study of adjoint triples
Fuzzy Sets and Systems
An unfolding-based preprocess for reinforcing thresholds in fuzzy tabulation
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advances in computational intelligence - Volume Part I
Hi-index | 0.20 |
In the context of (fuzzy) logic programs, 'unfolding' means to transform a program rule by replacing an atom call of the body (of that rule) by its definition. Unfolding is a semantics-preserving program transformation technique that is able to improve programs, generating more efficient code, since it anticipates computation steps. Unfolding is the basis for developing sophisticated and powerful programming tools, such as fold/unfold transformation systems or partial evaluators. In this paper we address the problem of extending the classical definition of the unfolding rule (for pure logic programs) to the setting of multi-adjoint logic programming, where a fuzzy computed answer is a pair computed by a fuzzy generalization of the modus ponens inference rule. Our main contributions can be summarized as follows:*We proved the independence of the computation rule for multi-adjoint admissible computations. *Moreover, we defined a fuzzy unfolding rule and we demonstrated its strong correctness properties, that is, original and unfolded programs compute the same fuzzy computed answers for a given goal. *We also proved that unfolding transformations increase the efficiency of the residual programs, by reducing the length of fuzzy admissible derivations when solving goals.