Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination

  • Authors:

  • Patrick Doherty;Andrzej Szałas

  • Affiliations:

  • Department of Computer and Information Science, Linköping University, Linköping, Sweden. patrick.doherty@liu.se;Institute of Informatics, University of Warsaw, Poland and Department of Computer and Information Science, Linköping University, Linköping, Sweden. andrzej.szalas@{mimuw.edu.pl, liu.se}

  • Venue:
  • Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper focuses on approximate reasoning based on the use of approximation spaces. Approximation spaces and the approximated relations induced by them are a generalization of the rough set-based approximations of Pawlak. Approximation spaces are used to define neighborhoods around individuals and rough inclusion functions. These in turn are used to define approximate sets and relations. In any of the approaches, one would like to embed such relations in an appropriate logical theory which can be used as a reasoning engine for specific applications with specific constraints. We propose a framework which permits a formal study of the relationship between properties of approximations and properties of approximation spaces. Using ideas from correspondence theory, we develop an analogous framework for approximation spaces. We also show that this framework can be strongly supported by automated techniques for quantifier elimination.