{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:54Z","timestamp":1725663534022},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540192428"},{"type":"electronic","value":"9783540391661"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19242-5_5","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:05:28Z","timestamp":1330200328000},"page":"56-61","source":"Crossref","is-referenced-by-count":0,"title":["On the use of conditional rewrite rules in inductive theorem proving"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Fribourg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"[Bachmair et al. 86] Bachmair, L., Dershowitz, N., Hsiang, J. Ordering for Equational Proofs, 1st Symposium on Logic in Computer Science, Cambridge, pp. 346\u2013357, 1986.","DOI":"10.1007\/978-1-4684-7118-2_1"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0022-0000(86)90033-4","volume":"32","author":"J. Bergstra","year":"1986","unstructured":"Bergstra, J., Klop, J.W. Conditional Rewrite Rules: Confluence and Termination, Journal of Computer and System Sciences 32, pp. 323\u2013362, 1986.","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR3","unstructured":"Boyer, R., Moore, J.S. A Computational Logic. Academic Press, 1979."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Fribourg, L. A Strong Restriction of the Inductive Completion Procedure, 13th Intl. Colloquium on Automata, Languages and Programming, pp. 105\u2013115, Rennes, 1986. (also to appear in J. Symbolic Computation).","DOI":"10.1007\/3-540-16761-7_60"},{"key":"5_CR5","unstructured":"Ganzinger, H. A Completion Procedure for Conditional Equational Specifications. Technical Report, U. of Dortmund, 1987."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Hsiang, J., Rusinowitch, M., On Word Problems in Equational Theories, 14th Intl. Colloquium on Automata, Languages and Programming, Karlsruhe, 1987.","DOI":"10.1007\/3-540-18088-5_6"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Huet, G., Hullot, J.M. Proofs by Induction in Equational Theories with Constructors. 21st Annual Symp. on Foundations of Computer Science, pp. 96\u2013107, 1980.","DOI":"10.1109\/SFCS.1980.37"},{"key":"5_CR8","unstructured":"Jouannaud, J.P., Kounalis, E. Proofs by Induction in Equational Theories Without Constructors. Symp. on Logic in Computer Science, Cambridge (MA), pp. 358\u2013366, 1986."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(84)90087-2","volume":"33","author":"S. Kaplan","year":"1984","unstructured":"Kaplan, S. Conditional Rewrite Rules. Theoretical Computer Science 33, 175\u2013193, 1984.","journal-title":"Theoretical Computer Science"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Kaplan, S. Fair Conditional Term Rewriting Systems: Unification, Termination and Confluence. Rept. 194, L.R.I., U. of Orsay, 1984.","DOI":"10.1007\/978-3-662-09691-8_11"},{"key":"5_CR11","unstructured":"Kuechlin, W. Inductive Completion by Ground Proof Transformation. Rept. 87-08, U. of Delaware, 1987."},{"key":"5_CR12","unstructured":"Robinson., G., Wos, L. Paramodulation and Theorem Proving in First Order Theories with Equality, Machine Intelligence 4, Meltzer and Michie, eds., Edinburgh University Press, pp. 135\u2013150, 1969."},{"key":"5_CR13","unstructured":"Smith, D.R. Reasoning by Cases and the Formation of Conditional Programs. Intl. Joint Conf. on Artificial Intelligence, Los Angeles, pp. 215\u2013218, 1985."}],"container-title":["Lecture Notes in Computer Science","Conditional Term Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19242-5_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T17:51:49Z","timestamp":1687283509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19242-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540192428","9783540391661"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-19242-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}