DC FieldValueLanguage
dc.contributor.authorHajdu, Marton-
dc.contributor.authorHozzova, Petra-
dc.contributor.authorKovacs, Laura-
dc.contributor.authorSchoisswohl, Johannes-
dc.contributor.authorVoronkov, Andrei-
dc.date.accessioned2021-10-04T13:12:10Z-
dc.date.available2021-10-04T13:12:10Z-
dc.date.issued2021-08-12-
dc.identifier.citation<div class="csl-bib-body"> <div class="csl-entry">Hajdu, M., Hozzova, P., Kovacs, L., Schoisswohl, J., &#38; Voronkov, A. (2021). Inductive Benchmarks for Automated Reasoning. In <i>Proceedings of CICM 2021</i> (pp. 124–129). Springer, Cham. https://doi.org/10.34726/1563</div> </div>-
dc.identifier.urihttp://hdl.handle.net/20.500.12708/18558-
dc.identifier.urihttps://doi.org/10.34726/1563-
dc.description.abstractWe present a large set of benchmarks for automated theorem provers that require inductive reasoning. Motivated by the need to compare first-order theorem provers, SMT solvers and inductive theorem provers, the setting of our examples follows the SMT-LIB standard. Our benchmark set contains problems with inductive data types as well as integers. In addition to SMT-LIB encodings, we provide translations to some other less common input formats.-
dc.description.sponsorshipEuropean Commission-
dc.description.sponsorshipEuropean Commission-
dc.language.isoen-
dc.relation.ispartofseriesLecture Notes in Computer Science-
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/-
dc.subjectautomated reasoningen
dc.subjectautomated deductionen
dc.subjecttheorem provingen
dc.titleInductive Benchmarks for Automated Reasoningen
dc.typeInproceedingsen
dc.typeKonferenzbeitragde
dc.rights.licenseUrheberrechtsschutz 1.0de
dc.rights.licenseIn Copyright 1.0en
dc.identifier.doi10.34726/1563-
dc.contributor.affiliationUniversity of Manchester, UK-
dc.relation.isbn978-3-030-81097-9-
dc.relation.doi10.1007/978-3-030-81097-9-
dc.relation.issn0302-9743-
dc.description.startpage124-
dc.description.endpage129-
dc.relation.grantno639270-
dc.relation.grantnoERC Consolidator Grant 2020-
dc.rights.holder© Springer Nature Switzerland AG 2021-
dc.type.categoryFull-Paper Contribution-
dc.relation.eissn1611-3349-
tuw.booktitleProceedings of CICM 2021-
tuw.peerreviewedtrue-
tuw.relation.publisherSpringer, Cham-
tuw.project.titleSymbolic Computation and Automated Reasoning for Program Analysis-
tuw.project.titleAutomated Reasoning with Theories and Induction for Software Technologies-
tuw.publication.orgunitE192-04 - Forschungsbereich Formal Methods in Systems Engineering-
tuw.publisher.doi10.1007/978-3-030-81097-9_9-
dc.description.numberOfPages6-
tuw.author.orcid0000-0001-5550-196X-
dc.rights.identifierUrheberrechtsschutz 1.0de
dc.rights.identifierIn Copyright 1.0en
item.cerifentitytypePublications-
item.cerifentitytypePublications-
item.openaccessfulltextOpen Access-
item.grantfulltextopen-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextwith Fulltext-
item.languageiso639-1en-
item.openairetypeInproceedings-
item.openairetypeKonferenzbeitrag-
crisitem.author.deptTU Wien, Österreich-
crisitem.author.deptUniversity of Manchester, UK-
crisitem.author.orcid0000-0001-5550-196X-
crisitem.project.funderEuropean Commission-
crisitem.project.funderEuropean Commission-
crisitem.project.grantno639270-
crisitem.project.grantnoERC Consolidator Grant 2020-
Appears in Collections:Conference Paper

Files in this item:


Page view(s)

22
checked on Dec 4, 2021

Download(s)

13
checked on Dec 4, 2021

Google ScholarTM

Check


Items in reposiTUm are protected by copyright, with all rights reserved, unless otherwise indicated.