{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T22:31:58Z","timestamp":1784845918450,"version":"3.55.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030510534","type":"print"},{"value":"9783030510541","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-51054-1_27","type":"book-chapter","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T19:02:39Z","timestamp":1593457359000},"page":"416-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Automatically Proving and Disproving Feasibility Conditions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3984-2868","authenticated-orcid":false,"given":"Ra\u00fal","family":"Guti\u00e9rrez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9923-2108","authenticated-orcid":false,"given":"Salvador","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,6,24]]},"reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-319-24537-9_12","volume-title":"Reachability Problems","author":"N Andrianarivelo","year":"2015","unstructured":"Andrianarivelo, N., R\u00e9ty, P.: Over-approximating terms reachable by context-sensitive rewriting. In: Boja\u0144czyk, M., Lasota, S., Potapov, I. (eds.) RP 2015. LNCS, vol. 9328, pp. 128\u2013139. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-24537-9_12"},{"issue":"1\/2","key":"27_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N Dershowitz","year":"1987","unstructured":"Dershowitz, N.: Termination of rewriting. J. Symb. Comput. 3(1\/2), 69\u2013116 (1987). \nhttps:\/\/doi.org\/10.1016\/S0747-7171(87)80022-6","journal-title":"J. Symb. Comput."},{"issue":"3","key":"27_CR3","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10817-006-9057-7","volume":"37","author":"J Giesl","year":"2006","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and improving dependency pairs. J. Autom. Reasoning 37(3), 155\u2013203 (2006). \nhttps:\/\/doi.org\/10.1007\/s10817-006-9057-7","journal-title":"J. Autom. Reasoning"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0014969","volume-title":"TAPSOFT \u201987","author":"JA Goguen","year":"1987","unstructured":"Goguen, J.A., Meseguer, J.: Models and equality for logical programming. In: Ehrig, H., Kowalski, R., Levi, G., Montanari, U. (eds.) TAPSOFT 1987. LNCS, vol. 250, pp. 1\u201322. Springer, Heidelberg (1987). \nhttps:\/\/doi.org\/10.1007\/BFb0014969"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-030-29436-6_17","volume-title":"Automated Deduction \u2013 CADE 27","author":"R Guti\u00e9rrez","year":"2019","unstructured":"Guti\u00e9rrez, R., Lucas, S.: Automatic generation of logical models with AGES. In: Fontaine, P. (ed.) CADE 2019. LNCS (LNAI), vol. 11716, pp. 287\u2013299. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-29436-6_17"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-70590-1_13","volume-title":"Rewriting Techniques and Applications","author":"Y Kojima","year":"2008","unstructured":"Kojima, Y., Sakai, M.: Innermost reachability and context sensitive reachability properties are decidable for linear right-shallow term rewriting systems. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 187\u2013201. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-70590-1_13"},{"issue":"4","key":"27_CR7","first-page":"802","volume":"4","author":"Y Kojima","year":"2009","unstructured":"Kojima, Y., Sakai, M., Nishida, N., Kusakari, K., Sakabe, T.: Context-sensitive innermost reachability is decidable for linear right-shallow term rewriting systems. Inf. Media Technol. 4(4), 802\u2013814 (2009)","journal-title":"Inf. Media Technol."},{"key":"27_CR8","first-page":"192","volume":"4","author":"Y Kojima","year":"2011","unstructured":"Kojima, Y., Sakai, M., Nishida, N., Kusakari, K., Sakabe, T.: Decidability of reachability for right-shallow context-sensitive term rewriting systems. IPSJ Online Trans. 4, 192\u2013216 (2011)","journal-title":"IPSJ Online Trans."},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-319-94460-9_11","volume-title":"Logic-Based Program Synthesis and Transformation","author":"S Lucas","year":"2018","unstructured":"Lucas, S.: Analysis of rewriting-based systems as first-order theories. In: Fioravanti, F., Gallagher, J.P. (eds.) LOPSTR 2017. LNCS, vol. 10855, pp. 180\u2013197. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-94460-9_11"},{"key":"27_CR10","unstructured":"Lucas, S.: Context-sensitive computations in functional and functional logic programs. J. Funct. Logic Program. 1998(1) (1998). \nhttp:\/\/danae.uni-muenster.de\/lehre\/kuchen\/JFLP\/articles\/1998\/A98-01\/A98-01.html"},{"key":"27_CR11","doi-asserted-by":"publisher","unstructured":"Lucas, S.: Proving semantic properties as first-order satisfiability. Artif. Intell. 277 (2019). \nhttps:\/\/doi.org\/10.1016\/j.artint.2019.103174","DOI":"10.1016\/j.artint.2019.103174"},{"issue":"2","key":"27_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10817-019-09514-2","volume":"64","author":"S Lucas","year":"2019","unstructured":"Lucas, S.: Using well-founded relations for proving operational termination. J. Autom. Reasoning 64(2), 167\u2013195 (2019). \nhttps:\/\/doi.org\/10.1007\/s10817-019-09514-2","journal-title":"J. Autom. Reasoning"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.ipl.2018.04.002","volume":"136","author":"S Lucas","year":"2018","unstructured":"Lucas, S., Guti\u00e9rrez, R.: Use of logical models for proving infeasibility in term rewriting. Inf. Process. Lett. 136, 90\u201395 (2018). \nhttps:\/\/doi.org\/10.1016\/j.ipl.2018.04.002","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"27_CR14","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.ipl.2005.05.002","volume":"95","author":"S Lucas","year":"2005","unstructured":"Lucas, S., March\u00e9, C., Meseguer, J.: Operational termination of conditional term rewriting systems. Inf. Process. Lett. 95(4), 446\u2013453 (2005). \nhttps:\/\/doi.org\/10.1016\/j.ipl.2005.05.002","journal-title":"Inf. Process. Lett."},{"key":"27_CR15","doi-asserted-by":"publisher","unstructured":"Lucas, S., Meseguer, J.: Proving operational termination of declarative programs in general logics. In: Chitil, O., King, A., Danvy, O. (eds.) Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, Kent, Canterbury, United Kingdom, 8\u201310 September 2014, pp. 111\u2013122. ACM (2014). \nhttps:\/\/doi.org\/10.1145\/2643135.2643152","DOI":"10.1145\/2643135.2643152"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.jcss.2018.04.002","volume":"96","author":"S Lucas","year":"2018","unstructured":"Lucas, S., Meseguer, J., Guti\u00e9rrez, R.: The 2D dependency pair framework for conditional rewrite systems. Part I: definition and basic processors. J. Comput. Syst. Sci. 96, 74\u2013106 (2018). \nhttps:\/\/doi.org\/10.1016\/j.jcss.2018.04.002","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Lucas, S., Meseguer, J., Guti\u00e9rrez, R.: The 2D dependency pair framework for conditional rewrite systems\u2014Part II: advanced processors and implementation techniques. J. Autom. Reasoning (2020, in press)","DOI":"10.1007\/s10817-020-09542-3"},{"key":"27_CR18","unstructured":"McCune, W.: Prover9 and Mace4. \nhttps:\/\/www.cs.unm.edu\/~mccune\/mace4\/"},{"key":"27_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-030-17462-0_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F Me\u00dfner","year":"2019","unstructured":"Me\u00dfner, F., Sternagel, C.: nonreach \u2013 a tool for nonreachability analysis. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11427, pp. 337\u2013343. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-17462-0_19"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-030-17502-3_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Middeldorp","year":"2019","unstructured":"Middeldorp, A., Nagele, J., Shintani, K.: Confluence competition 2019. In: Beyer, D., Huisman, M., Kordon, F., Steffen, B. (eds.) TACAS 2019. LNCS, vol. 11429, pp. 25\u201340. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-17502-3_2"},{"key":"27_CR21","doi-asserted-by":"publisher","unstructured":"Nishida, N., Maeda, Y.: Narrowing trees for syntactically deterministic conditional term rewriting systems. In: Kirchner, H. (ed.) Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction. FSCD 2018. Leibniz International Proceedings in Informatics (LIPIcs), vol. 108, pp. 26:1\u201326:20. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2018.26","DOI":"10.4230\/LIPIcs.FSCD.2018.26"},{"key":"27_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3661-8","volume-title":"Advanced Topics in Term Rewriting","author":"E Ohlebusch","year":"2002","unstructured":"Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, Heidelberg (2002). \nhttp:\/\/www.springer.com\/computer\/swe\/book\/978-0-387-95250-5"},{"key":"27_CR23","volume-title":"Natural Deduction: A Proof-Theoretical Study","author":"D Prawitz","year":"2006","unstructured":"Prawitz, D.: Natural Deduction: A Proof-Theoretical Study. Dover, New York (2006)"},{"key":"27_CR24","unstructured":"Sternagel, C., Sternagel, T., Middeldorp, A.: CoCo 2018 Participant: ConCon 1.5. In: Felgenhauer, B., Simonsen, J. (eds.) Proceedings of the 7th International Workshop on Confluence. IWC 2018, p. 66 (2018). \nhttp:\/\/cl-informatik.uibk.ac.at\/events\/iwc-2018\/"},{"key":"27_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-030-17462-0_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Sternagel","year":"2019","unstructured":"Sternagel, C., Yamada, A.: Reachability analysis for termination and confluence of rewriting. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11427, pp. 262\u2013278. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-17462-0_15"},{"key":"27_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-319-94205-6_31","volume-title":"Automated Reasoning","author":"S Winkler","year":"2018","unstructured":"Winkler, S., Moser, G.: M\u00e6dMax: a maximal ordered completion tool. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018. LNCS (LNAI), vol. 10900, pp. 472\u2013480. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-94205-6_31"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51054-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T21:13:06Z","timestamp":1593465186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51054-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030510534","9783030510541"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51054-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Automated Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcar2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijcar2020.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"150","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.03","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.38","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11 system descriptions are also included. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}