Operational/Interpretive Unfolding of Multi-adjoint Logic Programs

dc.creatorJulián,Pascual
dc.creatorMoreno,Ginés
dc.creatorPenabad,Jaime
dc.date2006
dc.date.accessioned2024-02-06T12:54:58Z
dc.date.available2024-02-06T12:54:58Z
dc.descriptionMulti-adjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of a goal w.r.t. a given program is done in two separate phases. During the operational one, admissible steps are systematically applied in a similar way to classical resolution steps in pure logic programming, thus returning a computed substitution together with an expression where all atoms have been exploited. This last expression is then interpreted under a given lattice during the so called interpretive phase, hence returning a value which represents the fuzzy component (truth degree) of the computed answer. On the other hand, unfolding is a well known transformation rule widely used in declarative programming for optimizing and specializing programs, among other applications. In essence, it is usually based on the application of operational steps on the body of program rules. The novelty of this paper consists in showing that this process can also be made in terms of interpretive steps. We present two strongly related kinds of unfolding (operational and interpretive), which, apart from exhibiting strong correctness properties (i.e. they preserve the semantics of computed substitutions and truth degrees) they are able to significantly simplify the two execution phases when solving goals.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-012-11-1679
dc.identifierhttps://lib.jucs.org/article/28706/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/9201
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 12(11): 1679-1699
dc.subjectfuzzy logic programming
dc.subjectprogram transformation
dc.subjectunfolding
dc.titleOperational/Interpretive Unfolding of Multi-adjoint Logic Programs
dc.typeResearch Article
Файлы
Коллекции