Computationally equivalent elimination of conditions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4098 LNCS, Issue , 2006, Pages 19-34

  Serbanuta, Traian Florin ^a   Roşu, Grigore ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONCURRENT ENGINEERING; KNOWLEDGE BASED SYSTEMS; SEARCH ENGINES;

PARALLELIZATION; REWRITE ENGINES; TERM REWRITE SYSTEMS;

ARTIFICIAL INTELLIGENCE;

EID: 33749402923     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11805618_3     Document Type: Conference Paper

References (22)

1. H. Aida, J. A. Goguen, and J. Meseguer. Compiling concurrent rewriting onto the rewrite rule machine. In CTRS'90, volume 516 of LNCS, pages 320-332, 1990.
2. S. Antoy, B. Brassel, and M. Hanus. Conditional narrowing without conditions. In PPDP'03, pages 20-31. ACM Press, 2003.
3. J. A. Bergstra and J. W. Klop. Conditional rewrite rules: Confluence and termination. J. of Computer and System Sciences, 32(3):323-362, 1986.
4. P. Borovansky, H. Cirstea, H. Dubois, C. Kirchner, H. Kirchner, P. Moreau, C. Ringeissen, and M. Vittek. ELAN: User Manual, 2000. Loria, Nancy, France.
5. B. Brassel. Bedingte narrowing-verfahren mit verzögerter auswertung. Master's thesis, RWTH Aachen, 1999. In German.
6. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and C. Talcott. Maude 2.0 Manual, 2003. http://maude.cs.uiuc.edu/ manual.
7. N. Dershowitz and D. A. Plaisted. Equational programming. In J. E. Hayes, D. Michie, and J. Richards, editors, Machine Intelligence 11, pages 21-56. 1988.
8. R. Diaconescu and K. Futatsugi. CafeOBJ Report. World Scientific, 1998. AMAST Series in Computing, volume 6.
9. E. Giovannetti and C. Moiso. Notes on the elimination of conditions. In CTRS'87, volume 308 of LNCS, pages 91-97. Springer, 1987.
10. J. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J.-P. Jouannaud. Introducing OBJ. In Software Engineering with OBJ, pages 3-167. Kluwer, 2000.
11. M. Hanus. The integration of functions into logic programming: From theory to practice. The Journal of Logic Programming, 19 & 20:583-628, 1994.
12. C. Hintermeier. How to transform canonical decreasing CTRSs into equivalent canonical TRSs. In CTRS'94, volume 968 of LNCS, pages 186-205, 1994.
13. S. Lucas, C. Marché, and J. Meseguer. Operational termination of conditional term rewriting systems. Inf. Proc. Letters, 95(4):446-453, August 2005.
14. M. Marchiori. Unravelings and ultra-properties. In ALP'96, volume 1139 of LNCS, pages 107-121. Springer, 1996.
15. M. Marchiori. On deterministic conditional rewriting. Computation Structures Group, Memo 405, MIT Laboratory for Computer Science, 1997.
16. N. Nishida, M. Sakai, and T. Sakabe. On simulation-completeness of unraveling for conditional term rewriting systems. In LA Symposium 2004 Summer, volume 2004-7 of LA Symposium, pages 1-6, 2004.
17. E. Ohlebusch. Transforming conditional rewrite systems with extra variables into unconditional systems. In LPAR'99, volume 1705 of LNCS, pages 111-130, 1999.
18. E. Ohlebusch. Advanced Topics in Term Rewriting. Springer, 2002.
19. G. Roşu. From conditional to unconditional rewriting. In WADT'04, volume 3423 of LNCS, pages 218-233. Springer, 2004.
20. T. F. Şerbǎnuţǎ and G. Roşu. Computationally equivalent elimination of conditions. Technical Report UIUCDCS-R-2006-2693, UIUC, February 2006.
21. M. van den Brand, J. Heering, P. Klint, and P. A. Olivier. Compiling language definitions: the ASF+SDF compiler. ACM TOPLAS, 24(4):334-368, 2002.
22. P. Viry. Elimination of conditions. J. of Symb. Comp., 28:381-401, Sept. 1999.