{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:29:57Z","timestamp":1725467397809},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645825"},{"type":"electronic","value":"9783540693482"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-64582-9_734","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T14:22:10Z","timestamp":1153146130000},"page":"37-46","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Theory of constructible domains for robotics: Why?"],"prefix":"10.1007","author":[{"given":"Marta","family":"Fra\u0148ov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monia","family":"Kooli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"key":"3_CR1","unstructured":"M. Franova: CM-strategy: A Methodology for Inductive Theorem Proving or Constructive Well-Generalized Proofs; in: A. K. Joshi, (ed): Proc. 9th IJCAI; 1985, 1214\u20131220."},{"key":"3_CR2","series-title":"Res. Report No.874","volume-title":"Constructive Matching methodology and automatic plan-construction revisited","author":"M. Franova","year":"1993","unstructured":"M. Franova: Constructive Matching methodology and automatic plan-construction revisited; Res. Report No.874, L.R.I., Orsay, France, November, 1993."},{"key":"3_CR3","series-title":"Res. Report No.970","volume-title":"A Theory of Constructible Domains \u2014 a formalization of inductively defined systems of objects for a user-independent automation of inductive theorem proving, Part I","author":"M. Franova","year":"1995","unstructured":"M. Franova: A Theory of Constructible Domains \u2014 a formalization of inductively defined systems of objects for a user-independent automation of inductive theorem proving, Part I; Res. Report No.970, L.R.I., Orsay, France, Mai, 1995."},{"key":"3_CR4","unstructured":"M. Franova: Definitions Reformulation and Formulation: Why and How? (Saying \u2018Good-bye\u2019 to the notion of the well-founded relation); avail. as a report."},{"key":"3_CR5","unstructured":"M. Franova, M. Kooli: Recursion Manipulation for Robotics: Why and How?; to appear in proc. of EMCSR'98."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"J. Giesel: Termination Analysis for Functional Programs using Term Orderings; Proc. of SAS'95, LNCS 983, 1995, 154\u2013171.","DOI":"10.1007\/3-540-60360-3_38"},{"key":"3_CR7","unstructured":"G. Huet: Induction Principles formalized in the Calculus of Constructions; Programming of Future Generation Computers, Elsevier, 1988, 205\u2013216."},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF00881917","volume":"15","author":"K. Kunen","year":"1995","unstructured":"K. Kunen: A Ramsey Theorem in Boyer-Moore Logic; Journal of Automated Reasoning, 1995, Vol.15, No.2, 217\u2013235.","journal-title":"Journal of Automated Reasoning"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF00247434","volume":"3","author":"Z. Manna","year":"1987","unstructured":"Z. Manna, R. Waldinger: How to Clear a Block: A Theory of Plans; Journal of Automated Reasoning 3, 1987, 343\u2013377.","journal-title":"Journal of Automated Reasoning"},{"key":"3_CR10","unstructured":"D. McAllester, K. Arkoudas: Walther recursion; in: LNAI 1104, 1996, 643\u2013657."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"C. Paulin-Mohring: Inductive Definitions in the system Coq Rules and Properties; in: LNCS 664, Springer-Verlag, 1993, 328\u2013345.","DOI":"10.1007\/BFb0037116"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00881916","volume":"15","author":"L. C. Paulson","year":"1995","unstructured":"L. C. Paulson: Set Theory for Verification; J. of Aut. Reasoning Vol. 15, No.2, 1995, 167\u2013215.","journal-title":"J. of Aut. Reasoning"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"L. C. Paulson: A fixedpoint approach to implementing (co)inductive definitions; in: LNAI 814, Springer-Verlag, 1994, 148\u2013161.","DOI":"10.1007\/3-540-58156-1_11"},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0304-3975(94)90014-0","volume":"124","author":"A. M. Pitts","year":"1994","unstructured":"A. M. Pitts: A co-induction principle for recursively defined domains; Theoretical Computer Science, vol. 124, No. 2, 1994, 195\u2013219.","journal-title":"Theoretical Computer Science"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0004-3702(93)90109-O","volume":"64","author":"R. Reiter","year":"1993","unstructured":"R. Reiter: Proving Properties of States in the Situaton Calculus; Artificial Intelligence 64, 1993, 337\u2013351.","journal-title":"Artificial Intelligence"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0004-3702(76)90002-3","volume":"7","author":"O. Stepankova","year":"1976","unstructured":"O. Stepankova, I.M. Havel: A Logical Theory of Robot Problem Solving; Artificial Intelligence 7, 1976, 129\u2013161.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"705","DOI":"10.2307\/2275781","volume":"61","author":"P. Taylor","year":"1996","unstructured":"P. Taylor: Intuitionistic Sets and ordinals; Journal of Symb. Logic, Vol. 61, No. 3, Sept, 1996, 705\u2013744.","journal-title":"Journal of Symb. Logic"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0004-3702(94)90063-9","volume":"71","author":"C. Walther","year":"1994","unstructured":"C. Walther: On Proving the Termination of Algorithms by Machine; Artificial Intelligence, vol. 71, no. 1, 1994, 101\u2013159.","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Methodology and Tools in Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-64582-9_734","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T02:27:09Z","timestamp":1558837629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-64582-9_734"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645825","9783540693482"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-64582-9_734","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"30 July 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}