Rough Sets based Proofs Visualisation
Identifieur interne : 00A488 ( Main/Exploration ); précédent : 00A487; suivant : 00A489Rough Sets based Proofs Visualisation
Auteurs : Laurent Vigneron ; Anita WasilewskaSource :
English descriptors
- KwdEn :
Abstract
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.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 002527
- to stream Crin, to step Curation: 002527
- to stream Crin, to step Checkpoint: 001D33
- to stream Main, to step Merge: 00AB39
- to stream Main, to step Curation: 00A488
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="91">Rough Sets based Proofs Visualisation</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:vigneron99a</idno>
<date when="1999" year="1999">1999</date>
<idno type="wicri:Area/Crin/Corpus">002527</idno>
<idno type="wicri:Area/Crin/Curation">002527</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002527</idno>
<idno type="wicri:Area/Crin/Checkpoint">001D33</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001D33</idno>
<idno type="wicri:Area/Main/Merge">00AB39</idno>
<idno type="wicri:Area/Main/Curation">00A488</idno>
<idno type="wicri:Area/Main/Exploration">00A488</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Rough Sets based Proofs Visualisation</title>
<author><name sortKey="Vigneron, Laurent" sort="Vigneron, Laurent" uniqKey="Vigneron L" first="Laurent" last="Vigneron">Laurent Vigneron</name>
</author>
<author><name sortKey="Wasilewska, Anita" sort="Wasilewska, Anita" uniqKey="Wasilewska A" first="Anita" last="Wasilewska">Anita Wasilewska</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>automated deduction</term>
<term>rough diagrams</term>
<term>rough sets</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="2085">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.</div>
</front>
</TEI>
<affiliations><list></list>
<tree><noCountry><name sortKey="Vigneron, Laurent" sort="Vigneron, Laurent" uniqKey="Vigneron L" first="Laurent" last="Vigneron">Laurent Vigneron</name>
<name sortKey="Wasilewska, Anita" sort="Wasilewska, Anita" uniqKey="Wasilewska A" first="Anita" last="Wasilewska">Anita Wasilewska</name>
</noCountry>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00A488 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00A488 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= CRIN:vigneron99a |texte= Rough Sets based Proofs Visualisation }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |