{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T11:14:54Z","timestamp":1776942894902,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1987,8,1]],"date-time":"1987-08-01T00:00:00Z","timestamp":554774400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1987,8]]},"DOI":"10.1007\/bf00292110","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T16:13:40Z","timestamp":1096992820000},"page":"395-415","source":"Crossref","is-referenced-by-count":87,"title":["On sufficient-completeness and related properties of term rewriting systems"],"prefix":"10.1007","volume":"24","author":[{"given":"Deepak","family":"Kapur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hantao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/322290.322301","volume":"29","author":"R. Book","year":"1982","unstructured":"Book, R.: Confluent and Other Types of Thue Systems. J. Assoc. Comput. Mach. 29, 171?182 (1982)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR2","unstructured":"Comon, H.: Sufficient Completeness, Term Rewriting Systems and ?Anti-Unification?, to appear in the 8th International Conference on Automated Deduction, Oxford, England"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0019-9958(85)80003-6","volume":"65","author":"N. Dershowitz","year":"1985","unstructured":"Dershowitz, N.: Computing with Rewrite Systems. Inf. Control 65, 122?157 (1985) Earlier versions were available as Aerospace Corporation Technical Reports)","journal-title":"Inf. Control"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Goguen, J.: How to prove algebraic inductive hypotheses without induction. Proc. of the Fifth Conference on Automated Deduction 1980","DOI":"10.1007\/3-540-10009-1_27"},{"key":"CR5","unstructured":"Guttag, J.: The Specification and Application to Programming of Abstract Data Types. Department of Computer Science, Univ. of Toronto, Ph.D. Thesis, CSRG-59, 1975"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF00260922","volume":"10","author":"J. Guttag","year":"1978","unstructured":"Guttag, J., Horning, J.J.: The Algebraic Specification of Abstract Data Types, Acta Inf. 10, 27?52 (1978)","journal-title":"Acta Inf."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Huet, G.: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. JACM 27 (1980)","DOI":"10.1145\/322217.322230"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0022-0000(82)90006-X","volume":"25","author":"G. Huet","year":"1982","unstructured":"Huet, G., Hullot, J.M.: Proofs by Induction in Equational Theories with Constructors. J. Comput. Syst. Sci. 25, 239?266 (1982)","journal-title":"J. Comput. Syst. Sci."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Huet, G., Oppen, D.C.: Equations and Rewrite Rules: A Survey. In: Formal Language Theory: Perspectives and Open Problems (R. Book, ed.), pp. 349?405 New York: Academic Press","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"CR10","volume-title":"Proofs by Induction in Equational Theories Without Constructors","author":"J.-P. Jouannaud","year":"1985","unstructured":"Jouannaud, J.-P., Kounalis, E.: Proofs by Induction in Equational Theories Without Constructors, CRIN, University of Nancy, France, May 1985. (Also in the proceedings of the IEEE Symposium on Logic in Computer Science, pp. 358?366. Cambridge, Ma, 1986)"},{"key":"CR11","unstructured":"Kapur, D., Musser, D.R.: Proof by Consistency, Proc. of an NSF Workshop on the Rewrite Rule Laboratory, Sept. 4?6, 1983, Schenectady, G.E. R&D Center Report GEN84008, April 1984s (To appear in the Artif. Intell. J.)"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(85)90023-4","volume":"35","author":"D. Kapur","year":"1985","unstructured":"Kapur, D., Narendran, P.: A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System. Theor. Comput. Sci. 35, 337?344 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/B978-0-08-012975-4.50028-X","volume-title":"Computational Problems in Abstract Algebra","author":"D. Knuth","year":"1970","unstructured":"Knuth, D., Bendix, P.: Simple Word Problems in Universal Algebras. In: Computational Problems in Abstract Algebra (J. Leech, ed.), pp. 263?297. Oxford: Pergamon Press 1970"},{"key":"CR14","first-page":"348","volume-title":"Proc. EUROCAL '85 LNCS 204","author":"E. Kounalis","year":"1985","unstructured":"Kounalis, E.: Completeness in Data Type Specifications. Proc. EUROCAL '85 LNCS 204 (Bob F. Caviness, ed.). pp. 348?362. Berlin, Heidelberg, New York: Springer 1985"},{"key":"CR15","volume-title":"A General Completeness Test for Equational Specifications","author":"E. Kounalis","year":"1984","unstructured":"Kounalis, E., Zhang, H.: A General Completeness Test for Equational Specifications. (Unpublished Manuscript, CRIN Nancy, France, November 1984)"},{"key":"CR16","series-title":"Memo MTP-14","volume-title":"A Simple Explanation of Inductionless Induction","author":"D.S. Lankford","year":"1981","unstructured":"Lankford, D.S.: A Simple Explanation of Inductionless Induction. Memo MTP-14, Dept. of Mathsematics, Louisiana Tech. University, Ruston, Louisiana, USA 1981"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Musser, D.R.: On Proving Inductive Properties of Abstract Data Types. Proc. 7th Principles of Programming Languages, Las Vegas USA, 1980","DOI":"10.1145\/567446.567461"},{"key":"CR18","volume-title":"Ph.D. Thesis","author":"P. Narendran","year":"1983","unstructured":"Narendran, P.: Church-Rosser and Related Thue Systems. Ph.D. Thesis, Department Mathematsics, RPI, Troy, NY, USA 1983, also G.E. R&D Center Report No. 84CRD176, July 1984"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0022-0000(85)90051-0","volume":"30","author":"P. Narendran","year":"1985","unstructured":"Narendran, P., \u00d3'D\u00fanlaing, C., Rolletschek, H.: Complexity of Certain Decision Problems about Congruential Languages. J Comput. Syst. Sci. 30, 343?358 (1985)","journal-title":"J Comput. Syst. Sci."},{"key":"CR20","first-page":"257","volume-title":"Proc. of the 6th GI Conf. on Theoretical Computer Science, LNCS 145","author":"T. Nipkow","year":"1983","unstructured":"Nipkow, T.., Weikum G.: A Decidability Result about Sufficient-Completeness of Axiomatically Specified Abstract Data Types. Proc. of the 6th GI Conf. on Theoretical Computer Science, LNCS 145 (Cremers and Kreigel, eds.), pp. 257?268. Berlin, Heidelberg, New York: Springer (1983)"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0304-3975(84)90090-2","volume":"33","author":"F. Otto","year":"1984","unstructured":"Otto, F.: Some Undecidability Results for Non-Monadic Church-Rosser Thue Systems, Theor. Comput. Sci. 33, p 261?278 (1984)","journal-title":"Theor. Comput. Sci."},{"key":"CR22","unstructured":"Plaisted, D.: Semantic Confluence Tests and Completion Methods. (Unpublished Manuscript, Univ. of Illinois, November 25, 1983)"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/S0019-9958(85)80005-X","volume":"6b5","author":"D. Plaisted","year":"1985","unstructured":"Plaisted, D.: Semantic Confluence Tests and Completion Methods. Inf. Control 6b5, 182?215 (1985)","journal-title":"Inf. Control"},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"Thiel, J.J.: Stop Losing Sleep over Incomplete Data Type Specifications. Proc. Eleventh Annual ACM Symposium on Principles of Programming Languages, Salt Lake City, Utah, 1984","DOI":"10.1145\/800017.800518"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00292110.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00292110\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00292110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T08:23:54Z","timestamp":1585902234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00292110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,8]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,8]]}},"alternative-id":["BF00292110"],"URL":"https:\/\/doi.org\/10.1007\/bf00292110","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,8]]}}}