{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T18:30:40Z","timestamp":1648578640773},"reference-count":19,"publisher":"Informa UK Limited","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2004,9]]},"DOI":"10.1080\/03057920412331272207","type":"journal-article","created":{"date-parts":[[2004,8,30]],"date-time":"2004-08-30T15:06:13Z","timestamp":1093878373000},"page":"1051-1067","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting parallelism: highly competitive semantic tree theorem prover"],"prefix":"10.1080","volume":"81","author":[{"given":"Choon Kyu","family":"Kim * \u2020","sequence":"first","affiliation":[]}],"member":"301","reference":[{"key":"b1","volume-title":"ICCI2000","author":"Al-Anjawi A","year":"2000"},{"key":"b2","volume-title":"Ph.D. Thesis, School of Computer Science, McGill University","author":"Almulla M","year":"1995"},{"key":"b3","doi-asserted-by":"publisher","DOI":"10.1080\/00207169608804524"},{"key":"b4","unstructured":"Almulla M Newborn M (1998) http:\/\/www.cs.miami.edu\/~tptp\/CASC\/15"},{"key":"b5","doi-asserted-by":"publisher","DOI":"10.1145\/321607.321618"},{"key":"b6","volume-title":"Symbolic Logic and Mechanical Theorem Proving, Academic Press","author":"Chang CL","year":"1973"},{"key":"b7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5712.001.0001","volume-title":"A User's Guide and Tutorials for Networked Parallel Computing, MIT Press","author":"Giest A","year":"1994"},{"key":"b8","doi-asserted-by":"crossref","unstructured":"Hurd J (1999) Integrating gandalf and HOL, TPHOLs'99 LNCS 1690 311 321","DOI":"10.1007\/3-540-48256-3_21"},{"key":"b9","volume-title":"Ph.D. Thesis, School of Computer Science, McGill University","author":"Kim CK","year":"2004"},{"key":"b10","doi-asserted-by":"crossref","unstructured":"Kim CK Newborn M (2003) Competitive semantic tree theorem prover with resolutions, EuroPVM\/MPI","DOI":"10.1007\/978-3-540-39924-7_33"},{"key":"b11","first-page":"97","volume-title":"Artificial Intelligence","author":"Korf RE","year":"1985"},{"key":"b12","unstructured":"Newborn M (1998) http:\/\/www.cs.miami.edu\/~tptp\/CASC\/15\/SystemDescriptions.html#TGTP"},{"key":"b13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0089-2","volume-title":"Automated Theorem Proving: Theory and Practice, Springer-Verlag","author":"Newborn M","year":"2001"},{"key":"b14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02432151"},{"key":"b15","volume-title":"Ph.D. Thesis, Stanford University","author":"Plaisted DA","year":"1976"},{"key":"b16","doi-asserted-by":"publisher","DOI":"10.1016\/S0923-0459(97)80012-2"},{"key":"b17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1005806324129"},{"key":"b18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018976510663"},{"key":"b19","doi-asserted-by":"publisher","DOI":"10.1145\/7531.8928"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/03057920412331272207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T02:16:11Z","timestamp":1585880171000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/03057920412331272207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":19,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["10.1080\/03057920412331272207"],"URL":"https:\/\/doi.org\/10.1080\/03057920412331272207","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}