On testing membership to maximal consistent extensions of information systems

Mikhail Moshkov*, Andrzej Skowron, Zbigniew Suraj

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations

Abstract

This paper provides a new algorithm for testing membership to maximal consistent extensions of information systems. A maximal consistent extension of a given information system includes all objects corresponding to known attribute values which are consistent with all true and realizable rules extracted from the original information system. An algorithm presented here does not involve computing any rules, and has polynomial time complexity. This algorithm is based on a simpler criterion for membership testing than the algorithm described in [4]. The criterion under consideration is convenient for theoretical analysis of maximal consistent extensions of information systems.

Original languageEnglish (US)
Title of host publicationRough Sets and Current Trends in Computing - 5th International Conference, RSCTC 2006, Proceedings
PublisherSpringer Verlag
Pages85-90
Number of pages6
ISBN (Print)3540476938, 9783540476931
DOIs
StatePublished - Jan 1 2006
Event5th International Conference on Rough Sets and Current Trends in Computing, RSCTC 2006 - Kobe, Japan
Duration: Nov 6 2006Nov 8 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4259 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th International Conference on Rough Sets and Current Trends in Computing, RSCTC 2006
CountryJapan
CityKobe
Period11/6/0611/8/06

Keywords

  • Information systems
  • Maximal consistent extensions
  • Rough sets

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this