LiU Electronic Press
Full-text not available in DiVA
Author:
Doherty, Patrick (Linköping University, Department of Computer and Information Science, Artificial Intelligence and Intergrated Computer systems) (Linköping University, The Institute of Technology)
Szalas, Andrzej (University of Warsaw, Poland )
Title:
Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination
Department:
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Intergrated Computer systems
Linköping University, The Institute of Technology
Publication type:
Article in journal (Refereed)
Language:
English
Publisher: IOS Press
Status:
Published
In:
Fundamenta Informaticae(ISSN 0169-2968)
Volume:
127
Issue:
1-4
Pages:
135-149
Year of publ.:
2013
URI:
urn:nbn:se:liu:diva-100507
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-100507
ISI:
000325745600012
Subject category:
Engineering and Technology
SVEP category:
TECHNOLOGY
Keywords(en) :
approximate reasoning, rough sets, approximation spaces, quantifier elimination, knowledge representation
Abstract(en) :

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.

Note:

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||

Available from:
2013-11-08
Created:
2013-11-08
Last updated:
2013-11-08
Statistics:
8 hits