Diferencia entre revisiones de «Verification of the formal concept analysis in PVS»

De WikiGLC
Saltar a: navegación, buscar
Línea 5: Línea 5:
 
* '''Code:''' You can find the PVS theories in ...
 
* '''Code:''' You can find the PVS theories in ...
 
* '''Documentation:'''
 
* '''Documentation:'''
 +
 +
{| border="1"
 +
| '''Title:'''
 +
|
 +
|-
 +
| '''Authors:'''
 +
| {{jalonso}}, {{mjoseh}} and {{fmartin}}.
 +
|-
 +
| '''Date:'''
 +
|
 +
|-
 +
| '''Description:'''
 +
|
 +
|-
 +
| '''Code:'''
 +
| You can find the PVS theories in ...
 +
|-
 +
| '''Documentation:'''
 +
| [http://www.cs.us.es/~mjoseh/pub/Proving_termination_with_multiset_orderings_in_PVS.pdf Proving termination with multiset orderings in PVS: theory, methodology and applications]
 +
|}

Revisión del 10:50 2 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:
Title:
Authors: José A. Alonso, María J. Hidalgo and Francisco J. Martín.
Date:
Description:
Code: You can find the PVS theories in ...
Documentation: Proving termination with multiset orderings in PVS: theory, methodology and applications
Obtenido de «https://www.glc.us.es/web/index.php?title=Verification_of_the_formal_concept_analysis_in_PVS&oldid=915»