An improved reductant calculus using fuzzy partial evaluation techniques

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 logi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Fuzzy sets and systems Ročník 160; číslo 2; s. 162 - 181
Hlavní autoři: Julián, Pascual, Moreno, Ginés, Penabad, Jaime
Médium: Journal Article Konferenční příspěvek
Jazyk:angličtina
Vydáno: Kidlington Elsevier B.V 16.01.2009
Elsevier
Témata:
Applied sciences
Circuit properties
Computer science; control theory; systems
Control theory. Systems
Digital circuits
Electric, optical and optoelectronic circuits
Electronic circuits
Electronics
Exact sciences and technology
Fuzzy logic programming
Information, signal and communications theory
Mathematical methods
Miscellaneous
Partial evaluation
Reductants
System theory
Telecommunications and information theory
Theoretical computing
Reductants
Partial evaluation
Fuzzy logic programming
Fuzzy system
Optimization method
Programming
Fuzzy set
Implementation
Penalty method
Fuzzy logic
Engineering
Completeness
Information processing
ISSN:0165-0114, 1872-6801
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:0165-0114
1872-6801
DOI:10.1016/j.fss.2008.05.006