loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
5th International Conference on Intelligent Systems Design and Applications (ISDA'05)
Some Remarks on Computing Consistent Extensions of Dynamic Information Systems
Wroclaw, Poland
September 08-September 10
ISBN: 0-7695-2286-6
ASCII Text
x 
 
Zbigniew Suraj, Krzysztof Pancerz, "Some Remarks on Computing Consistent Extensions of Dynamic Information Systems," Intelligent Systems Design and Applications, International Conference on, pp. 420-425, 5th International Conference on Intelligent Systems Design and Applications (ISDA'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ISDA.2005.84,
author = {Zbigniew Suraj and Krzysztof Pancerz},
title = {Some Remarks on Computing Consistent Extensions of Dynamic Information Systems},
journal ={Intelligent Systems Design and Applications, International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2286-6},
pages = {420-425},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISDA.2005.84},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Intelligent Systems Design and Applications, International Conference on
TI - Some Remarks on Computing Consistent Extensions of Dynamic Information Systems
SN - 0-7695-2286-6
SP420
EP425
A1 - Zbigniew Suraj,
A1 - Krzysztof Pancerz,
PY - 2005
KW - null
VL - 0
JA - Intelligent Systems Design and Applications, International Conference on
ER -
 
Zbigniew Suraj, University of Information Technology andManagement, Rzeszow, Poland
Krzysztof Pancerz, University of Information Technology andManagement, Rzeszow, Poland
The aim of this paper is to present some remarks on computingmaximal consistent extensions of dynamic information systems.Dynamic information systems can be used as a tool for description of concurrent systems. In this case, they include the knowledge about global states and transitions between them observed in given concurrent systems. The task of creating a maximal consistent extension is to find all global states and all transitions between them which are consistent with the knowledge included in data tables representing a dynamic information system. A method for computing such an extension is given. The method presented here seems to be more ef- ficient than methods presented earlier in the literature. Our approach is based on the rough set theory.
Citation:
Zbigniew Suraj, Krzysztof Pancerz, "Some Remarks on Computing Consistent Extensions of Dynamic Information Systems," isda, pp.420-425, 5th International Conference on Intelligent Systems Design and Applications (ISDA'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.