26 search results - page 3 / 6 » rta 2010 |
RTA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...
BMCBI
2010
13 years 5 months ago
2010
Background: The binding of peptide fragments of extracellular peptides to class II MHC is a crucial event in the adaptive immune response. Each MHC allotype generally binds a dist...
RTA
2010
Springer
13 years 9 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
RTA
2010
Springer
13 years 9 months ago
2010
Springer
Decreasing diagrams technique (van Oostrom, 1994) is a technique that can be widely applied to prove confluence of rewrite systems. To directly apply the decreasing diagrams techn...
RTA
2010
Springer
13 years 3 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and...