首页 | 本学科首页   官方微博 | 高级检索  
     


Translations and similarity-based logic programming
Authors:M. I. Sessa
Affiliation:(1) DMI-Universita' di Salerno, via S. Allende, 84081 Baronissi (SA), Italy E-mail: mis@unisa.it, IT
Abstract:In order to provide approximate reasoning capabilities, in Gerla G, Sessa MI (1999) Chen G, Ying M, Cai K-Y (Eds) Fuzzy Logic and Soft computing, 19–31, Kluwer Academic Publishers, Boston an extension of Logic Programming has been proposed. Logic programs on function-free languages are considered, and approximate and imprecise information are represented by introducing a similarity relation ? in the set of predicate names and object names of the language. The inference system exploits the classical resolution rule of the Logic Programming paradigm. Moreover, the notion of fuzzy least Herbrand model is also provided. In this paper, by introducing the general notion of structural translation of languages, we generalize these results to the case of logic programs with function symbols. Some properties of the similarity relations are also proven.
Keywords:  Logic Programming  Approximate reasoning  Galois connection  Abstract interpretation  Similarity relation.
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号