Lazy evaluations in Lukasiewicz type fuzzy logic

Simple item page
dc.contributor.authorNagy, Benedek
dc.contributor.authorBasbous, Raed
dc.contributor.authorTajti, Tibor
dc.date.accessioned2026-02-06T18:38:10Z
dc.date.issued2019
dc.departmentDoğu Akdeniz Üniversitesi
dc.description.abstractLazy evaluations are playing important roles in various fields of computer science including hardware design, programming, decision making. In this paper one of the most known and used fuzzy logic system, the Lukasiewicz logic is considered. Pruning algorithms are presented to quicken the evaluations of logical formulae in Lukasiewicz logic by cutting out those branches of the formula tree that have no influence on the final result for some reasons. Correctness of the algorithm is also proven. (C) 2018 Elsevier B.V. All rights reserved.
dc.identifier.doi10.1016/j.fss.2018.11.014
dc.identifier.endpage151
dc.identifier.issn0165-0114
dc.identifier.issn1872-6801
dc.identifier.orcid0000-0001-8057-2962
dc.identifier.scopus2-s2.0-85057220548
dc.identifier.scopusqualityQ1
dc.identifier.startpage127
dc.identifier.urihttps://doi.org/10.1016/j.fss.2018.11.014
dc.identifier.urihttps://hdl.handle.net/11129/12802
dc.identifier.volume376
dc.identifier.wosWOS:000487642200005
dc.identifier.wosqualityQ1
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherElsevier
dc.relation.ispartofFuzzy Sets and Systems
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.subjectNon-classical logics
dc.subjectPruning algorithms
dc.subjectFormula trees
dc.subjectFast evaluation
dc.subjectFuzzy logic
dc.subjectMany valued logic
dc.subjectLazy evaluations
dc.titleLazy evaluations in Lukasiewicz type fuzzy logic
dc.typeArticle

Files

Collections

WoS Indexed Publications Collection
Scopus İndeksli Yayınlar Koleksiyonu