Constraint contextual rewriting

Journal of Symbolic Computation

Volumn 36, Issue 1-2, 2003, Pages 193-216

  Armando, Alessandro ^a   Ranise, Silvio ^b  

^a UNIVERSITY OF GENOA   (Italy)

^b LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 14744268584     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(03)00025-7     Document Type: Article

References (28)

1. Armando, A., Ballarin, C., 2001. Maple's evaluation process as constraint contextual rewriting. In: Mourrain, B. (Ed.), ISSAC-01, Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, New York, July 22-25, 2001. ACM Press, pp. 32-37.
2. Armando, A., Compagna, L., Ranise, S., 2001. RDL - rewrite and decision procedure laboratory. In: IJCAR 2001, Proceedings of the International Joint Conference on Automated Reasoning, Siena, Italy, June, 2001.
3. Armando, A., Ranise, S., 1998. Constraint contextual rewriting. In: Caferra, R., Salzer, G. (Eds.), FTP' 98, Proceedings of the 2nd International Workshop on First Order Theorem Proving, Vienna, Austria, November 23-25, pp. 65-75.
4. Armando, A., Ranise, S., 2001. A practical extension mechanism for decision procedures: the case study of universal Presburger arithmetic. Journal of Universal Computer Science (Special Issue: Formal Methods and Tools) 7 (2), 124-140.
5. Baumgartner, P., Furbach, U., Petermann, U., 1992. A Unified Approach to Theory Reasoning. Technical Report, Inst. für Informatik (Koblenz).
6. Bjørner, N.S., 1998. Integrating Decision Procedures for Temporal Verification. Ph.D. Thesis, Computer Science Department, Stanford University.
7. Bjørner, N.S., Stickel, M.E., Uribe, T.E., 1997. A practical integration of first-order reasoning and decision procedures. In: McCune, W. (Ed.), Proceedings of the 14th International Conference on Automated Deduction, Townsville, Australia, July 13-17, 1997, Lecture Notes Artificial Intelligence, vol. 1249. Springer-Verlag, pp. 101-115.
8. Boyer, R.S., Moore, J.S., 1988. Integrating decision procedures into Heuristic theorem provers: a case study of linear arithmetic. Machine Intelligence 11, 83-124.
9. Coglio, A., Giunchiglia, F., Pecchiari, P., Talcott, C.L., 1997. A Logic Level Specification of the NQTHM Simplification Process. Technical Report, IRST.
10. Cyrluk, D., Lincoln, P., Shankar, N., 1996. On Shostak's decision procedure for combinations of theories. In: McRobbie, M.A., Slaney, J.K. (Eds.), Proceedings of the 13th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, vol. 1104. Springer-Verlag, pp. 463-477.
11. Dershowitz, N., Jouannaud, J.P., 1990. Rewriting systems. In: Handbook of Theoretical Computer Science. Elsevier Publishers, Amsterdam, pp. 243-320.
12. Detlefs, D., Nelson, G., Saxe, J., 1996. Simplify: the ESC Prover. COMPAQ. Available from: http://www.research.digital.com/SRC/esc/Esc.html.
13. Giunchiglia, F., Pecchiari, P., Talcott, C.L., 1994. Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems. Technical Report TR-9409-15, IRST.
14. Jaffar, J., Lassez, J.-L., 1987. Constraint logic programming. In: Proceedings 14th ACM Symposium on Principles of Programming Languages, pp. 111-119.
15. Janičié, P., Bundy, A., Green, I., 1999. A framework for the flexible integration of a class of decision procedures into theorem provers. In: Ganzinger, H. (Ed.), CADE-16, Proceedings of the 16th International Conference on Automated Deduction, Trento, July 7-10, 1999. Lecture Notes in Artificial Intelligence, vol. 1632. Springer-Verlag, pp. 127-141.
16. Kapur, D., Musser, D.R., Nie, X., 1994. An overview of the tecton proof system. In: Theoretical Computer Science, vol. 133.
17. Kapur, D., Nie, X., 1994. Reasoning about Numbers in Tecton. Technical Report, Department of Computer Science, State University of New York, Albany, NY 12222.
18. Kaufmann, M., Moore, J.S., 1997. Industrial strength theorem prover for a logic based on Common Lisp. IEEE Transactions on Software Engineering 23 (4), 203-213.
19. Klop, J.W., 1992. Term rewriting systems. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (Eds.), Handbook of Logic in Computer Science, vol. 2. Oxford University Press, Oxford, pp. 1-117 (Chapter 1).
20. Lassez, J.-L., Maher, M.J., 1992. On Fourier's algorithm's for linear arithmetic constraints. Journal of Automated Reasoning 9, 373-379.
21. Manna, Z. et al., 1994. STEP: The Stanford Temporal Prover. Technical Report CS-TR-94-1518, Stanford University.
22. Monfroy, E., Ringeissen, C., 1998. SoleX: a domain-independent scheme for constraint solver extension. In: AISC'98, 4th International Conference on Artificial Intelligence and Symbolic Computation, Plattsburgh, New York, September. pp. 222-233.
23. Nelson, G., Oppen, D.C., 1978. Simplification by Cooperating Decision Procedures. Technical Report STAN-CS-78-652, Stanford Computer Science Department.
24. Nelson, G., Oppen, D.C., 1980. Fast decision procedures based on congruence closure. Journal of the ACM 27 (2), 356-364.
25. Shostak, R.E., 1984. Deciding combination of theories. Journal of the ACM 31 (1), 1-12.
26. Steinbach, J., 1994. Termination of Rewriting. Ph.D. Thesis, Universitaat Kaiserslautern.
27. Zhang, H., 1995. Contextual rewriting in automated reasoning. Fundamenta Informaticae 24 (1/2), 107-123.
28. Zhang, H., Remy, J.L., 1985. Contextual rewriting. In: Jouannaud, J.-P. (Ed.), Proceedings of the 1st International Conference on Rewriting Techniques and Applications, Dijon, France, May 1985, LNCS, vol. 202. Springer, pp. 46-62.