Proving properties of directed graphs: a problem set for automated theorem provers
Bericht
Faculties
Fakultät für Ingenieurwissenschaften und InformatikSeries
Ulmer Informatik-Berichte
Abstract
This paper describes a problem set for automated theorem provers taken from a KIV case study on the implementation of depth-first search on graphs. The goal is to prove 54 consequences of the axioms specifying directed graphs.
Date created
1998
Subject headings
[GND]: Automatisches Beweisverfahren[LCSH]: Automatic theorem proving | Directed graphs
[DDC subject group]: DDC 004 / Data processing & computer science
Metadata
Show full item recordDOI & citation
Please use this identifier to cite or link to this item: http://dx.doi.org/10.18725/OPARU-2500
Schellhorn, Gerhard (2013): Proving properties of directed graphs: a problem set for automated theorem provers. Open Access Repositorium der Universität Ulm und Technischen Hochschule Ulm. http://dx.doi.org/10.18725/OPARU-2500
Citation formatter >