Towards a rough mereology-based logic for approximate solution synthesis. Part

被引：3

作者：

Komorowski J.A.N. ^{[1
]}

Polkowski L.T. ^{[2
]}

Skowron A. ^{[3
]}

机构：

[1] Department of Computer Systems and Telematics, University of Trondheim

[2] Institute of Mathematics, Warsaw University, 02-097 Warszawa

[3] Institute of Mathematics, Warsaw University of Technology, 00-650 Warszawa

来源：

Studia Logica | 1997年 / 58卷 / 1期

关键词：

Approximate reasoning; Mereology; Rough mereology; Rough sets; Synthesis of complex objects;

D O I：

10.1023/A:1004900200790

中图分类号：

学科分类号：

摘要：

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. © 1997 Kluwer Academic Publishers.

引用

页码：143 / 184

页数：41