Diferencia entre revisiones de «Verification of the formal concept analysis in PVS»
(New page: * '''Title:''' * '''Autores:''' {{jalonso}} y {{mjoseh}}. * '''Fecha de realización:''' * '''Abstract:''' * '''Code:''' You can find the PVS theories in ... * '''Documentation:''') |
|||
Línea 1: | Línea 1: | ||
− | * '''Title:''' | + | * '''Title:''' Verification of the formal concept analysis in PVS |
* '''Autores:''' {{jalonso}} y {{mjoseh}}. | * '''Autores:''' {{jalonso}} y {{mjoseh}}. | ||
− | * '''Fecha de realización:''' | + | * '''Fecha de realización:''' 2002-2004 |
− | * '''Abstract:''' | + | * '''Abstract:''' This theory consists of a formal verification of the mathematical foundations of theory of the Formal Concept Analysis (FCA) framework in the PVS system. The notion of formal concept in a formal context is defined and we prove that the concepts of a context can be interpreted as a complete lattice. We also deal with the implications between attributes and we verify an algorithm to obtain a minimal base of implications. Finally, we transform the previous specifications of FCA into their respective executable specifications by using refinements, in order to preserve their properties. |
* '''Code:''' You can find the PVS theories in ... | * '''Code:''' You can find the PVS theories in ... | ||
* '''Documentation:''' | * '''Documentation:''' |
Revisión del 19:41 1 jun 2010
- Title: Verification of the formal concept analysis in PVS
- Autores: José A. Alonso y María J. Hidalgo.
- Fecha de realización: 2002-2004
- Abstract: This theory consists of a formal verification of the mathematical foundations of theory of the Formal Concept Analysis (FCA) framework in the PVS system. The notion of formal concept in a formal context is defined and we prove that the concepts of a context can be interpreted as a complete lattice. We also deal with the implications between attributes and we verify an algorithm to obtain a minimal base of implications. Finally, we transform the previous specifications of FCA into their respective executable specifications by using refinements, in order to preserve their properties.
- Code: You can find the PVS theories in ...
- Documentation: