{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:08Z","timestamp":1725663788809},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544968"},{"type":"electronic","value":"9783540384168"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54496-8_11","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:54:47Z","timestamp":1330210487000},"page":"204-219","source":"Crossref","is-referenced-by-count":1,"title":["Clausal rewriting: Applications and implementation"],"prefix":"10.1007","author":[{"given":"Robert","family":"Nieuwenhuis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Orejas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-50939-9_125","volume":"351","author":"E. Astesiano","year":"1989","unstructured":"E. Astesiano, M. Ceroli. On the existence of initial models for partial (high-order) conditional specifications, in Proc. TAPSOFT '89, vol 1, J. Diaz, F. Orejas (eds.) Springer Lect. Notes in Comp. Sc. 351 (1989) pp. 74\u201388.","journal-title":"Notes in Comp. Sc."},{"key":"11_CR2","unstructured":"L. Bachmair, N. Dershowitz, J. Hsiang: Orderings for equational proofs. In Proc. Symp. Logic in Computer Science, 346\u2013357, Boston (Massachusetts USA), 1986."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"L. Bachmair, H. Ganzinger: On restrictions of ordered paramodulation with simplification. In Proc. 10th Int. Conf. on Automated Deduction. LNCS. To appear.","DOI":"10.1007\/3-540-52885-7_105"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"L. Bachmair, H. Ganzinger: Completion of First Order Clauses with Equality By Strict Superposition. To appear in proc. Second Int. Workshop on Conditional and Typed Term Rewriting. LNCS, 1990.","DOI":"10.1007\/3-540-54317-1_89"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"W. Bousdira, J-L. Remy: On sufficient Completeness of Conditional Specifications. To appear in proc. Second Int. Workshop on Conditional and Typed Term Rewriting. LNCS, 1990.","DOI":"10.1007\/3-540-54317-1_97"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"N. Dershowitz: Termination of rewriting. Journal of Symbolic Computation, 69\u2013116, 1987.","DOI":"10.1016\/S0747-7171(87)80022-6"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"H. Ganzinger, R. Sch\u00e4fers: System support for order-sorted Horn clause specifications. In Proc. 12th Int. Conf. on Software Engineering. Nice. pp. 150\u2013159. 1990.","DOI":"10.1109\/ICSE.1990.63618"},{"key":"11_CR8","unstructured":"J. Hsiang, M. Rusinowitch: Proving refutational completeness of theorem proving strategies: The transfinite semantic tree method. Submitted for publication."},{"key":"11_CR9","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D.E. Knuth","year":"1970","unstructured":"D.E. Knuth, P.B. Bendix: Simple word problems in universal algebras. J. Leech, editor, Computational Problems in Abstract Algebra, 263\u2013297, Pergamon Press, Oxford, 1970."},{"key":"11_CR10","unstructured":"S. Kaplan: Fair conditional term rewriting systems: unification, termination and confluence. Recent Trends in Data Type Specification, Springer IFB 116 (1985)."},{"key":"11_CR11","first-page":"173","volume":"186","author":"D. Kapur","year":"1985","unstructured":"D. Kapur, P. Narendran, G. Sivakumar: A path Ordering for Proving Termination of Term Rewrite Systems. LNCS 186, 173\u2013187, 1985.","journal-title":"LNCS"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"R. Nieuwenhuis, F. Orejas, A. Rubio: TRIP: an implementation of clausal rewriting. In Proc. 10th Int. Conf. on Automated Deduction. Kaiserslautern 1990, LNCS 449, pp 667\u2013668.","DOI":"10.1007\/3-540-52885-7_133"},{"key":"11_CR13","unstructured":"R. Nieuwenhuis, F. Orejas: Clausal Completion. To appear in proc. Second Int. Workshop on Conditional and Typed Term Rewriting. (LNCS) Montreal 1990."},{"key":"11_CR14","unstructured":"R. Nieuwenhuis: Theorem proving in first order logic with equality by clausal rewriting and completion. PhD thesis, UPC Barcelona, 1990."},{"key":"11_CR15","unstructured":"M. Navarro, P. Nivela, F. Orejas, A. S\u00e1nchez: Translating partial into total specifications, Research Report LSI-89-21 Dept. Lenguajes y Sistemas Inform\u00e1ticos, UPC, 1989."}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Data Type Specification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54496-8_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:55:09Z","timestamp":1605646509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54496-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544968","9783540384168"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-54496-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}