{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:29:10Z","timestamp":1767929350721,"version":"3.49.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,10,1]],"date-time":"1987-10-01T00:00:00Z","timestamp":560044800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9421,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1987,10]]},"DOI":"10.1016\/s0747-7171(87)80065-2","type":"journal-article","created":{"date-parts":[[2008,4,9]],"date-time":"2008-04-09T10:00:48Z","timestamp":1207735248000},"page":"191-205","source":"Crossref","is-referenced-by-count":79,"title":["Embedding boolean expressions into logic programming"],"prefix":"10.1016","volume":"4","author":[{"given":"Wolfram","family":"Buttner","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Simonis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0747-7171(87)80065-2_bib1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF00246024","article-title":"Unification in Datastructure Multisets","volume":"2","author":"B\u00fcttner","year":"1986","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S0747-7171(87)80065-2_bib2","series-title":"Proceedings of the Eighth International Conference on Automated Deduction CADE-8, Oxford (England)","article-title":"Unification in Datastructure Sets","author":"B\u00fcttner","year":"1986"},{"key":"10.1016\/S0747-7171(87)80065-2_bib3","series-title":"Programming in Prolog","author":"Clocksin","year":"1981"},{"key":"10.1016\/S0747-7171(87)80065-2_bib4","series-title":"Notes sur Prolog III Actes du Seminaire de Programmation en Logique","author":"Colmerauer","year":"1986"},{"key":"10.1016\/S0747-7171(87)80065-2_bib5","series-title":"Proceddings 8th IJCAI, Karlsruhe","article-title":"Asseociative-Commutative Rewriting","author":"Dershowitz","year":"1983"},{"key":"10.1016\/S0747-7171(87)80065-2_bib6","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0747-7171(87)80065-2_bib7","series-title":"Technical Report SEKI MEMO 85-IIl-KL","article-title":"Unification in Abelian Semigroups","author":"Herold","year":"1985"},{"key":"10.1016\/S0747-7171(87)80065-2_bib8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0004-3702(85)90074-8","article-title":"Refutational Theorem Proving using Term-Rewriting","volume":"25","author":"Hsiang","year":"1985","journal-title":"Systems Artificial Intelligence"},{"key":"10.1016\/S0747-7171(87)80065-2_bib9","series-title":"Computational Problems in Abstract Algebra","article-title":"Simple Word Problems in Universal Algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/S0747-7171(87)80065-2_bib10","series-title":"Technical Report SEKI MEMO 76-II","article-title":"Unification of Sets and Multisets","author":"Livesey","year":"1976"},{"key":"10.1016\/S0747-7171(87)80065-2_bib11","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"key":"10.1016\/S0747-7171(87)80065-2_bib12","series-title":"Proceedings of the Eight, International Conference on Automated Deduction CADE-8, Oxford(England), July","article-title":"Unification in Boolean Rings","author":"Martin","year":"1986"},{"key":"10.1016\/S0747-7171(87)80065-2_bib13","series-title":"Proceedings of the Scand. Logic Symp","article-title":"Diophantine Representation of Rec. Enumerable Predicates","author":"Matiyasevich","year":"1978"},{"key":"10.1016\/S0747-7171(87)80065-2_bib14","article-title":"Building-In Equational Theories","volume":"7","author":"Plotkin","year":"1972"},{"key":"10.1016\/S0747-7171(87)80065-2_bib15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A Machine-Oriented Logic Based on the Resolution Principle","volume":"12","author":"Robinson","year":"1965","journal-title":"JACM"},{"key":"10.1016\/S0747-7171(87)80065-2_bib16","series-title":"Boolean Functions and Equations","author":"Rudeanu","year":"1974"},{"key":"10.1016\/S0747-7171(87)80065-2_bib17","series-title":"7th international conference on automated deduction","article-title":"Universal Unification","author":"Siekmann","year":"1984"},{"issue":"3","key":"10.1016\/S0747-7171(87)80065-2_bib18","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/322261.322262","article-title":"A Unification Algorithm for Associative-Commutative Functions","volume":"28","author":"Stickel","year":"1981","journal-title":"JACM"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717187800652?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717187800652?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T07:29:15Z","timestamp":1546154955000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717187800652"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,10]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,10]]}},"alternative-id":["S0747717187800652"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(87)80065-2","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1987,10]]}}}