{"type":"ScholarlyArticle","title":"Associative-Commutative Rewriting","authors":[{"name":"Nachum Dershowitz","slug":"nachum-dershowitz","given":"Nachum","family":"Dershowitz","affiliation":"Department of Computer Science Vniversity of Illinois Urbana , IL 61801"},{"name":"Jieh Hsiang","slug":"jieh-hsiang","given":"Jieh","family":"Hsiang","affiliation":"Department of Computer Science University of Illinois Urbana , IL 61801"},{"name":"N. Alan Josephson","slug":"n-alan-josephson","given":"N. Alan","family":"Josephson","affiliation":"Department of Computer Science State University of New York Stonybrook , NY 11794"},{"name":"David A. Plaisted","slug":"david-a-plaisted","given":"David A.","family":"Plaisted","affiliation":"Computer Science Laboratory SRI International Menlo Park , CA 94025"}],"abstract":"We are currently extending the rewrite system laboratory REVE to ha ndle associative-commutative operators. In particul ar, we arc incorporating a set of rules for Boolean algebra that provides a refutationally-complete theorem prov er and a new progr a mming paradigm. To that end, we describe m et hods for proving termination of associativecommutativ e systems.","doi":null,"url":"https://ijcai.org/proceedings/1983/222","pdf":"https://ijcai.org/proceedings/1983/0222.pdf","markdown":"https://ijcai.org/proceedings/1983/222.md","bibtex":"https://ijcai.org/proceedings/1983/bibtex/222","volume":{"slug":"1983","title":"Proceedings of the Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1983","url":"https://ijcai.org/proceedings/1983/","year":1983,"location":"Karlsruhe, West Germany","dates":"","editors":"Alan Bundy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Theorem Proving","track":"Theorem Proving","number":222,"pages":{"first":940,"last":943},"keywords":[],"videos":[],"references":[{"position":1,"raw":"Dershowitz, N. [1 982], Orderings for term-rewriting sys- tems, J. of Theoretical Computer Science 17:3, pp. 279- 301.","title":"Orderings for term-rewriting systems","authors":"N Dershowitz","year":null,"venue":"J. of Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"Dershowitz, N., and Z. Manna [1979], Proving termina- tion with multisct orderings, Comm . A CM 22:8, pp. 465-476.","title":"Proving termination with multisct orderings","authors":"N Dershowitz, Z Manna","year":"1979","venue":"Comm . A CM","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"Hogger, C.J. [Apr. 1981], \"Derivation of logic pro- grams,\" J. ACM, vol. 28, no. 2, pp. 372-392.","title":"Derivation of logic programs","authors":"C J Hogger","year":"1981","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"Hsiang, J. [1982], Topic& in automated theorem pro11ing and program generation, Ph.D. thesis, Department of Computer Science, University of Illinois, Urbana, Illinois.","title":"Topic& in automated theorem pro11ing and program generation","authors":"J Hsiang","year":"1982","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"Hsiang, J. and Dershowitz, N. [1983], Rewrite method& for clausal and non-clau&al theorem pro11ing, Proc. lOth EATCS Inti. Colloq. on Automata, Languages and Pro- gramming, Barcelona, Spain, to appear.","title":"Rewrite method& for clausal and non-clau&al theorem pro11ing","authors":"J Hsiang, N Dershowitz","year":"1983","venue":"Proc. lOth EATCS Inti. Colloq. on Automata, Languages and Programming","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"Huet, G., and J . Hullot [1980], Proofs by induction in equational theories with constructors, Proc. !Jlst Annual Symposium on Foundations of Computer Science, pp. 96-107 .","title":"Proofs by induction in equational theories with constructors","authors":"G Huet, J Hullot","year":"1980","venue":"Proc. !Jlst Annual Symposium on Foundations of Computer Science","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"Huet, G., and D. C. Oppen [1980], Equations and rewrite rules: a survey, in Formal Languages: Perspecti11es and Open Problems (R. Book, ed.) Academic Press, New York.","title":"Equations and rewrite rules: a survey","authors":"G Huet, D C Oppen","year":"1980","venue":"Formal Languages: Perspecti11es and Open Problems (R. Book","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"Kamin , S., and J . J . Levy [1980], Two generalizations of the recur.~it•e path ordering, Unpublished note, Depart- ment. of Computer Science, University of Illinois, Urbana, Illinois.","title":"Two generalizations of the recur.~it•e path ordering","authors":"S Kamin, J J Levy","year":"1980","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"D. E. Knuth [1968], Fundamental algorithms, The Art of Computer Programming, vol. I, Addison-Wesley, !lead- ing.","title":"Fundamental algorithms","authors":"D E Knuth","year":"1968","venue":"The Art of Computer Programming","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"Knuth, D. E., and P. B. Bendix [1970], Simple word problems in universal algebras, Computational Problems in Abstract Algebra (J. Leech, ed .) Pergamon Press, Oxford, pp. 263-297.","title":"Simple word problems in universal algebras","authors":"D E Knuth, P B Bendix","year":"1970","venue":"Computational Problems in Abstract Algebra","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"II. Kowalski, R. [1974] , Predicate logic as a programming language, D.C .L. Memo No. 70, Edinburgh University, Edinburgh, Scotland.","title":"Predicate logic as a programming language","authors":"Ii, R Kowalski","year":"1974","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"Lankford, D. S. [1975], Canonical algebraic simplification in computational logic, Report No. ATP-25, Department of Mathematics, Southwestern University, Georgetown, Texas.","title":"Canonical algebraic simplification in computational logic","authors":"D S Lankford","year":"1975","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"Lankford, D. S., and A. M. Ballantyne [1977], Decision procedures for &imple equational theories with commuta- tille axioms: Complete acta of commutati11e reductiona, Memo ATP-35, Department of Mathematics and Com- puter Sciences, University of Texas, Austin, Texas.","title":"Decision procedures for &imple equational theories with commutatille axioms: Complete acta of commutati11e reductiona","authors":"D S Lankford, A M Ballantyne","year":"1977","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"Lescanne, P. [1983], Computer experiments with the REVE term rewriting system generator, Proc. 10th Conf. on Principles of Programming Languages.","title":"Computer experiments with the REVE term rewriting system generator","authors":"P Lescanne","year":"1983","venue":"Proc. 10th Conf. on Principles of Programming Languages","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"Livesey, M., and J . Siekmann [1976], Unification of A+ C-terma (bags} and A+ C+ /-terms {sets}, Intern. Ber. Nr. 5/76, lnst. fur lnformatik, University Karlsruhe, Karlsruhe, W. Germany.","title":"Unification of A+ C-terma (bags} and A+ C+ /-terms {sets}, Intern. Ber. Nr","authors":"M Livesey, J Siekmann","year":"1976","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"Manna, Z., and S. Ness [1970], On the termination of Markov algorithms, Proc. of the Third Hawaii Interna- tional Conference on System Science, Honolulu, Hawaii .","title":"On the termination of Markov algorithms","authors":"Z Manna, S Ness","year":"1970","venue":"Proc. of the Third Hawaii International Conference on System Science","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"Peterson, G . E., and M. E. Stickel [1981], Complete sets of reductions for some equational theories, J. A CM 28:2, pp. 233-264.","title":"Complete sets of reductions for some equational theories","authors":"G E Peterson, M E Stickel","year":"1981","venue":"J. A CM","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"Plaisted, D. A. [1978], A recursively defined ordering for proving termination of term rewriting systems, Univer- sity of Illinois Report No. UIUCDCS-R-78-943, Depart- ment Computer Science, University of Illinois, Urbana, Illinois .","title":"A recursively defined ordering for proving termination of term rewriting systems","authors":"D A Plaisted","year":"1978","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"Stickel, M.E. [1981], A unification algorithm for associative-commutative functions, J. A CM, 28:3, pp. 423-434.","title":"A unification algorithm for associative-commutative functions","authors":"M E Stickel","year":"1981","venue":"J. A CM","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"Watts, D. E., and J. K. Cohen [1980], Computer imple- mented set theory, American Mathematical Monthly 87:7, pp. 557-560.","title":"Computer implemented set theory","authors":"D E Watts, J K Cohen","year":"1980","venue":"American Mathematical Monthly","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}