论文信息 - Proof of the Basic Theorem on Concept Lattices in Isabelle/HOL

Proof of the Basic Theorem on Concept Lattices in Isabelle/HOL

This paper presents a machine-checked proof of the Basic Theorem on Concept Lattices, which appears in the book “Formal Concept Analysis” by Ganter and Wille, in the Isabelle/HOL Proof Assistant. As a by-product, the underlying lattice theory by Kammueller has been extended.

Halit Oguztüzün | Baris Sertkaya | B. Sertkaya | Halit Oğuztüzün

[1] R. Wille. Concept lattices and conceptual knowledge systems , 1992 .

[2] Bernhard Ganter,et al. Formal Concept Analysis: Mathematical Foundations , 1998 .

[3] Jean-François Dufourd,et al. Formalizing mathematics in higher-order logic: A case study in geometric modelling , 2000, Theor. Comput. Sci..

[4] F. Informatik,et al. Mizar Formalization of Concept Lattices , 2000 .

[5] Markus Wenzel,et al. Isabelle, Isar - a versatile environment for human readable formal proof documents , 2002 .

[6] Bernhard Ganter,et al. Applied lattice theory: formal concept and analysis , 1997 .

[7] Stefan Berghofer. Program Extraction in Simply-Typed Higher Order Logic , 2002, TYPES.

[8] Tobias Nipkow,et al. A Proof Assistant for Higher-Order Logic , 2002 .

[9] Brian A. Davey,et al. Introduction to Lattices and Order: Frontmatter , 2002 .

[10] Young Park,et al. Software retrieval by samples using concept analysis , 2000, J. Syst. Softw..

[11] Lawrence Charles Paulson,et al. Isabelle: A Generic Theorem Prover , 1994 .

[12] Piotr Rudnicki,et al. An Overview of the MIZAR Project , 1992 .

[13] Piergiorgio Odifreddi,et al. Logic and computer science , 1990 .

[14] Brian A. Davey,et al. An Introduction to Lattices and Order , 1989 .

[15] N. J. Davies,et al. Concept Lattices for Knowledge Management , 1999 .