Sciweavers

882 search results - page 7 / 177
» A Taste of Rewrite Systems
Sort
View
TCS
2002
13 years 7 months ago
ELAN from a rewriting logic point of view
ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or ...
Peter Borovanský, Claude Kirchner, Hé...
AMAST
2010
Springer
13 years 2 months ago
Proving Termination Properties with mu-term
mu-term is a tool which can be used to verify a number of termination properties of (variants of) Term Rewriting Systems (TRSs): termination of rewriting, termination of innermost ...
Beatriz Alarcón, Raúl Gutiérr...
WWW
2010
ACM
14 years 2 months ago
Statistical models of music-listening sessions in social media
User experience in social media involves rich interactions with the media content and other participants in the community. In order to support such communities, it is important to...
Elena Zheleva, John Guiver, Eduarda Mendes Rodrigu...
BIRTHDAY
2005
Springer
14 years 1 months ago
Primitive Rewriting
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Ano...
Nachum Dershowitz
RTA
2005
Springer
14 years 29 days ago
Proving Positive Almost-Sure Termination
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
Olivier Bournez, Florent Garnier