Sciweavers

2715 search results - page 1 / 543
» An Implementation of Narrowing Strategies
Sort
View
WADT
1998
Springer
13 years 11 months ago
Complete Strategies for Term Graph Narrowing
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...
Annegret Habel, Detlef Plump
PPDP
2001
Springer
13 years 12 months ago
An Implementation of Narrowing Strategies
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in pa...
Sergio Antoy, Michael Hanus, Bart Massey, Frank St...
FLOPS
2004
Springer
13 years 11 months ago
Implementing Natural Rewriting and Narrowing Efficiently
Abstract. Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel exte...
Santiago Escobar
ICRA
2003
IEEE
127views Robotics» more  ICRA 2003»
14 years 23 days ago
The bridge test for sampling narrow passages with probabilistic roadmap planners
Probabilistic roadmap (PRM) planners have been successful in path planning of robots with many degrees of freedom, but narrow passages in a robot’s configuration space create s...
David Hsu, Tingting Jiang, John H. Reif, Zheng Sun
PPDP
2001
Springer
13 years 12 months ago
Constructor-Based Conditional Narrowing
We define a transformation from a left-linear constructor-based conditional rewrite system into an overlapping inductively sequential rewrite system. This transformation is sound...
Sergio Antoy