Rough Diagrams
Identifieur interne : 002352 ( Crin/Curation ); précédent : 002351; suivant : 002353Rough Diagrams
Auteurs : Laurent Vigneron ; Anita WasilewskaSource :
English descriptors
- KwdEn :
Abstract
The study of algebras may be a hard task, even with powerful theorem provers. We present here an approach we used for proving important properties of rough Boolean algebras, combining theorem provers with a graphical technique, called Rough Diagrams. Rough Diagrams correspond to a classical notion of Ven Diagrams and can also serve as a new and very intuitive way of constructing counter models for formulas that are not tautologies of modal logic S5.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: Pour aller vers cette notice dans l'étape Curation :002352
Links to Exploration step
CRIN:vigneron98cLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="61">Rough Diagrams</title></titleStmt><publicationStmt><idno type="RBID">CRIN:vigneron98c</idno><date when="1998" year="1998">1998</date><idno type="wicri:Area/Crin/Corpus">002352</idno><idno type="wicri:Area/Crin/Curation">002352</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002352</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Rough Diagrams</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>boolean algebras</term><term>diagrams</term><term>rough sets</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1384">The study of algebras may be a hard task, even with powerful theorem provers. We present here an approach we used for proving important properties of rough Boolean algebras, combining theorem provers with a graphical technique, called Rough Diagrams. Rough Diagrams correspond to a classical notion of Ven Diagrams and can also serve as a new and very intuitive way of constructing counter models for formulas that are not tautologies of modal logic S5.</div></front></TEI><BibTex type="inproceedings"><ref>vigneron98c</ref><crinnumber>98-R-294</crinnumber><category>3</category><equipe>PROTHEO</equipe><author><e>Vigneron, Laurent</e><e>Wasilewska, Anita</e></author><title>Rough Diagrams</title><booktitle>{6th International Workshop on Rough Sets, Data Mining and Granular Computing (RSDMGrC'98) at the 4th Joint Conference on Information Sciences, Research Triangle Park, NC}</booktitle><year>1998</year><editor>T.Y. Lin</editor><keywords><e>rough sets</e><e>boolean algebras</e><e>diagrams</e></keywords><abstract>The study of algebras may be a hard task, even with powerful theorem provers. We present here an approach we used for proving important properties of rough Boolean algebras, combining theorem provers with a graphical technique, called Rough Diagrams. Rough Diagrams correspond to a classical notion of Ven Diagrams and can also serve as a new and very intuitive way of constructing counter models for formulas that are not tautologies of modal logic S5.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002352 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Curation/biblio.hfd -nk 002352 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Curation
|type= RBID
|clé= CRIN:vigneron98c
|texte= Rough Diagrams
}}
| This area was generated with Dilib version V0.6.33. |  |