{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:04:15Z","timestamp":1726412655344},"publisher-location":"Berlin\/Heidelberg","reference-count":6,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019343X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0012848","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T01:12:39Z","timestamp":1132708359000},"page":"435-453","source":"Crossref","is-referenced-by-count":0,"title":["Term rewriting: Some experimental results"],"prefix":"10.1007","author":[{"given":"Richard C.","family":"Potter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David A.","family":"Plaisted","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0004-3702(82)90041-8","volume":"18","author":"D.A. Plaisted","year":"1982","unstructured":"Plaisted, D.A., \u2018A simplified problem reduction format', Artificial Intelligence 18 (1982) 227\u2013261","journal-title":"Artificial Intelligence"},{"key":"29_CR2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02328452","volume":"2","author":"R. Boyer","year":"1986","unstructured":"Boyer, Robert, Lusk, Ewing, McCune, William, Overbeek, Ross, Stickel, Mark, and Wos, Lawrence, \u2018Set theory in first-order logic: clauses for G\u00f6del's axioms', Journal of Automated Reasoning 2 (1986) 287\u2013327","journal-title":"Journal of Automated Reasoning"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Plaisted, D.A., \u2018Another extension of Horn clause logic programming to non-Horn clauses', Lecture Notes 1987","DOI":"10.1007\/BF00244944"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Plaisted, D.A., \u2018Non-Horn clause logic programming without contrapositives', unpublished manuscript 1987","DOI":"10.1007\/BF00244944"},{"key":"29_CR5","unstructured":"Loveland, D.W., Automated Theorem Proving: A Logical Base, North-Holland Publishing Co., 1978, Chapter 6."},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R.E. Korf","year":"1985","unstructured":"Korf, R.E., \u2018Depth-first iterative-deepening: an optimal admissible tree search', Artificial Intelligence 27 (1985) 97\u2013109.","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","9th International Conference on Automated Deduction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0012848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:24:29Z","timestamp":1586564669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0012848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019343X"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0012848","relation":{},"subject":[]}}