Author | Schellhorn, Gerhard | dc.contributor.author |
Date of accession | 2016-03-15T09:03:54Z | dc.date.accessioned |
Available in OPARU since | 2016-03-15T09:03:54Z | dc.date.available |
Year of creation | 1998 | dc.date.created |
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. | dc.description.abstract |
Language | en | dc.language.iso |
Publisher | Universität Ulm | dc.publisher |
License | Standard | dc.rights |
Link to license text | https://oparu.uni-ulm.de/xmlui/license_v3 | dc.rights.uri |
Dewey Decimal Group | DDC 004 / Data processing & computer science | dc.subject.ddc |
LCSH | Automatic theorem proving | dc.subject.lcsh |
LCSH | Directed graphs | dc.subject.lcsh |
Title | Proving properties of directed graphs: a problem set for automated theorem provers | dc.title |
Resource type | Bericht | dc.type |
DOI | http://dx.doi.org/10.18725/OPARU-2500 | dc.identifier.doi |
PPN | 1652464298 | dc.identifier.ppn |
URN | http://nbn-resolving.de/urn:nbn:de:bsz:289-vts-85659 | dc.identifier.urn |
GND | Automatisches Beweisverfahren | dc.subject.gnd |
Faculty | Fakultät für Ingenieurwissenschaften und Informatik | uulm.affiliationGeneral |
Date of activation | 2013-06-19T16:36:37Z | uulm.freischaltungVTS |
Peer review | nein | uulm.peerReview |
Shelfmark print version | QAA 5/A4.98,12 | uulm.shelfmark |
DCMI Type | Text | uulm.typeDCMI |
VTS ID | 8565 | uulm.vtsID |
Category | Publikationen | uulm.category |
uulm series | Ulmer Informatik-Berichte | uulm.seriesUlmName |
Source - Year | 1998 | source.year |
Bibliography | uulm | uulm.bibliographie |