77 search results - page 2 / 16 » Presenting a Category Modulo a Rewriting System |
147
Voted
RTA
1991
Springer
15 years 4 months ago
1991
Springer
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
98
Voted
CADE
2003
Springer
16 years 1 months ago
2003
Springer
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
111
Voted
CADE
2006
Springer
16 years 1 months ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
113
Voted
PPDP
2004
Springer
15 years 6 months ago
2004
Springer
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
106
Voted
CONCUR
2003
Springer
15 years 6 months ago
2003
Springer
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...