{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:32:27Z","timestamp":1729611147387,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1109\/icsmc.2008.4811410","type":"proceedings-article","created":{"date-parts":[[2009,4,8]],"date-time":"2009-04-08T13:25:32Z","timestamp":1239197132000},"page":"991-996","source":"Crossref","is-referenced-by-count":0,"title":["Implementation and performance evaluation of multi-completion with termination checking"],"prefix":"10.1109","author":[{"given":"Haruhiko","family":"Sato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahito","family":"Kurihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/11805618_22","article-title":"slothrop: knuth-bendix completion with a modern termination checker (system description)","volume":"4098","author":"wehrman","year":"2006","journal-title":"Lecture Notes in Computer Science"},{"year":"0","key":"16"},{"journal-title":"Term Rewriting Systems","year":"2003","author":"terese","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.12.008"},{"key":"11","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/3-540-57785-8_140","article-title":"about changing the ordering during knuth-bendix completion","volume":"775","author":"sattlcr-klein","year":"1994","journal-title":"Lecture Notes in Computer Science"},{"article-title":"check your ordering - termination proofs and problems","year":"1990","author":"steinbach","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-7118-2"},{"key":"2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","author":"baader","year":"1998","journal-title":"Term Rewriting and All That"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00207-8"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2006.08.010"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-006-9057-7"},{"key":"6","first-page":"281","article-title":"aprove 1.2: automatic termination proofs in the dependency pair framework","volume":"4130","author":"giesl","year":"2006","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72788-0_33"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(87)80022-6"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006129631807"},{"year":"0","key":"8"}],"event":{"name":"2008 IEEE International Conference on Systems, Man and Cybernetics (SMC)","start":{"date-parts":[[2008,10,12]]},"location":"Singapore, Singapore","end":{"date-parts":[[2008,10,15]]}},"container-title":["2008 IEEE International Conference on Systems, Man and Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4803719\/4811240\/04811410.pdf?arnumber=4811410","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T18:41:48Z","timestamp":1497811308000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4811410\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icsmc.2008.4811410","relation":{},"ISSN":["1062-922X"],"issn-type":[{"type":"print","value":"1062-922X"}],"subject":[],"published":{"date-parts":[[2008,10]]}}}