Mechanical analysis of finite idempotent relations

Kammueller, Florian (2011) Mechanical analysis of finite idempotent relations. Fundamenta Informaticae, 107 (1). pp. 43-65. ISSN 1875-8681



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 > Foundations of Computing group
A. > School of Science and Technology > Computer Science > Artificial Intelligence group
ID Code:6845
Notes on copyright:With thanks to IOS Press for permission for allowing the post-refereed article to be included.
Useful Links:
Deposited On:06 Jan 2011 16:11
Last Modified:30 Apr 2015 15:43

Repository staff only: item control page

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year