882 search results - page 98 / 177 » A Taste of Rewrite Systems |
86
Voted
ENTCS
2007
15 years 17 days ago
2007
Programs in modern functional logic languages are rewrite systems following the constructor discipline but where confluence and termination are not required, thus defining possi...
84
Voted
TPLP
2010
14 years 11 months ago
2010
Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers,...
114
Voted
BIRTHDAY
2010
Springer
14 years 10 months ago
2010
Springer
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
108
Voted
LPAR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We present a novel way for reasoning about (possibly ir)rational quantifier-free non-linear arithmetic by a reduction to SAT/SMT. The approach is incomplete and dedicated...
134
click to vote
SIGIR
2009
ACM
15 years 7 months ago
2009
ACM
Recommender Systems, based on collaborative filtering (CF), aim to accurately predict user tastes, by minimising the mean error achieved on hidden test sets of user ratings, afte...