Studia Logica

, Volume 58, Issue 1, pp 143-184

First online:

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

  • Jan KomorowskiAffiliated withDepartment of Computer Systems and Telematics, The University of Trondheim
  • , Lech T. PolkowskiAffiliated withInstitute of Mathematics, Warsaw University of Technology
  • , Andrzej SkowronAffiliated withInstitute of Mathematics, Warsaw University

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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 reasoning synthesis of complex objects rough sets mereology rough mereology