{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T05:25:51Z","timestamp":1750829151761},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Induction is a powerful proof technique adapted to reason on sets<\/jats:p><jats:p>with an unbounded number of elements. In a first-order setting, two<\/jats:p><jats:p>different methods are distinguished: the conventional induction,<\/jats:p><jats:p>based on explicit induction schemas, and the implicit induction,<\/jats:p><jats:p>based on reductive procedures. We propose a new cycle-based<\/jats:p><jats:p>induction method that keeps their best features, i.e. i) performs<\/jats:p><jats:p>lazy induction, ii) naturally fits for mutual induction, and iii) is<\/jats:p><jats:p>free of reductive constraints. The heart of the method is a proof<\/jats:p><jats:p>strategy that identifies in the proof script the subset of formulas<\/jats:p><jats:p>contributing to validate the application of induction hypotheses.<\/jats:p><jats:p>The conventional and implicit induction are particular cases of our<\/jats:p><jats:p>method.<\/jats:p>","DOI":"10.29007\/nsx4","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T22:57:36Z","timestamp":1516748256000},"page":"326-298","source":"Crossref","is-referenced-by-count":4,"title":["A Unified View of Induction Reasoning for First-Order Logic"],"prefix":"10.29007","volume":"10","author":[{"given":"Sorin","family":"Stratulat","sequence":"first","affiliation":[]}],"member":"11545","event":{"name":"Turing-100. The Alan Turing Centenary"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T22:57:46Z","timestamp":1516748266000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/4qw"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/nsx4","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}