A calculus for set-based program development part II: proof search
- The first part of this work introduced a calculus for atomic distributive lattices. It is tailored for operational reasoning in naive or intuitive set theory and in set-based program development methods like Z or B. Here, we use this calculus for developing several focused automated proof-search procedures for atomic distributive and atomic boolean lattices. The procedures are based on ordered resolution; proof-search is guided by rewriting techniques. We derive simple deducation and powerful reduction and simplification rules, in particular decision procedures for several subclasses. Our results solve a longstanding open problem in automatic deduction and close an interesting gap in the proof support for formal methods.
| Author: | Georg StruthGND |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-1730 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/222 |
| Series (Serial Number): | Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2003-16) |
| Publisher: | Institut für Informatik, Universität Augsburg |
| Place of publication: | Augsburg |
| Type: | Report |
| Language: | English |
| Year of first Publication: | 2003 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2006/06/12 |
| Tag: | naive set theory; set-based program development; lattice theory; automated deduction; ordered resolution; term rewriting; decision procedures |
| Institutes: | Fakultät für Angewandte Informatik |
| Fakultät für Angewandte Informatik / Institut für Informatik | |
| Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme | |
| Dewey Decimal Classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
