Studia Logica

, Volume 58, Issue 1, pp 143–184

Towards a Rough Mereology-Based Logic for Approximate Solution Synthesis. Part 1

  • Jan Komorowski
  • Lech T. Polkowski
  • Andrzej Skowron

DOI: 10.1023/A:1004900200790

Cite this article as:
Komorowski, J., Polkowski, L.T. & Skowron, A. Studia Logica (1997) 58: 143. doi: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.

approximate reasoningsynthesis of complex objectsrough setsmereologyrough mereology

Copyright information

© Kluwer Academic Publishers 1997

Authors and Affiliations

  • Jan Komorowski
    • 1
  • Lech T. Polkowski
    • 2
  • Andrzej Skowron
    • 3
  1. 1.Department of Computer Systems and TelematicsThe University of TrondheimTrondheimNorway
  2. 2.Institute of MathematicsWarsaw University of TechnologyWarszawaPoland
  3. 3.Institute of MathematicsWarsaw UniversityWarszawaPoland