This paper presents a machine-checked proof of the Basic Theorem on Concept Lattices, which appears in the book "Formal Concept Analysis" by Canter and Wille, in the Isabelle/HOL Proof Assistant. As a by-product, the underlying lattice theory by Kammueller has been extended
The interactive theorem prover Isabelle/HOL is based on well understood Higher-Order Logic (HOL), wh...
International audienceWe present a view of abstraction based on a structure preserving reduction of ...
When faced with the question of how to represent properties in a formal proof system any user has to...
Abstract. This paper presents a machine-checked proof of the Basic Theorem on Concept Lattices, whic...
Isabelle/HOL is a generic proof assistant. Using Isabelle/HOL requires insight into procedures as we...
Isabelle/HOL is a generic proof assistant. Using Isabelle/HOL requires insight into procedures as we...
Isabelle/HOL is a generic proof assistant. Using Isabelle/HOL requires insight into procedures as we...
Abstract: Interactive theorem provers have developed dramatically over the past four decades, from p...
Interactive theorem provers have developed dramatically over the past four decades, from primitive b...
Abstract. In [4] we have presented a new common platform for different types of fuzzification of a c...
The interactive theorem prover Isabelle/HOL is based on the well understood higher-order logic (HOL)...
This paper presents meta-logical investigations based on category theory using the proof assistant I...
As verification efforts using interactive theorem proving grow, we are in need of certified algorith...
We utilize and extend the method of shallow semantic embeddings (SSEs) in classical higher-order log...
Lattices are mathematical structures with many applications in computer science; among these, we are...
The interactive theorem prover Isabelle/HOL is based on well understood Higher-Order Logic (HOL), wh...
International audienceWe present a view of abstraction based on a structure preserving reduction of ...
When faced with the question of how to represent properties in a formal proof system any user has to...
Abstract. This paper presents a machine-checked proof of the Basic Theorem on Concept Lattices, whic...
Isabelle/HOL is a generic proof assistant. Using Isabelle/HOL requires insight into procedures as we...
Isabelle/HOL is a generic proof assistant. Using Isabelle/HOL requires insight into procedures as we...
Isabelle/HOL is a generic proof assistant. Using Isabelle/HOL requires insight into procedures as we...
Abstract: Interactive theorem provers have developed dramatically over the past four decades, from p...
Interactive theorem provers have developed dramatically over the past four decades, from primitive b...
Abstract. In [4] we have presented a new common platform for different types of fuzzification of a c...
The interactive theorem prover Isabelle/HOL is based on the well understood higher-order logic (HOL)...
This paper presents meta-logical investigations based on category theory using the proof assistant I...
As verification efforts using interactive theorem proving grow, we are in need of certified algorith...
We utilize and extend the method of shallow semantic embeddings (SSEs) in classical higher-order log...
Lattices are mathematical structures with many applications in computer science; among these, we are...
The interactive theorem prover Isabelle/HOL is based on well understood Higher-Order Logic (HOL), wh...
International audienceWe present a view of abstraction based on a structure preserving reduction of ...
When faced with the question of how to represent properties in a formal proof system any user has to...