1385 search results - page 59 / 277 » Natural Rewriting for General Term Rewriting Systems |
158
click to vote
JGO
2010
15 years 27 days ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
174
click to vote
JLP
2010
15 years 27 days ago
2010
K is an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of configurations, comput...
133
click to vote
JUCS
2002
15 years 5 months ago
2002
: We consider a uniform way of treating objects and rules in P systems: we start with multisets of rules, which are consumed when they are applied, but the application of a rule ma...
133
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
We revisit (un)soundness of transformations of conditional into unconditional rewrite systems. The focus here is on so-called unravelings, the most simple and natural kind of such ...
189
click to vote
FLOPS
2008
Springer
15 years 7 months ago
2008
Springer
Narrowing extends rewriting with logic capabilities by allowing free variables in terms and replacing matching with unification. Narrowing has been widely used in different context...