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


Towards a Rough Mereology-Based Logic for Approximate Solution Synthesis. Part 1
Authors:Komorowski  Jan  Polkowski  Lech T.  Skowron  Andrzej
Affiliation:(1) Department of Computer Systems and Telematics, The University of Trondheim, N-7034 Trondheim, Norway;(2) Institute of Mathematics, Warsaw University of Technology, Pl. Politechniki 1, 00-650 Warszawa, Poland;(3) Institute of Mathematics, Warsaw University, Banacha 2, 02-097 Warszawa, Poland
Abstract:We are concerned with formal models of reasoning under uncertainty. Many approaches to this problem are known in the literature e.g. Dempster-Shafer theory [29], [42], bayesian-based reasoning [21], [29], belief networks [29], many-valued logics and fuzzy logics [6], non-monotonic logics [29], neural network logics [14]. We propose rough mereology developed by the last two authors [22-25] as a foundation for approximate reasoning about complex objects. Our notion of a complex object includes, among others, proofs understood as schemes constructed in order to support within our knowledge assertions/hypotheses about reality described by our knowledge incompletely.
Keywords:approximate reasoning  synthesis of complex objects  rough sets  mereology  rough mereology
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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