{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:47:40Z","timestamp":1749124060512},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019343X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0012844","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:12:39Z","timestamp":1132726359000},"page":"368-377","source":"Crossref","is-referenced-by-count":3,"title":["Unification in finite algebras is unitary(?)"],"prefix":"10.1007","author":[{"given":"Wolfram","family":"B\u00fcttner","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Baader F., Unification in Idempotent Semigroups is of Type Zero, JAR2, 1986","DOI":"10.1007\/BF02328451"},{"key":"25_CR2","unstructured":"Balbes R. and Dwinger P., Distributive Lattices, University of Missouri Press, Columbia, U.S.A., 1974"},{"issue":"8","key":"25_CR3","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R. Bryant","year":"1986","unstructured":"Bryant R. Graph-Based Algorithms for Boolean Functions Manipulations, IEEE Transactions on Computers, Vol. C-35, No. 8, pg. 677\u2013691, 1986","journal-title":"IEEE Transactions on Computers"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"B\u00fcttner W. and Simonis H., Embedding Boolean Expressions into Logic Programming, Journal of Symbolic Computation (to appear 1987)","DOI":"10.1016\/S0747-7171(87)80065-2"},{"key":"25_CR5","unstructured":"B\u00fcttner W. Application Driven Prolog Extensions, Submitted to International Symposium on Multiple-Valued Logic, Palma de Mallorca, Spain, May 1988"},{"key":"25_CR6","unstructured":"Nipkow T., Unification in Functionally Complete Algebras, Unpublished Manuscript 1987, Dept. CS, University of Manchester, England"},{"key":"25_CR7","first-page":"73","volume":"7","author":"G. Plotkin","year":"1972","unstructured":"Plotkin G., Building in Equational Theories, Machine Intelligence 7, pg. 73\u201390, 1972","journal-title":"Machine Intelligence"},{"key":"25_CR8","unstructured":"Siekmann J., Unification Theory, Proceedings, European Conference on Artificiallntelligence, Brighton, England, July 1986"},{"key":"25_CR9","volume-title":"Compatible Ordesings and Tolerances of Lattices","author":"I. Rosenberg","year":"1984","unstructured":"Rosenberg I. and Schweigert D., Compatible Ordesings and Tolerances of Lattices, Preprint No. 70, Dept. of Mathematics, University of Kaiserslautern, West Germany, 1984"},{"key":"25_CR10","unstructured":"Simonis H., Using Extended Prolog to Model Digital Circuits, Technical Report TR-LP-2202 E.C.R.C.(European Computer Industry Research Centre), 1986"}],"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\/BFb0012844","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:24:26Z","timestamp":1586579066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0012844"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019343X"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0012844","relation":{},"subject":[]}}