{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:28:12Z","timestamp":1725550092898},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119989"},{"type":"electronic","value":"9783642119996"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11999-6_2","type":"book-chapter","created":{"date-parts":[[2010,3,16]],"date-time":"2010-03-16T04:52:29Z","timestamp":1268715149000},"page":"13-26","source":"Crossref","is-referenced-by-count":2,"title":["Constraint Based Strategies"],"prefix":"10.1007","author":[{"given":"Claude","family":"Kirchner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florent","family":"Kirchner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H\u00e9l\u00e8ne","family":"Kirchner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J.-M. Andreoli","year":"1992","unstructured":"Andreoli, J.-M.: Logic Programming with Focusing Proofs in Linear Logic. Journal of Logic and Computation\u00a02(3), 297\u2013347 (1992)","journal-title":"Journal of Logic and Computation"},{"key":"2_CR2","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, Cambridge (1998)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-73449-9_5","volume-title":"Term Rewriting and Applications","author":"E. Balland","year":"2007","unstructured":"Balland, E., Brauner, P., Kopetz, R., Moreau, P.-E., Reilles, A.: Tom: Piggybacking Rewriting on Java. In: Baader, F. (ed.) RTA 2007. LNCS, vol.\u00a04533, pp. 36\u201347. Springer, Heidelberg (2007)"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1142\/S0129054101000412","volume":"12","author":"P. Borovansk\u00fd","year":"2001","unstructured":"Borovansk\u00fd, P., Kirchner, C., Kirchner, H., Ringeissen, C.: Rewriting with strategies in ELAN: a functional semantics. International Journal of Foundations of Computer Science\u00a012(1), 69\u201398 (2001)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"2_CR5","unstructured":"Bourdier, T., Cirstea, H., Dougherty, D.J., H\u00e9l\u00e8ne, K.: Extensional and Intensional Strategies. In: Proceedings of the 9th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2009), Brasilia, June 28. Electronic Proceedings in Theoretical Computer Science (2010)"},{"issue":"2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.entcs.2006.09.026","volume":"174","author":"C.S. Coen","year":"2007","unstructured":"Coen, C.S., Tassi, E., Zacchiroli, S.: Tinycals: Step by Step Tacticals. Electronic Notes in Theoretical Computer Science\u00a0174(2), 125\u2013142 (2007)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"2_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-44404-1_7","volume-title":"Logic for Programming and Automated Reasoning","author":"D. Delahaye","year":"2000","unstructured":"Delahaye, D.: A Tactic Language for the System Coq. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol.\u00a01955, pp. 85\u201395. Springer, Heidelberg (2000)"},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1023\/A:1027357912519","volume":"31","author":"G. Dowek","year":"2003","unstructured":"Dowek, G., Hardin, T., Kirchner, C.: Theorem Proving Modulo. Journal of Automated Reasoning\u00a031(1), 33\u201372 (2003)","journal-title":"Journal of Automated Reasoning"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Lassez, J.-L.: Constraint Logic Programming. In: Proceedings of the 14th Annual ACM Symposium on Principles Of Programming Languages, Munich, Germany, pp. 111\u2013119 (1987)","DOI":"10.1145\/41625.41635"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-39185-1_10","volume-title":"Types for Proofs and Programs","author":"G. Jojgov","year":"2003","unstructured":"Jojgov, G.: Holes with Binding Power. In: Geuvers, H., Wiedijk, F. (eds.) TYPES 2002. LNCS, vol.\u00a02646, pp. 162\u2013181. Springer, Heidelberg (2003)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BFb0036921","volume-title":"Automata, Languages and Programming","author":"J.-P. Jouannaud","year":"1983","unstructured":"Jouannaud, J.-P., Kirchner, C., Kirchner, H.: Incremental Construction of Unification Algorithms in Equational Theories. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 361\u2013373. Springer, Heidelberg (1983)"},{"key":"2_CR12","unstructured":"Kirchner, C., Kirchner, F., Kirchner, H.: Strategic Computations and Deductions. In: Benzm\u00fcller, C., Brown, C.E., Siekmann, J., Statman, R. (eds.) Reasoning in Simple Type Theory. Festschrift in Honour of Peter B. Andrews on His 70th Birthday. Studies in Logic and the Foundations of Mathematics, vol.\u00a017, pp. 339\u2013364. College Publications (2008)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Kirchner, C., Kirchner, H.: Rewriting, Solving, Proving. A preliminary version of a book (1999), \n                    \n                      http:\/\/www.loria.fr\/ckirchne\/=rsp\/rsp.pdf","DOI":"10.1007\/978-3-642-59851-7_9"},{"issue":"3","key":"2_CR14","first-page":"9","volume":"4","author":"C. Kirchner","year":"1990","unstructured":"Kirchner, C., Kirchner, H., Rusinowitch, M.: Deduction with symbolic constraints. Revue d\u2019Intelligence Artificielle\u00a04(3), 9\u201352 (1990); Special issue on Automatic Deduction","journal-title":"Revue d\u2019Intelligence Artificielle"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-540-71316-6_9","volume-title":"Programming Languages and Systems","author":"C. Kirchner","year":"2007","unstructured":"Kirchner, C., Kopetz, R., Moreau, P.-E.: Anti-Pattern Matching. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 110\u2013124. Springer, Heidelberg (2007)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-88282-4_26","volume-title":"Language and Automata Theory and Applications","author":"C. Kirchner","year":"2008","unstructured":"Kirchner, C., Kopetz, R., Moreau, P.-E.: Anti-Pattern Matching Modulo. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 275\u2013286. Springer, Heidelberg (2008)"},{"key":"2_CR17","unstructured":"Kirchner, F., Mu\u00f1oz, C.: The Proof Monad. Submitted to the Journal of Logic and Algebraic Programming (2008)"},{"key":"2_CR18","unstructured":"L\u00e9vy, J.-J.: R\u00e9ductions correctes et optimales dans le lambda-calcul. PhD thesis, Universit\u00e9 de Paris VII (1978)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Liang, C., Miller, D.: A Unified Sequent Calculus for Focused Proofs. In: LICS: 24th Symp. on Logic in Computer Science, pp. 355\u2013364 (2009)","DOI":"10.1109\/LICS.2009.47"},{"key":"2_CR20","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"417","volume-title":"Proceedings Fifth International Workshop on Rewriting Logic and its Applications, WRLA 2004","author":"N. Mart\u00ed-Oliet","year":"2005","unstructured":"Mart\u00ed-Oliet, N., Meseguer, J., Verdejo, A.: Towards a Strategy Language for Maude. In: Mart\u00ed-Oliet, N. (ed.) Proceedings Fifth International Workshop on Rewriting Logic and its Applications, WRLA 2004, Barcelona, Spain, March 27\u2013April 4, 2004. Electronic Notes in Theoretical Computer Science, vol.\u00a0117, pp. 417\u2013441. Elsevier, Amsterdam (2005)"},{"volume-title":"Terese. Term Rewriting Systems","year":"2003","key":"2_CR21","unstructured":"Bezem, M., Klop, J.W., de Vrijer, R. (eds.): Terese. Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-45127-7_27","volume-title":"Rewriting Techniques and Applications","author":"E. Visser","year":"2001","unstructured":"Visser, E.: Stratego: A Language for Program Transformation based on Rewriting Strategies. System Description of Stratego 0.5. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 357\u2013361. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Functional and Constraint Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11999-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:35:12Z","timestamp":1558287312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11999-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119989","9783642119996"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11999-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}