{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:09Z","timestamp":1725488589272},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_40","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:32:26Z","timestamp":1186727546000},"page":"392-395","source":"Crossref","is-referenced-by-count":1,"title":["Pythagorean Triples in Unification Theory of Nilpotent Rings"],"prefix":"10.1007","author":[{"given":"Ruvim","family":"Lipyanski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"40_CR1","first-page":"41","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"F. Baader","year":"1994","unstructured":"Baader, F., Siekmann, J.: Unification theory. In: Gabbay, Dov M., Hogger, C., Robinson, J., (eds.): Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 2. Clanderon Press, Oxford (1994) 41\u2013124"},{"key":"40_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/3-540-55124-7_9","volume-title":"Word equation and related topics","author":"F. Baader","year":"1992","unstructured":"Baader, F.: Unification in varieties of completely regular semigroup. In: Word equation and related topics. Lecture Notes in Computer Science, Vol. 572. Springer-Verlag, Berlin (1992) 210\u2013230"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF00245459","volume":"9","author":"M. Franzen","year":"1992","unstructured":"Franzen, M.: Hilbert\u2019s tenth problem is of unification type zero. J. Automated Reasoning 9 (1992) 169\u2013178","journal-title":"J. Automated Reasoning"},{"key":"40_CR4","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0747-7171(89)80013-6","volume":"7","author":"U. Martin","year":"1989","unstructured":"Martin, U., Nipkov, T.: Boolean unification-The story so far. J. Symbolic Computation 7 (1989) 275\u2013293","journal-title":"J. Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T04:55:08Z","timestamp":1550724908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_40","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}