Verification of the Formal Concept Analysis.

José Antonio Alonso; Joaquín Borrego; María José Hidalgo; Francisco Jesús Martín Mateos; José Luis Ruiz Reina

RACSAM (2004)

  • Volume: 98, Issue: 1, page 3-16
  • ISSN: 1578-7303

Abstract

top
This paper is concerned with a formal verification of the Formal Concept Analysis framework. We use the PVS system to represent and formally verify some algorithms of this theory. We also develop a method to transform specifications of algorithms based on finite sets into other executable ones, preserving its correctness. We illustrate this method by constructing an executable algorithm to compute an implicational base of the system of implications between attributes of a finite formal context.

How to cite

top

Alonso, José Antonio, et al. "Verification of the Formal Concept Analysis.." RACSAM 98.1 (2004): 3-16. <http://eudml.org/doc/41033>.

@article{Alonso2004,
abstract = {This paper is concerned with a formal verification of the Formal Concept Analysis framework. We use the PVS system to represent and formally verify some algorithms of this theory. We also develop a method to transform specifications of algorithms based on finite sets into other executable ones, preserving its correctness. We illustrate this method by constructing an executable algorithm to compute an implicational base of the system of implications between attributes of a finite formal context.},
author = {Alonso, José Antonio, Borrego, Joaquín, Hidalgo, María José, Martín Mateos, Francisco Jesús, Ruiz Reina, José Luis},
journal = {RACSAM},
language = {eng},
number = {1},
pages = {3-16},
title = {Verification of the Formal Concept Analysis.},
url = {http://eudml.org/doc/41033},
volume = {98},
year = {2004},
}

TY - JOUR
AU - Alonso, José Antonio
AU - Borrego, Joaquín
AU - Hidalgo, María José
AU - Martín Mateos, Francisco Jesús
AU - Ruiz Reina, José Luis
TI - Verification of the Formal Concept Analysis.
JO - RACSAM
PY - 2004
VL - 98
IS - 1
SP - 3
EP - 16
AB - This paper is concerned with a formal verification of the Formal Concept Analysis framework. We use the PVS system to represent and formally verify some algorithms of this theory. We also develop a method to transform specifications of algorithms based on finite sets into other executable ones, preserving its correctness. We illustrate this method by constructing an executable algorithm to compute an implicational base of the system of implications between attributes of a finite formal context.
LA - eng
UR - http://eudml.org/doc/41033
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.