Mechanical analysis of finite idempotent relations
Kammueller, Florian 
ORCID: https://orcid.org/0000-0001-5839-5488
(2011)
Mechanical analysis of finite idempotent relations.
Fundamenta Informaticae, 107
(1)
.
pp. 43-65.
ISSN 0169-2968
[Article]
(doi:10.3233/FI-2011-392)
|
PDF
- UNSPECIFIED
Download (193kB) | Preview |
Abstract
We use the technique of interactive theorem proving to develop the theory and anenumeration technique for finite idempotent relations. Starting from a short mathematical characterization of finite idempotents defined and proved in Isabelle/HOL, we derive first an iterative procedure to generate all instances of idempotents over a finite set. From there, we develop a more precise theo- retical characterization giving rise to an efficient predicate that can be executed in the programming language ML. Idempotent relations represent a very basic, general mathematical concept but the steps taken to develop their theory with the help of Isabelle/HOL are representative for developing algorithms from a mathematical specification.
| Item Type: | Article |
|---|---|
| Research Areas: | A. > School of Science and Technology > Computer Science > Artificial Intelligence group A. > School of Science and Technology > Computer Science > Foundations of Computing group |
| Item ID: | 6845 |
| Notes on copyright: | With thanks to IOS Press for permission for allowing the post-refereed article to be included. |
| Useful Links: | |
| Depositing User: | Dr Florian Kammueller |
| Date Deposited: | 06 Jan 2011 16:11 |
| Last Modified: | 30 Nov 2022 00:55 |
| URI: | https://eprints.mdx.ac.uk/id/eprint/6845 |
Actions (login required)
 |
View Item |
Statistics
Additional statistics are available via IRStats2.
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)