Show simple item record

AuthorSchellhorn, Gerharddc.contributor.author
Date of accession2016-03-15T09:03:54Zdc.date.accessioned
Available in OPARU since2016-03-15T09:03:54Zdc.date.available
Year of creation1998dc.date.created
AbstractThis 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
Languageendc.language.iso
PublisherUniversität Ulmdc.publisher
LicenseStandarddc.rights
Link to license texthttps://oparu.uni-ulm.de/xmlui/license_v3dc.rights.uri
Dewey Decimal GroupDDC 004 / Data processing & computer sciencedc.subject.ddc
LCSHAutomatic theorem provingdc.subject.lcsh
LCSHDirected graphsdc.subject.lcsh
TitleProving properties of directed graphs: a problem set for automated theorem proversdc.title
Resource typeBerichtdc.type
DOIhttp://dx.doi.org/10.18725/OPARU-2500dc.identifier.doi
PPN1652464298dc.identifier.ppn
URNhttp://nbn-resolving.de/urn:nbn:de:bsz:289-vts-85659dc.identifier.urn
GNDAutomatisches Beweisverfahrendc.subject.gnd
FacultyFakultät für Ingenieurwissenschaften und Informatikuulm.affiliationGeneral
Date of activation2013-06-19T16:36:37Zuulm.freischaltungVTS
Peer reviewneinuulm.peerReview
Shelfmark print versionQAA 5/A4.98,12uulm.shelfmark
DCMI TypeTextuulm.typeDCMI
VTS ID8565uulm.vtsID
CategoryPublikationenuulm.category
uulm seriesUlmer Informatik-Berichteuulm.seriesUlmName
Source - Year1998source.year
Bibliographyuulmuulm.bibliographie


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record