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

  • Authors:
  • Anna Gomolińska

  • Affiliations:
  • Department of Mathematics, University of Białystok, Akademicka 2, 15267 Białystok, Poland. E-mail: anna.gom@math.uwb.edu.pl

  • Venue:
  • Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.