Abstract
We discuss logical connectives on bounded lattices of truth values which allow to model unsharpness inherent when treating information granules. We mainly focus on negation, conjunction, disjunction, and implication operators first for arbitrary bounded lattice in order to elaborate the logical framework. Finally, we deal with particular operations on discrete chains, intervals, interval-valued truthvalue lattices, as well as some particular constructed lattices.
| Original language | English |
|---|---|
| Title of host publication | Handbook of Granular Computing |
| Editors | W. Pedrycz, A. Skowron, V. Kreinovich |
| Place of Publication | Chichester, England |
| Publisher | John Wiley & Sons |
| Pages | 205-224 |
| Number of pages | 20 |
| ISBN (Print) | 978-0-470-03554-2 |
| DOIs | |
| Publication status | Published - 16 Jul 2008 |
Fields of science
- 101 Mathematics
- 101004 Biomathematics
- 101027 Dynamical systems
- 101013 Mathematical logic
- 101028 Mathematical modelling
- 101014 Numerical mathematics
- 101020 Technical mathematics
- 101024 Probability theory
- 102001 Artificial intelligence
- 102003 Image processing
- 102009 Computer simulation
- 102019 Machine learning
- 102023 Supercomputing
- 202027 Mechatronics
- 206001 Biomedical engineering
- 206003 Medical physics
- 102035 Data science