{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T02:32:44Z","timestamp":1774837964092,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1109\/sisy.2015.7325367","type":"proceedings-article","created":{"date-parts":[[2015,11,12]],"date-time":"2015-11-12T18:09:14Z","timestamp":1447351754000},"page":"139-144","source":"Crossref","is-referenced-by-count":6,"title":["Theory exploration of binary trees"],"prefix":"10.1109","author":[{"given":"Isabela","family":"Dramnesc","sequence":"first","affiliation":[]},{"given":"Tudor","family":"Jebelean","sequence":"additional","affiliation":[]},{"given":"Sorin","family":"Stratulat","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SISY.2014.6923579"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SACI.2015.7208252"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2014.09.030"},{"key":"ref13","first-page":"15","author":"dramnesc","year":"2015"},{"key":"ref14","volume":"3","author":"knuth","year":"1998","journal-title":"The art of computer programming"},{"key":"ref15","author":"kunen","year":"1980","journal-title":"Set Theory An Introduction to Independence Proofs Studies in Logic and the Foundations of Mathematics"},{"key":"ref16","volume":"1","author":"manna","year":"1985","journal-title":"The Logical Basis for Computer Programming"},{"key":"ref17","first-page":"326","article-title":"A Unified View of Induction Reasoning for First-Ourder Logic","volume":"10","author":"stratulat","year":"2012","journal-title":"Turing-100 (The Alan Turing Centenary Conference)"},{"key":"ref18","author":"wolfram","year":"2003","journal-title":"The Mathematica Book"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30210-0_20"},{"key":"ref3","first-page":"9","article-title":"Theory Exploration with Theorema","volume":"xxxviii","author":"buchberger","year":"2000","journal-title":"Analele Universitatii Din Timisoara Ser Matematica-Informatica"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2007.55"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2005.10.006"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2012.43"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2011.23"},{"key":"ref2","article-title":"Automated Induction for Complex Data Structures","author":"bouhoula","year":"2008","journal-title":"CoRR"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SACI.2012.6250041"}],"event":{"name":"2015 IEEE 13th International Symposium on Intelligent Systems and Informatics (SISY)","location":"Subotica, Serbia","start":{"date-parts":[[2015,9,17]]},"end":{"date-parts":[[2015,9,19]]}},"container-title":["2015 IEEE 13th International Symposium on Intelligent Systems and Informatics (SISY)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7311168\/7325349\/07325367.pdf?arnumber=7325367","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,25]],"date-time":"2017-03-25T01:04:48Z","timestamp":1490403888000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7325367\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/sisy.2015.7325367","relation":{},"subject":[],"published":{"date-parts":[[2015,9]]}}}