liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab. Linköping University, Faculty of Science & Engineering.
2013 (English)In: Fundamenta Informaticae, ISSN 0169-2968, E-ISSN 1875-8681, Vol. 127, no 1-4, 135-149 p.Article in journal (Refereed) Published
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.

Place, publisher, year, edition, pages
IOS Press, 2013. Vol. 127, no 1-4, 135-149 p.
Keyword [en]
approximate reasoning, rough sets, approximation spaces, quantifier elimination, knowledge representation
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-141875DOI: 10.3233/FI-2013-900ISI: 000325745600012Scopus ID: 2-s2.0-84887918359OAI: oai:DiVA.org:liu-141875DiVA: diva2:1148513
Available from: 2017-10-11 Created: 2017-10-11 Last updated: 2017-10-17Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Doherty, PatrickSzalas, Andrzej

Search in DiVA

By author/editor
Doherty, PatrickSzalas, Andrzej
By organisation
Artificial Intelligence and Integrated Computer SystemsFaculty of Science & EngineeringKPLAB - Knowledge Processing Lab
In the same journal
Fundamenta Informaticae
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 62 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf