Satisfiability and Meaning of Formulas and Sets of Formulas in Approximation Spaces

Issue title: Concurrency Specification and Programming (CS&P 2004)

Article type: Research Article

Authors: Gomolińska, Anna

Affiliations: Department of Mathematics, University of Białystok, Akademicka 2, 15267 Białystok, Poland. E-mail: [email protected]

Abstract: 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.

Keywords: information granule, Pawlak information system, approximation space, rough satisfiability/meaning of formulas, rough applicability of a rule

Journal: Fundamenta Informaticae, vol. 67, no. 1-3, pp. 77-92, 2005