Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination
2013 (English)In: Fundamenta Informaticae, ISSN 0169-2968, Vol. 127, no 1-4, 135-149Article in journal (Refereed) Published
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.
approximate reasoning, rough sets, approximation spaces, quantifier elimination, knowledge representation
National CategoryEngineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-100507DOI: 10.3233/FI-2013-900ISI: 000325745600012OAI: oai:DiVA.org:liu-100507DiVA: diva2:662860
Funding Agencies|Swedish Research Council (VR) Linnaeus Center CADICS||ELLIIT Excellence Center at Linkoping-Lund in Information Technology||CUAS project||SSF, the Swedish Foundation for Strategic Research||2013-11-082013-11-082013-11-08