{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T17:50:32Z","timestamp":1673632232074},"reference-count":28,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3669,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0747-7171(03)00025-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T21:48:28Z","timestamp":1051134508000},"page":"193-216","source":"Crossref","is-referenced-by-count":7,"title":["Constraint contextual rewriting"],"prefix":"10.1016","volume":"36","author":[{"given":"Alessandro","family":"Armando","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvio","family":"Ranise","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(03)00025-7_B1","series-title":"ISSAC-01, Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation","first-page":"32","article-title":"Maple\u2019s evaluation process as constraint contextual rewriting","author":"Armando","year":"2001"},{"key":"10.1016\/S0747-7171(03)00025-7_B2","doi-asserted-by":"crossref","unstructured":"Armando, A., Compagna, L., Ranise, S., 2001. RDL\u2014rewrite and decision procedure laboratory. In: IJCAR 2001, Proceedings of the International Joint Conference on Automated Reasoning, Siena, Italy, June, 2001","DOI":"10.1007\/3-540-45744-5_54"},{"key":"10.1016\/S0747-7171(03)00025-7_B3","unstructured":"Armando, A., Ranise, S., 1998. Constraint contextual rewriting. In: Caferra, R., Salzer, G. (Eds.), FTP\u201998, Proceedings of the 2nd International Workshop on First Order Theorem Proving, Vienna, Austria, November 23\u201325, pp. 65\u201375"},{"issue":"2","key":"10.1016\/S0747-7171(03)00025-7_B4","first-page":"124","article-title":"A practical extension mechanism for decision procedures: the case study of universal Presburger arithmetic","volume":"7","author":"Armando","year":"2001","journal-title":"Journal of Universal Computer Science (Special Issue: Formal Methods and Tools)"},{"key":"10.1016\/S0747-7171(03)00025-7_B5","unstructured":"Baumgartner, P., Furbach, U., Petermann, U., 1992. A Unified Approach to Theory Reasoning. Technical Report, Inst. f\u00fcr Informatik (Koblenz)"},{"key":"10.1016\/S0747-7171(03)00025-7_B6","unstructured":"Bj\u00f8rner, N.S., 1998. Integrating Decision Procedures for Temporal Verification. Ph.D. Thesis, Computer Science Department, Stanford University"},{"key":"10.1016\/S0747-7171(03)00025-7_B7","series-title":"Proc. of the 14th International Conference on Automated Deduction","first-page":"101","article-title":"A practical integration of first-order reasoning and decision procedures","volume":"vol. 1249","author":"Bj\u00f8rner","year":"1997"},{"key":"10.1016\/S0747-7171(03)00025-7_B8","first-page":"83","article-title":"Integrating decision procedures into Heuristic theorem provers: a case study of linear arithmetic","volume":"11","author":"Boyer","year":"1988","journal-title":"Machine Intelligence"},{"key":"10.1016\/S0747-7171(03)00025-7_B9","unstructured":"Coglio, A., Giunchiglia, F., Pecchiari, P., Talcott, C.L., 1997. A Logic Level Specification of the NQTHM Simplification Process. Technical Report, IRST"},{"key":"10.1016\/S0747-7171(03)00025-7_B10","series-title":"Proceedings of the 13th International Conference on Automated Deduction","first-page":"463","article-title":"On Shostak\u2019s decision procedure for combinations of theories","volume":"vol. 1104","author":"Cyrluk","year":"1996"},{"key":"10.1016\/S0747-7171(03)00025-7_B11","series-title":"Handbook of Theoretical Computer Science","first-page":"243","article-title":"Rewriting systems","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S0747-7171(03)00025-7_B12","unstructured":"Detlefs, D., Nelson, G., Saxe, J., 1996. Simplify: the ESC Prover. COMPAQ. Available from:\u00a0http:\/\/www.research.digital.com\/SRC\/esc\/Esc.html"},{"key":"10.1016\/S0747-7171(03)00025-7_B13","unstructured":"Giunchiglia, F., Pecchiari, P., Talcott, C.L., 1994. Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems. Technical Report TR-9409-15, IRST"},{"key":"10.1016\/S0747-7171(03)00025-7_B14","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Lassez, J.-L., 1987. Constraint logic programming. In: Proceedings 14th ACM Symposium on Principles of Programming Languages, pp. 111\u2013119","DOI":"10.1145\/41625.41635"},{"key":"10.1016\/S0747-7171(03)00025-7_B15","series-title":"CADE-16, Proceedings of the 16th International Conference on Automated Deduction","first-page":"127","article-title":"A framework for the flexible integration of a class of decision procedures into theorem provers","volume":"vol. 1632","author":"Jani\u010di\u0107","year":"1999"},{"key":"10.1016\/S0747-7171(03)00025-7_B16","doi-asserted-by":"crossref","unstructured":"Kapur, D., Musser, D.R., Nie, X., 1994. An overview of the tecton proof system. In: Theoretical Computer Science, vol. 133","DOI":"10.1016\/0304-3975(94)90192-9"},{"key":"10.1016\/S0747-7171(03)00025-7_B17","unstructured":"Kapur, D., Nie, X., 1994. Reasoning about Numbers in Tecton. Technical Report, Department of Computer Science, State University of New York, Albany, NY 12222"},{"issue":"4","key":"10.1016\/S0747-7171(03)00025-7_B18","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/32.588534","article-title":"Industrial strength theorem prover for a logic based on Common Lisp","volume":"23","author":"Kaufmann","year":"1997","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0747-7171(03)00025-7_B19","first-page":"1","article-title":"Term rewriting systems","volume":"vol. 2","author":"Klop","year":"1992"},{"key":"10.1016\/S0747-7171(03)00025-7_B20","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF00245296","article-title":"On Fourier\u2019s algorithm\u2019s for linear arithmetic constraints","volume":"9","author":"Lassez","year":"1992","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S0747-7171(03)00025-7_B21","doi-asserted-by":"crossref","unstructured":"Manna, Z., 1994. STeP: The Stanford Temporal Prover. Technical Report CS-TR-94-1518, Stanford University","DOI":"10.21236\/ADA324036"},{"key":"10.1016\/S0747-7171(03)00025-7_B22","doi-asserted-by":"crossref","unstructured":"Monfroy, E., Ringeissen, C., 1998. SoleX: a domain-independent scheme for constraint solver extension. In: AISC\u201998, 4th International Conference on Artificial Intelligence and Symbolic Computation, Plattsburgh, New York, September. pp. 222\u2013233","DOI":"10.1007\/BFb0055915"},{"key":"10.1016\/S0747-7171(03)00025-7_B23","unstructured":"Nelson, G., Oppen, D.C., 1978. Simplification by Cooperating Decision Procedures. Technical Report STAN-CS-78-652, Stanford Computer Science Department"},{"issue":"2","key":"10.1016\/S0747-7171(03)00025-7_B24","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1145\/322186.322198","article-title":"Fast decision procedures based on congruence closure","volume":"27","author":"Nelson","year":"1980","journal-title":"Journal of the ACM"},{"issue":"1","key":"10.1016\/S0747-7171(03)00025-7_B25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2422.322411","article-title":"Deciding combination of theories","volume":"31","author":"Shostak","year":"1984","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0747-7171(03)00025-7_B26","unstructured":"Steinbach, J., 1994. Termination of Rewriting. Ph.D. Thesis, Universitaat Kaiserslautern"},{"issue":"1\/2","key":"10.1016\/S0747-7171(03)00025-7_B27","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/FI-1995-24125","article-title":"Contextual rewriting in automated reasoning","volume":"24","author":"Zhang","year":"1995","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S0747-7171(03)00025-7_B28","series-title":"Proceedings of the 1st International Conference on Rewriting Techniques and Applications","first-page":"46","article-title":"Contextual rewriting","volume":"vol. 202","author":"Zhang","year":"1985"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717103000257?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717103000257?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T09:56:23Z","timestamp":1584611783000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717103000257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0747717103000257"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(03)00025-7","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}