{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:37:32Z","timestamp":1725550652764},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291077"},{"type":"electronic","value":"9783540320722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560647_7","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T10:04:06Z","timestamp":1129802646000},"page":"110-124","source":"Crossref","is-referenced-by-count":1,"title":["Solving First Order Formulae of Pseudo-Regular Theory"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Limet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Pillot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, United Kingdom (1998)"},{"key":"7_CR2","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (TATA) (1997), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1006\/inco.1994.1043","volume":"111","author":"H. Comon","year":"1994","unstructured":"Comon, H., Haberstrau, M., Jouannaud, J.-P.: Syntacticness, cycle-syntacticness, and shallow theories. Information and Computation\u00a0111(1), 154\u2013191 (1994)","journal-title":"Information and Computation"},{"key":"7_CR4","unstructured":"Fa\u00dfbender, H., Maneth, S.: A strict border for the decidability of e-unification for recursive functions. Journal of Functional and Logic Programming\u00a01998(4) (1998)"},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.46298\/dmtcs.240","volume":"1","author":"S. Limet","year":"1997","unstructured":"Limet, S., R\u00e9ty, P.: E-unification by means of tree tuple synchronized grammars. Discrete Mathematics and Theoretical Computer Science\u00a01, 69\u201398 (1997)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"7_CR6","unstructured":"Limet, S., Salzer, G.: Manipulating tree tuple languages by transforming logic programs. Technical Report RR-2004-01, LIFO, Universit\u00e9 d\u2019Orl\u00e9ans (2003)"},{"key":"7_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.\u00a03091, pp. 170\u2013184. Springer, Heidelberg (2004)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/BFb0056619","volume-title":"Principles of Declarative Programming","author":"S. Limet","year":"1998","unstructured":"Limet, S., Saubion, F.: A general framework for R-unification. In: Palamidessi, C., Meinke, K., Glaser, H. (eds.) ALP 1998 and PLILP 1998. LNCS, vol.\u00a01490, pp. 266\u2013281. Springer, Heidelberg (1998)"},{"key":"7_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-96826-6","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1984","unstructured":"Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (1984)"},{"issue":"1-2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0304-3975(00)00306-6","volume":"274","author":"D. Lugiez","year":"2002","unstructured":"Lugiez, D., Schnoebelen, P.: The regular viewpoint on PA-processes. Theoretical Computer Science\u00a0274(1-2), 89\u2013115 (2002)","journal-title":"Theoretical Computer Science"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-45789-5_5","volume-title":"Static Analysis","author":"F. Nielson","year":"2002","unstructured":"Nielson, F., Riis Nielson, H., Seidl, H.: Normalizable horn clauses, strongly recognizable relations and spi. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 20\u201335. Springer, Heidelberg (2002)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2730","volume":"147","author":"R. Nieuwenhuis","year":"1998","unstructured":"Nieuwenhuis, R.: Decidability and complexity analysis by basic paramodulation. Information and Computation\u00a0147, 1\u201321 (1998)","journal-title":"Information and Computation"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0304-3975(94)00227-A","volume":"142","author":"M. Proietti","year":"1995","unstructured":"Proietti, M., Pettorossi, A.: Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs. Theoretical Computer Science\u00a0142(1), 89\u2013124 (1995)","journal-title":"Theoretical Computer Science"},{"key":"7_CR14","series-title":"LNAI","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48242-3_10","volume-title":"Logic Programming and Automated Reasoning","author":"P. R\u00e9ty","year":"1999","unstructured":"R\u00e9ty, P.: Regular sets of descendants for constructor-based rewrite systems. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS (LNAI), vol.\u00a01705. Springer, Heidelberg (1999)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/10721975_17","volume-title":"Rewriting Techniques and Applications","author":"T. Takai","year":"2000","unstructured":"Takai, T., Kaji, Y., Seki, H.: Right-linear finite path overlapping term rewriting systems effectively preserve recognizability. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, pp. 270\u2013273. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560647_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T00:36:10Z","timestamp":1683246970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560647_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291077","9783540320722"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11560647_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}