{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T12:22:47Z","timestamp":1649161367902},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Automated Reasoning"],"published-print":{"date-parts":[[1986,12]]},"DOI":"10.1007\/bf00248250","type":"journal-article","created":{"date-parts":[[2004,10,31]],"date-time":"2004-10-31T15:10:14Z","timestamp":1099235414000},"page":"391-418","source":"Crossref","is-referenced-by-count":6,"title":["A class of confluent term rewriting systems and unification"],"prefix":"10.1007","volume":"2","author":[{"given":"Jia-Huai","family":"You","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. A.","family":"Subrahmanyam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Dershowitz, H., ?Equations as programming language?, in Proc. 4th Jerusalem Conference on Information Technology, pp. 114?123, May (1984)."},{"key":"CR2","unstructured":"Dershowitz, H. and Plaisted, D. ?Logic programming cum applicative programming?, in Proc. 1985 International Symposium on Logic Programming, pp. 54?67, Boston, Mass., July (1985)."},{"key":"CR3","unstructured":"Fay, M. J., ?First-order unification in an equational theory?, in 4th Workshop on Automated Deduction, pp. 161?167, Austin, Texas, February, (1979)."},{"key":"CR4","unstructured":"Fribourg, L., ?A superposition oriented theorem prover?, Tech. Report 11, L.I.T.P., 1983, To appear in Theoretical Compute Science, short version in Proc. IJCAI-89, pp. 923?925."},{"key":"CR5","unstructured":"Fribourg, L., ?SLOG: A logic programming language interpreter based on clausal superposition and rewriting?, in Proc. 1985 International Symposium on Logic Programming, pp. 172?184, Boston, Mass., July (1985)."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Goguen, J. and Meseguer, J., ?Equality, types, modules and generics for logic programming?, in Proc. Second International Logic Programming Conference, Uppsala, July (1984).","DOI":"10.1016\/0743-1066(84)90004-9"},{"issue":"No. 1","key":"CR7","first-page":"83","volume":"4","author":"C. M. Hoffmann","year":"1982","unstructured":"Hoffmann, C. M. and O'Donnell, M., ?Programming with Equations?, ACMTOPLAS, Vol. 4, No. 1, pp. 83?112, January (1982).","journal-title":"ACMTOPLAS"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Hullot, J. M., ?Canonical forms and unification?, in Proc. 5th Conference on Automated Deduction, pp. 318?334 (1980).","DOI":"10.21236\/ADA087640"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Hussmann, H., ?Unification in conditional-equational theories?, Tech. Report MIP 8502, Universitat Passau, January (1985).","DOI":"10.1007\/3-540-15984-3_328"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Knuth, D. and Bendix, P., ?Simple word problems in universal algebras?, in Computational Problems in Abstract Algebra J. Leech, (ed.) pp. 163?279, Pergamon Press (1970).","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"CR11","unstructured":"Jouannaud, J. P., Kirchner, C., and Kirchner, H., ?Incremental construction of unification algorithms in equational theories?, in Proc. 10th Colloquium on Automata, Languages and programming (1982)."},{"key":"CR12","unstructured":"Lankford, D. S., ?Canonical inference,? Technical Report ATP-32, Department of Mathematics and Computer Science, University of Texas at Austin, December (1975)."},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Peterson, G. E. and Stickel, M. E., ?Complete sets of reductions for some equational theories?, in Journal of ACM 28 (2): 233?264, April (1981).","DOI":"10.1145\/322248.322251"},{"key":"CR14","unstructured":"Plotkin, G., ?Building-in equational theories?, in Machine Intelligence 7, pp. 73?90, Edinburgh University press (1972)."},{"key":"CR15","volume-title":"Lecture Notes in Computer Science","author":"M. O'Donnell","year":"1977","unstructured":"O'Donnell, M., ?Computing in systems described by equations?, in Lecture Notes in Computer Science, Vol. 58, Springer-Verlag, New York (1977)."},{"key":"CR16","unstructured":"Reddy, U., ?Narrowing as the operational semanties of functional languages?, in proc. 1985 International Symposium on Logic Programming, pp. 138?151, Boston, Mass., July (1985)."},{"key":"CR17","unstructured":"Rety, P., Kirchner, C., Kirchner, H., and lescanne, P., ?NARROWER: A new algorithm and its application to logic programming?, in Proc. Rewriting Techniques and Applications, also in Lecture Notes in Computer Science 202, pp. 141?157 (1985)."},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"Robinson, J. A., ?A machine oriented logic based on the resolution,? in Journal of ACM, Vol. 12, No. 1 pp. 23?41, January (1985).","DOI":"10.1145\/321250.321253"},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"Siekmann, J., ?Universal unification?, in Proc. 7th International Conference on Automated Deduction, pp. 1?42, Napa, California, May (1984).","DOI":"10.1007\/978-0-387-34768-4_1"},{"key":"CR20","unstructured":"Subrahmanyam, P. A. and Jia-Huai You, ?FUNLOG: A computational model integrating logic programming and functional programming?, in Logic Programming: Relations, Functions and Equations, D. DeGroot and G. Lindstrom (eds.), Prentice-Hall (1986)."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"You, J.-H. and Subrahmanyam, P. A., ?Equational logic programming: an extension to equational programming?, in Proc. 13th POOL, pp. 209?218, St. Petersburg, Florida, January (1986).","DOI":"10.1145\/512644.512663"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00248250.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00248250\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00248250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T16:55:33Z","timestamp":1585932933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00248250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["BF00248250"],"URL":"https:\/\/doi.org\/10.1007\/bf00248250","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,12]]}}}