Deduction, Strategies, and Rewriting

Electronic Notes in Theoretical Computer Science

Volumn 174, Issue 11 SPEC. ISS., 2007, Pages 3-25

  Eker, Steven ^a   Martí Oliet, Narciso ^b   Meseguer, José ^c   Verdejo, Alberto ^b  

^a SRI INTERNATIONAL   (United States)

^b UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

congruence closure; Maude; Rewriting logic; rewriting strategies

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; INFERENCE ENGINES; SEMANTICS; SET THEORY;

CONGRUENCE CLOSURE; REWRITING LOGIC; REWRITING STRATEGIES;

DATA REDUCTION;

EID: 34250746522     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.03.017     Document Type: Article

References (27)

1. Bachmair L., and Dershowitz N. Completion for rewriting modulo a congruence. Theor. Comput. Sci. 67 2&3 (1989) 173-201
2. Bachmair L., Tiwari A., and Vigneron L. Abstract congruence closure. Journal of Automated Reasoning 31 2 (2003) 129-168
3. Basin D., Clavel M., and Meseguer J. Reflective metalogical frameworks. ACM Transactions on Computational Logic 5 3 (2004) 528-576
4. Borovanský P., Kirchner C., Kirchner H., and Ringeissen C. Rewriting with strategies in ELAN: A functional semantics. International Journal of Foundations of Computer Science 12 (2001) 69-95
5. Clavel M. Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications (2000), CSLI Publications, Stanford University
6. Clavel M., Durán F., Eker S., Lincoln P., Martí-Oliet N., Meseguer J., and Quesada J. Maude: specification and programming in rewriting logic. Theoretical Computer Science 285 2 (2002) 187-243
7. Clavel M., Durán F., Eker S., Lincoln P., Martí-Oliet N., Meseguer J., and Talcott C. Maude Manual (Version 2.2) (December 2005). http://maude.cs.uiuc.edu/maude2-manual
8. Clavel M., Durán F., Eker S., and Meseguer J. Building equational proving tools by reflection in rewriting logic. CAFE: An Industrial-Strength Algebraic Formal Method (2000), Elsevier. http://maude.cs.uiuc.edu
9. Clavel M., and Meseguer J. Internal strategies in a reflective logic. Proceedings of the CADE-14 Workshop on Strategies in Automated Deduction. (Townsville, Australia, July 1997) (1997) 1-12
10. Clavel M., and Meseguer J. Reflection in conditional rewriting logic. Theoretical Computer Science 285 2 (2002) 245-288
11. M. Clavel, M. Palomino, and A. Riesco. Introducing the ITP tool: a tutorial. Journal of Universal Computer Science, 2006. To appear
12. Conchon S., and Krstic S. Strategies for combining decision procedures. Proceedings of the 9th Tools and Algorithms for the Construction and Analysis of Systems. (TACAS'03). Lecture Notes for Computer Science volume 2619 (2003), Springer 537-553
13. Downey P.J., Sethi R., and Tarjan R.E. Variations on the common subexpressions problem. Journal of the ACM 27 4 (1980) 758-771
14. M. Hidalgo-Herrero, A. Verdejo, and Y. Ortega-Mallén. Using Maude and its strategies for defining a framework for analyzing Eden semantics. In S. Antoy, editor, The Sixth International Workshop on Reduction Strategies in Rewriting and Programming, WRS'06, Electronic Notes in Theoretical Computer Science. Elsevier. To appear
15. Jouannaud J.-P., and Kirchner C. Solving equations in abstract algebras: A rule-based survey of unification. Computational Logic - Essays in Honor of Alan Robinson (1991), MIT Press 257-321
16. Kapur D. Shostak's congruence closure as completion. In: Comon H. (Ed). 8th International Conference on Rewriting Techniques and Applications. RTA'97. Lecture Notes for Computer Science volume 1232 (1997), Springer 23-37
17. Lescanne P. Completion procedures as transition rules + control. In: Díaz J., and Orejas F. (Eds). TAPSOFT'89 Proceedings of the International Joint Conference on Theory and Practice of Software Development. Barcelona, Spain, March 13-17, 1989. Lecture Notes in Computer Science volume 351 (1989), Springer 28-41
18. Martelli A., and Montanari U. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems 4 2 (1982) 258-282
19. Martí-Oliet N., and Meseguer J. Rewriting logic as a logical and semantic framework. In: Gabbay D.M., and Guenthner F. (Eds). Handbook of Philosophical Logic, Volume 9. Second Edition (2002), Kluwer Academic Publishers 1-87 First published as SRI Technical Report SRI-CSL-93-05, August 1993
20. Martí-Oliet N., Meseguer J., and Verdejo A. Towards a strategy language for Maude. In: Martí-Oliet N. (Ed). Proceedings Fifth International Workshop on Rewriting Logic and its Applications. WRLA 2004, Barcelona, Spain, March 27 - April 4, 2004. Electronic Notes in Theoretical Computer Science volume 117 (2005), Elsevier 417-441
21. Meseguer J. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96 1 (1992) 73-155
22. Nieuwenhuis R., Oliveras A., and Tinelli C. Abstract DPLL and abstract DPLL modulo theories. In: Baader F., and Voronkov A. (Eds). Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence and Reasoning. (LPAR'04), Montevideo, Uruguay. Lecture Notes in Computer Science volume 3452 (2005), Springer 36-50
23. Rosa-Velardo F., Segura C., and Verdejo A. Typed mobile ambients in Maude. In: Cirstea H., and Martí-Oliet N. (Eds). Proceedings of the 6th International Workshop on Rule-Based Programming. (RULE 2005). Electronic Notes in Theoretical Computer Science volume 147 (2006), Elsevier 135-161
24. Shostak R.E. An algorithm for reasoning about equality. Communications of the ACM 21 7 (July 1978) 583-585
25. A. Tiwari. Decision Procedures in Automated Deduction. PhD thesis, State University of New York, 2000
26. A. Verdejo and N. Martí-Oliet. Basic completion by means of Maude strategies. Paper in preparation, 2006
27. Visser E. Program transformation with Stratego/XT: Rules, strategies, tools, and systems in StrategoXT-0.9. In: Lengauer C. (Ed). Domain-Specific Program Generation. Lecture Notes for Computer Science volume 3016 (2004), Springer 216-238