{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:22:15Z","timestamp":1725495735803},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643012"},{"type":"electronic","value":"9783540697213"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0052365","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T05:31:11Z","timestamp":1149658271000},"page":"121-135","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Solving disequations modulo some class of rewrite systems"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Limet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"R\u00e9ty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,18]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"A. Antoy, R. Echahed, and M. Hanus. A Needed Narrowing Strategy. In Proceedings 21st ACM Symposium on Principle of Programming Languages, Portland, pages 268\u2013279, 1994.","DOI":"10.1145\/174675.177899"},{"key":"10_CR2","unstructured":"H. Comon. Disunification: a Survey. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT Press, 1991."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"H. Comon. Complete Axiomatizations of some Quotient Term Algebras. Theoretical Computer Science, 118(2), 1993.","DOI":"10.1016\/0304-3975(93)90108-6"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1006\/inco.1994.1043","volume":"111","author":"H. Comon","year":"1994","unstructured":"H. Comon, M. Haberstrau, and J.-P. Jouannaud. Syntacticness, Cycle-Syntacticness and Shallow Theories. Information and Computation, 111(1):154\u2013191, 1994.","journal-title":"Information and Computation"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. Van Leuven, editor, Handbook of Theoretical Computer Science. Elsevier Science Publishers, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01189020","volume":"3","author":"M. Fern\u00e1ndez","year":"1992","unstructured":"M. Fern\u00e1ndez. Narrowing Based Procedures for Equational Disunification. Applicable Algebra in Engineering Communication and Computing, 3:1\u201326, 1992.","journal-title":"Applicable Algebra in Engineering Communication and Computing"},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0022-0000(91)90009-T","volume":"42","author":"E. Giovannetti","year":"1991","unstructured":"E. Giovannetti, G. Levi, C. Moiso, and C. Palamidessi. Kernel LEAF: a Logic plus Functional Language. The Journal of Computer and System Sciences, 42(3):139\u2013185, 1991.","journal-title":"The Journal of Computer and System Sciences"},{"key":"10_CR8","first-page":"318","volume-title":"volume 87 of LNCS","author":"J.-M. Hullot","year":"1980","unstructured":"J.-M. Hullot. Canonical Forms and Unification. In W. Bibel and R. Kowalski, editors, Proceedings 5th International Conference on Automated Deduction, Les Arcs (France), volume 87 of LNCS, pages 318\u2013334. Springer-Verlag, 1980."},{"key":"10_CR9","first-page":"69","volume":"1","author":"S. Limet","year":"1997","unstructured":"S. Limet and P. R\u00e9ty. E-Unification by Means of Tree Tuple Synchronized Grammars. Discrete Mathematics and Theoritical Computer Science (http:\/\/www.chapmanhall.com\/dm), 1:69\u201398, 1997.","journal-title":"Discrete Mathematics and Theoritical Computer Science"},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0743-1066(92)90024-W","volume":"12","author":"J.J. Moreno-Navarro","year":"1992","unstructured":"J.J. Moreno-Navarro and M. Rodriguez-Artalejo. Logic Programming with Functions and Predicates:The Language BABEL. Journal of Logic Programming, 12(3):191\u2013223, 1992.","journal-title":"Journal of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052365","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:13:48Z","timestamp":1558271628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643012","9783540697213"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0052365","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"18 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}