{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:25:53Z","timestamp":1725492353084},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755586"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75560-9_26","type":"book-chapter","created":{"date-parts":[[2007,10,6]],"date-time":"2007-10-06T05:36:46Z","timestamp":1191649006000},"page":"348-362","source":"Crossref","is-referenced-by-count":19,"title":["An Extension of the Knuth-Bendix Ordering with LPO-Like Properties"],"prefix":"10.1007","author":[{"given":"Michel","family":"Ludwig","sequence":"first","affiliation":[]},{"given":"Uwe","family":"Waldmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term rewriting and all that","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, New York (1998)"},{"issue":"3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1093\/logcom\/4.3.217","volume":"4","author":"L. Bachmair","year":"1994","unstructured":"Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation\u00a04(3), 217\u2013247 (1994)","journal-title":"Journal of Logic and Computation"},{"issue":"3\/4","key":"26_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01190829","volume":"5","author":"L. Bachmair","year":"1994","unstructured":"Bachmair, L., Ganzinger, H., Waldmann, U.: Refutational theorem proving for hierarchic first-order theories. Applicable Algebra in Engineering, Communication and Computing (AAECC)\u00a05(3\/4), 193\u2013212 (1994)","journal-title":"Applicable Algebra in Engineering, Communication and Computing (AAECC)"},{"issue":"2","key":"26_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01237233","volume":"28","author":"J. Dick","year":"1990","unstructured":"Dick, J., Kalmus, J., Martin, U.: Automating the Knuth-Bendix ordering. Acta Informatica\u00a028(2), 95\u2013119 (1990)","journal-title":"Acta Informatica"},{"key":"26_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/11591191_17","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M.-L. Fern\u00e1ndez","year":"2005","unstructured":"Fern\u00e1ndez, M.-L., Godoy, G., Rubio, A.: Recursive path orderings can also be incremental. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 230\u2013245. Springer, Heidelberg (2005)"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1016\/j.ic.2005.10.002","volume":"204","author":"H. Ganzinger","year":"2006","unstructured":"Ganzinger, H., Sofronie-Stokkermans, V., Waldmann, U.: Modular proof systems for partial functions with Evans equality. Information and Computation\u00a0204, 1453\u20131492 (2006)","journal-title":"Information and Computation"},{"key":"26_CR7","unstructured":"Hessenberg, G.: Grundbegriffe der Mengenlehre. Vandenhoeck & Ruprecht, G\u00f6ttingen (1906)"},{"key":"26_CR8","unstructured":"Hillenbrand, T., Weidenbach, C.: Superposition for finite domains. Research Report MPI-I-2007-RG1-002, Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken, Germany (April 2007)"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Just, W., Weese, M.: Discovering modern set theory. I: The Basics, Graduate Studies in Mathematics, vol.\u00a08. American Mathematical Society (1996)","DOI":"10.1090\/gsm\/008"},{"key":"26_CR10","unstructured":"Kamin, S., L\u00e9vy, J.-J.: Attempts for generalising the recursive path orderings. Manuscript Department of Computer Science, University of Illinois, Urbana-Champaign (1980), available at http:\/\/perso.ens-lyon.fr\/pierre.lescanne\/not_accessible.html"},{"key":"26_CR11","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D.E. Knuth","year":"1970","unstructured":"Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263\u2013297. Pergamon Press, Oxford (1970)"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10817-006-9031-4","volume":"36","author":"B. L\u00f6chner","year":"2006","unstructured":"L\u00f6chner, B.: Things to know when implementing KBO. Journal of Automated Reasoning\u00a036, 289\u2013310 (2006)","journal-title":"Journal of Automated Reasoning"},{"key":"26_CR13","unstructured":"Ludwig, M.: Extensions of the Knuth-Bendix ordering with LPO-like properties. Diploma thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany (July 2006)"},{"key":"26_CR14","unstructured":"McCune, W.: Otter 3.3 Reference Manual. Argonne National Laboratory, Argonne, IL, USA, Technical Memorandum No. 263 (August 2003)"},{"key":"26_CR15","unstructured":"Prevosto, V., Waldmann, U.: SPASS+T. In: Sutcliffe, G., Schmidt, R., Schulz, S. (eds.) ESCoR: FLoC 2006 Workshop on Empirically Successful Computerized Reasoning, Seattle, WA, USA. CEUR Workshop Proceedings, vol.\u00a0192, pp. 18\u201333 (August 2006)"},{"key":"26_CR16","first-page":"91","volume":"15","author":"A. Riazanov","year":"2002","unstructured":"Riazanov, A., Voronkov, A.: The design and implementation of Vampire. AI Communications\u00a015, 91\u2013110 (2002)","journal-title":"AI Communications"},{"key":"26_CR17","series-title":"Lecture Notes in Artificial Intelligence","first-page":"275","volume-title":"CADE-18","author":"C. Weidenbach","year":"2002","unstructured":"Weidenbach, C., Brahm, U., Hillenbrand, T., Keen, E., Theobalt, C., Topi\u0107, D.: SPASS version 2.0. In: Voronkov, A. (ed.) CADE-18. LNCS (LNAI), vol.\u00a02392, pp. 275\u2013279. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75560-9_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:24:44Z","timestamp":1619519084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75560-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755586"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75560-9_26","relation":{},"subject":[]}}