{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:12Z","timestamp":1725662892948},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_15","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:02:02Z","timestamp":1330192922000},"page":"162-173","source":"Crossref","is-referenced-by-count":8,"title":["Oriented equational clauses as a programming language"],"prefix":"10.1007","author":[{"given":"L.","family":"Fribourg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"15_CR1","unstructured":"Bellia,M.,Degano,P. & Levi,G.,A functional plus predicate logic programming language,Proc. Logic Programming Workshop (Jul. 1980),334\u2013347."},{"key":"15_CR2","unstructured":"Colmerauer,A., Van Caneghem,M. & Kanoui,H.,PROLOG II, manuels de reference, d'utilisation et d'exemples,GIA:Groupe d'Intelligence Artificelle, Marseille, 1982."},{"key":"15_CR3","unstructured":"Colmerauer,A.,Prolog in 10 figures,Proc. IJCAI,Karslruhe,1983,487\u2013499."},{"key":"15_CR4","volume-title":"Computing with rewrite systems, Report No ATR-83 (8478)-1","author":"N. Dershowitz","year":"1983","unstructured":"Dershowitz, N., Computing with rewrite systems, Report No ATR-83 (8478)-1, The Aerospace Corporation, El Segundo, California,1983."},{"issue":"4","key":"15_CR5","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M. H. Emden van","year":"1976","unstructured":"van Emden M.H. & Kowalski R.A., The Semantics of Predicate Logic as a Programming Language,JACM 23,4 (Oct. 1976),733\u2013742.","journal-title":"JACM"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Fages,F.,Associative-Commutative Unification,Proc. CADE-7,Napa, 1984.","DOI":"10.1007\/978-0-387-34768-4_12"},{"key":"15_CR7","unstructured":"Fribourg,L.,A Superposition Oriented Theorem Prover,Technical Report 83\/11,L.I.T.P (to appear in TCS,short version in Proc. IJCAI-83,923\u2013925)."},{"key":"15_CR8","unstructured":"Fribourg,L.,Oriented equational clauses as a programming language, Technical Report 83\/51,L.I.T.P,Paris,1983."},{"issue":"1","key":"15_CR9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/357153.357158","volume":"4","author":"C. M. Hoffman","year":"1982","unstructured":"Hoffman, C.M. & O'Donnell, M.J.,Programming with equations, ACM trans on programming languages and systems 4,1 (Jan. 1982),83\u2013112.","journal-title":"ACM trans on programming languages and systems"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Hsiang,J. & Dershowitz,N.,Rewrite methods for clausal and non-clausal theorem proving,Proc. 10th ICALP,Barcelona, 1983.","DOI":"10.1007\/BFb0036919"},{"key":"15_CR11","first-page":"349","volume-title":"Equations and Rewrite Rules: A Survey, Formal language theory: perspectives and open problems","author":"G. Huet","year":"1980","unstructured":"Huet G. & Oppen D.C.,Equations and Rewrite Rules: A Survey, Formal language theory: perspectives and open problems,ed. Ronald V. Book,Academic Press, New-York,1980,349\u2013405."},{"key":"15_CR12","unstructured":"Kornfeld,W.,Equality for Prolog,Proc. IJCAI,Karlsruhe,1983,514\u2013519."},{"key":"15_CR13","first-page":"73","volume-title":"Building in equational theories, Machine Intelligence 7","author":"G. Plotkin","year":"1973","unstructured":"Plotkin, G.,Building in equational theories, Machine Intelligence 7, B Meltzer and D. Michie,Eds,Halsted Press, New-York,1973,73\u201390."},{"issue":"1","key":"15_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J. A. Robinson","year":"1965","unstructured":"Robinson, J.A.,A machine-oriented logic based on the resolution principle, J.ACM 12,1 (Jan. 1965),23\u201341.","journal-title":"J.ACM"},{"key":"15_CR15","first-page":"135","volume-title":"Paramodulation and theorem proving in first order theories with equality, Machine Intelligence 4","author":"G. A. Robinson","year":"1969","unstructured":"Robinson, G.A. & Wos L.,Paramodulation and theorem proving in first order theories with equality, Machine Intelligence 4, Meltzer & Michie,Eds,American Elsevier, New-York,1969,135\u2013150."},{"issue":"4","key":"15_CR16","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1145\/321850.321859","volume":"21","author":"J. R. Slagle","year":"1974","unstructured":"Slagle, J.R., Automated Theorem-Proving for Theories with Simplifiers, Commutativity and Associativity, J.ACM 21:4 (Oct 1974),622\u2013642.","journal-title":"J.ACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:07:11Z","timestamp":1605643631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}