{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T20:28:22Z","timestamp":1672691302460},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":6165,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1016\/0743-1066(96)00049-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:44:48Z","timestamp":1027644288000},"page":"207-216","source":"Crossref","is-referenced-by-count":3,"title":["A note on semantics of logic programs with equality based on complete sets of E-unifiers"],"prefix":"10.1016","volume":"28","author":[{"given":"Anatoli","family":"Degtyarev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Voronkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(96)00049-0_BIB1","series-title":"Handbook of Theoretical Computer Science","first-page":"493","article-title":"Logic Programming","volume":"vol. B","author":"Apt","year":"1990"},{"key":"10.1016\/0743-1066(96)00049-0_BIB2","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1090\/S0002-9904-1944-08235-9","article-title":"Subdirect Unions in Universal Algebras","volume":"50","author":"Birkhoff","year":"1944","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0743-1066(96)00049-0_BIB3","series-title":"AMS Colloquium Publications","article-title":"Lattice Theory","author":"Birkhoff","year":"1967"},{"key":"10.1016\/0743-1066(96)00049-0_BIB4","series-title":"Proc. 12th Int. Conf. on Logic Programming","first-page":"565","article-title":"A New Procedural Interpretation of Horn Clauses with Equality","author":"Degtyarev","year":"1995"},{"issue":"3","key":"10.1016\/0743-1066(96)00049-0_BIB5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","article-title":"Declarative Modeling of the Operational Behavior of Logic Languages","volume":"69","author":"Falaschi","year":"1989","journal-title":"Theoretical Computer Sci."},{"key":"10.1016\/0743-1066(96)00049-0_BIB6","series-title":"Symp. on Logic Programming","first-page":"168","article-title":"Extending SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification","author":"Gallier","year":"1986"},{"issue":"3","key":"10.1016\/0743-1066(96)00049-0_BIB7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0743-1066(89)90028-9","article-title":"Extending SLD-Resolution to Equational Horn Clauses Using E-Unification","volume":"6","author":"Gallier","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(96)00049-0_BIB8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0304-3975(89)90004-2","article-title":"Complete Sets of Transformations for General E-Unification","volume":"67","author":"Gallier","year":"1989","journal-title":"Theoretical Computer Sci."},{"key":"10.1016\/0743-1066(96)00049-0_BIB9","series-title":"Logic Programming, Functions, Relations and Equations","first-page":"295","article-title":"EQLOG: Equality, Types and Generic Modules for Logic Programming","author":"Goguen","year":"1986"},{"issue":"20","key":"10.1016\/0743-1066(96)00049-0_BIB10","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","article-title":"The Integration of Functions into Logic Programming: From Theory to Practice","volume":"19","author":"Hanus","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(96)00049-0_BIB11","article-title":"Foundations of Equational Logic Programming","volume":"vol. 353","author":"H\u00f6lldobler","year":"1989"},{"key":"10.1016\/0743-1066(96)00049-0_BIB12","series-title":"Formal Languages: Perspectives and Open Problems","article-title":"Equations and Rewrite Rules","author":"Huet","year":"1980"},{"issue":"3","key":"10.1016\/0743-1066(96)00049-0_BIB13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0743-1066(84)90010-4","article-title":"A Theory of Complete Logic Programs with Equality","volume":"1","author":"Jaffar","year":"1983","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(96)00049-0_BIB14","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(84)90087-2","article-title":"Conditional Rewrite Rules","volume":"33","author":"Kaplan","year":"1984","journal-title":"Theoretical Computer Sci."},{"key":"10.1016\/0743-1066(96)00049-0_BIB15","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(96)00049-0_BIB16","first-page":"264","article-title":"Subdirect Products of Models","volume":"109","author":"Malcev","year":"1956","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0743-1066(96)00049-0_BIB17","series-title":"Algebraic Systems","author":"Malcev","year":"1973"},{"key":"10.1016\/0743-1066(96)00049-0_BIB18","first-page":"73","article-title":"Building-In Equational Theories","volume":"vol. 7","author":"Plotkin","year":"1972"},{"key":"10.1016\/0743-1066(96)00049-0_BIB19","first-page":"297","article-title":"SLDNF-Resolution with Equality","volume":"8","author":"Sheperdson","year":"1992","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/0743-1066(96)00049-0_BIB20","doi-asserted-by":"crossref","unstructured":"Thielscher, M., On the Completeness of SLDENF-Resolution, J. Automated Reasoning. To appear.","DOI":"10.1007\/BF00244496"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106696000490?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106696000490?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T14:21:58Z","timestamp":1555424518000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106696000490"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0743106696000490"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(96)00049-0","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}