Rough Sets based Proofs Visualisation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1999

Rough Sets based Proofs Visualisation


We present here an approach we used for proving important properties of clopen topological spaces. We combine powerful theorem provers techniques (and implementations) with a graphical technique based on a graphical representation of a rough set, called Rough Diagrams. Rough Diagrams are a generalization of a classical notion of Venn Diagrams for algebra of sets to clopen topological spaces. We use them as a powerful automated technique of constructing counter-models of properties the prover has a hard time proving and the user might suspect of being false. It means we propose to add a visual tool to a prover that after some fixed number of prover deductions would start constructing a visual counter-model for a property the prover is trying to prove. A prover with the visual tool is called a visual prover. The visual prover has a completeness property: for any rough set equality we can construct its proof or its counter-model.
Fichier principal
Vignette du fichier
99-R-056.pdf (124.91 Ko) Télécharger le fichier

Dates and versions

inria-00098752 , version 1 (26-09-2006)


  • HAL Id : inria-00098752 , version 1


Laurent Vigneron, Anita Wasilewska. Rough Sets based Proofs Visualisation. 18th International Conference of the North American Fuzzy Information Processing Society - NAFIPS'99, invited session on Granular Computing and Rough Sets, 1999, New York, USA, pp.805-808. ⟨inria-00098752⟩
48 View
113 Download


Gmail Facebook Twitter LinkedIn More