A logic for reasoning about probabilities
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Variable precision rough set model
Journal of Computer and System Sciences
Tolerance approximation spaces
Fundamenta Informaticae - Special issue: rough sets
Knowledge discovery by application of rough set models
Rough set methods and applications
Rough sets and rough logic: a KDD perspective
Rough set methods and applications
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Towards Discovery of Information Granules
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems
Rough Consequence and Rough Algebra
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Irrelevance and conditioning in first-order probabilistic logic
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Approximation spaces and information granulation
Transactions on Rough Sets III
Galois Connections and Data Analysis
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
A Graded Meaning of Formulas in Approximation Spaces
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Rough Sets and Infomorphisms: Towards Approximation of Relations in Distributed Environments
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
A Comparative Study of Some Generalized Rough Approximations
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
Towards an Ontology of Approximate Reason
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
Satisfiability of Formulas from the Standpoint of Object Classification: The RST Approach
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Nearness of Objects: Extension of Approximation Space Model
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Development of Near Sets Within the Framework of Axiomatic Fuzzy Sets
Fundamenta Informaticae
Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Hi-index | 0.00 |
In this paper, we study general notions of satisfiability and meaning of formulas and sets of formulas in approximation spaces. Rather than proposing one particular form of rough satisfiability and meaning, we present a number of alternative approaches. Approximate satisfiability and meaning are important, among others, for modelling of complex systems like systems of adaptive social agents. Finally, we also touch upon derivative concepts of meaning and applicability of rules.