{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:49Z","timestamp":1725456769308},"publisher-location":"Berlin\/Heidelberg","reference-count":28,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029631","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:33:46Z","timestamp":1133397226000},"page":"369-377","source":"Crossref","is-referenced-by-count":0,"title":["Pumping lemmrs for tree languages generated by rewrite systems"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Kounalis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","volume-title":"A Computational Logic","author":"Boyer","year":"1979","unstructured":"[Boyer and Moore(1979)]: A Computational Logic. (Academic Press, New York, 1979)."},{"issue":"1","key":"40_CR2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/comjnl\/12.1.41","volume":"12","author":"Burstall","year":"1969","unstructured":"[Burstall (1969)]: \"Proving properties of programs by structural induction\" Computer Journal 12(1), 41\u201348, 1969.","journal-title":"Computer Journal"},{"key":"40_CR3","unstructured":"[Colmerauer (1984)]: \"Equations and Inequations on finite and infinite trees\" Proc. FGCS 85\u201399,1984."},{"key":"40_CR4","unstructured":"[Comon(1986)]: \"SufficientCompleteness,Rewrite Systems and Anti-Unification\" Proc.8th CADE 128\u2013140, 1986."},{"issue":"2\/3","key":"40_CR5","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0019-9958(85)80003-6","volume":"65","author":"Dershowitz","year":"1985","unstructured":"[Dershowitz (1985)]: \"Computing with rewrite systems\" Information and Control 65(2\/3) 122\u2013157, 1985","journal-title":"Information and Control"},{"issue":"2","key":"40_CR6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0304-3975(85)90089-1","volume":"37","author":"Gallier","year":"1985","unstructured":"[Gallier and Book (1985)]: \"Reductions in tree replacement systems\" TCS 37(2) Nov. 1985 123\u2013150.","journal-title":"TCS"},{"key":"40_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF00260922","volume":"10","author":"Guttag","year":"1978","unstructured":"[Guttag and Horning (1978)]: \"The algebraic specifications of abstract types\" Acta Informatica 10, 27\u201352 1978.","journal-title":"Acta Informatica"},{"key":"40_CR8","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979","unstructured":"[Hopcroft and Ullman (1979)]: Introduction to Automata Theory, Languages, and Computation. (Addison-Wesley, Reading. Mass. 1979)"},{"issue":"4","key":"40_CR9","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"Huet","year":"1980","unstructured":"[Huet (1980)]: \"Confluent reductions: abstract properties and applications to term rewriting systems. JACM 27 (4),1980 797\u2013821.","journal-title":"JACM"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"[Huet and Hullot (1982)]: \"Proofs by induction in equational theories with constructors\" JCSS 25 (2) 1982","DOI":"10.1016\/0022-0000(82)90006-X"},{"key":"40_CR11","first-page":"1","volume":"82","author":"Jouannaud","year":"1989","unstructured":"[Jouannaud and Kounalis (1986)]: \"Automatic Proofs by induction in equational theories without constructors\" Proc. 1st Symp. on Logic in Computer Science, 1986. Full paper in Information and Control Vol 82 (1989) 1\u201333.","journal-title":"Proc. 1st Symp. on Logic in Computer Science, 1986. Full paper in Information and Control"},{"key":"40_CR12","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF00292110","volume":"24","author":"Kapur","year":"1987","unstructured":"[Kapur, Narendran and Kapur, (1987)]: \"On Sufficient Completeness and Related Properties of term rewriting systems\" Acta Informatiqua 24, 395\u2013415 (1987)","journal-title":"Acta Informatiqua"},{"key":"40_CR13","unstructured":"[Knuth and Bendix (1970)]: \"Simple Word Problems in Universal Algebras,\" In Computational problems in Abstract Algebra (1970) 263\u2013297."},{"key":"40_CR14","unstructured":"[Kounalis (1985)]: \"Validation des Sp\u00e9cifications Alg\u00e9briques par Compl\u00e9tion Inductive\" Th\u00e8se Univ. Nancy 1."},{"key":"40_CR15","unstructured":"[Kounalis (1990)]: \"Testing for inductive (co)-reducibility\". Proc.15 th Coll. on Trees in Algebra and Programming (CAAP 90), LNCS to appear."},{"key":"40_CR16","unstructured":"[Kounalis and Rusinowithc (1990)]: \"Mechanizing inductive reasoning\". Proc of 8th conf. of American Association in Artificial Inteligence (AAAI 90) to appear."},{"issue":"4","key":"40_CR17","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"Kunen","year":"1987","unstructured":"[Kunen 1987]: \"Negation in Logic Programming\". J. Logic Programming 4(4) 1987 289\u2013308.","journal-title":"J. Logic Programming"},{"key":"40_CR18","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF00243794","volume":"3","author":"Lassez","year":"1987","unstructured":"[Lassez and Marriott (1987)]: \"Explicit Representation of terms Defined by Counterexamples\". J. Automated Reasoning 3 1987 301\u2013317.","journal-title":"J. Automated Reasoning"},{"key":"40_CR19","unstructured":"[Lloyd (1984)]: Foundations of Logic Programming. Springer-Verlag 1984."},{"key":"40_CR20","unstructured":"[Lugiez (1989)]: \"A deduction procedure for first-order logic programs\" Proc. 6th Conf. Logic Programming 1989."},{"key":"40_CR21","unstructured":"[Maher (1988)]: \"Complete axiomatizations of the algebras, rational and infinite trees\" Proc.3st Symp.on Logic in Computer Science, 1988 348\u2013357"},{"key":"40_CR22","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0004-3702(83)90016-4","volume":"20","author":"Michalski","year":"1983","unstructured":"[Michalski (1983)]: \"A theory and methodology of Inductive learning\" Artificial Intelligence 20, 1983, 111\u2013161.","journal-title":"Artificial Intelligence"},{"key":"40_CR23","unstructured":"[Peyton-Jones (1987)]: The Implementation of Functional Programming Languages. Prentice-Hall, 1987."},{"key":"40_CR24","doi-asserted-by":"crossref","unstructured":"[Plaisted (1985)]: \"Semantic Confluence tests and Completion methods.\" Information and Control 65 (2\/3) 1985","DOI":"10.1016\/S0019-9958(85)80005-X"},{"issue":"4","key":"40_CR25","first-page":"373","volume":"15","author":"Raoult","year":"1981","unstructured":"[Raoult (1980)]: \"Finiteness results on Term rewriting\" RAIRO vol. 15 (4), 1981, 373\u2013391.","journal-title":"RAIRO"},{"key":"40_CR26","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6423(88)90002-0","volume":"11","author":"Schnoebelen","year":"1988","unstructured":"[Schnoebelen (1988)]: \"Refined compilation of pattern-matching for functional languages\". Science of Computer Programming 11, 1988, 133\u2013159.","journal-title":"Science of Computer Programming"},{"key":"40_CR27","first-page":"402","volume":"259","author":"Schnoebelen","year":"1987","unstructured":"[Schnoebelen (1987)]: \"Rewriting techniques for the temopal analysis of communicating processes\". Proc. PARLE in LNCS 259, 1987, 402\u2013419.","journal-title":"Proc. PARLE in LNCS"},{"key":"40_CR28","volume-title":"Contribution to Mathematical Logic","author":"A. TARSKI","year":"1988","unstructured":"[Tarski (1968)] TARSKI, A. \"Equational logic and Equational theories of algebras\". In K. Schutte ed., Contribution to Mathematical Logic, Horth-Holland, Amsterdam, 1988."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029631","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:15:48Z","timestamp":1586578548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/bfb0029631","relation":{},"subject":[]}}