Sökning: onr:"swepub:oai:DiVA.org:liu-100507" >
Automated Generatio...
Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination
-
- Doherty, Patrick (författare)
- Linköpings universitet,Artificiell intelligens och integrerade datorsystem,Tekniska högskolan
-
- Szalas, Andrzej (författare)
- Linköpings universitet,Artificiell intelligens och integrerade datorsystem,Tekniska högskolan,University of Warsaw, Poland
-
(creator_code:org_t)
- IOS Press, 2013
- 2013
- Engelska.
-
Ingår i: Fundamenta Informaticae. - : IOS Press. - 0169-2968 .- 1875-8681. ; 127:1-4, s. 135-149
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.3...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Nyckelord
- approximate reasoning
- rough sets
- approximation spaces
- quantifier elimination
- knowledge representation
- TECHNOLOGY
- TEKNIKVETENSKAP
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas