{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T17:49:22Z","timestamp":1725990562212},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319998398"},{"type":"electronic","value":"9783319998404"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-99840-4_14","type":"book-chapter","created":{"date-parts":[[2018,9,7]],"date-time":"2018-09-07T07:29:08Z","timestamp":1536305348000},"page":"245-260","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximating Any Logic Program by a CS-Program"],"prefix":"10.1007","author":[{"given":"Yohan","family":"Boichut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vivien","family":"Pelletier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"R\u00e9ty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,8]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ipl.2008.03.012","volume":"108","author":"Y Boichut","year":"2008","unstructured":"Boichut, Y., H\u00e9am, P.-C.: A theoretical limit for safety verification techniques with regular fix-point computations. Inf. Process. Lett. 108(1), 1\u20132 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"14_CR2","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10009-011-0205-y","volume":"14","author":"A Bouajjani","year":"2012","unstructured":"Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract regular (tree) model checking. J. Softw. Tools Technol. Transf. 14(2), 167\u2013191 (2012)","journal-title":"J. Softw. Tools Technol. Transf."},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BFb0052368","volume-title":"Rewriting Techniques and Applications","author":"T Genet","year":"1998","unstructured":"Genet, T.: Decidable approximations of sets of descendants and sets of normal forms. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol. 1379, pp. 151\u2013165. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/BFb0052368"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-45315-6_14","volume-title":"Foundations of Software Science and Computation Structures","author":"V Gouranton","year":"2001","unstructured":"Gouranton, V., R\u00e9ty, P., Seidl, H.: Synchronized tree languages revisited and new applications. In: Honsell, F., Miculan, M. (eds.) FoSSaCS 2001. LNCS, vol. 2030, pp. 214\u2013229. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45315-6_14"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-662-46081-8_12","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"B Kafle","year":"2015","unstructured":"Kafle, B., Gallagher, J.P.: Tree automata-based refinement with application to horn clause verification. In: D\u2019Souza, D., Lal, A., Larsen, K.G. (eds.) VMCAI 2015. LNCS, vol. 8931, pp. 209\u2013226. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46081-8_12"},{"issue":"1","key":"14_CR6","first-page":"69","volume":"1","author":"S Limet","year":"1997","unstructured":"Limet, S., R\u00e9ty, P.: E-unification by means of tree tuple synchronized grammars. Discrete Math. Theor. Comput. Sci. 1(1), 69\u201398 (1997)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-25979-4_12","volume-title":"Rewriting Techniques and Applications","author":"S Limet","year":"2004","unstructured":"Limet, S., Salzer, G.: Proving properties of term rewrite systems via logic programs. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 170\u2013184. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-25979-4_12"},{"issue":"4","key":"14_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10817-006-9064-8","volume":"37","author":"S Limet","year":"2006","unstructured":"Limet, S., Salzer, G.: Tree tuple languages from the logic programming point of view. J. Autom. Reason. 37(4), 323\u2013349 (2006)","journal-title":"J. Autom. Reason."},{"key":"14_CR9","first-page":"697","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"A Pettorossi","year":"1998","unstructured":"Pettorossi, A., Proietti, M.: Transformation of logic programs. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, pp. 697\u2013787. Oxford University Press, Oxford (1998)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Logic and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99840-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,7]],"date-time":"2018-09-07T07:35:29Z","timestamp":1536305729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99840-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319998398","9783319998404"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99840-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}