29 search results - page 2 / 6 » Complexity Analysis of Term Rewriting Based on Matrix and Co... |
LOPSTR
2007
Springer
14 years 1 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
ICLP
2005
Springer
14 years 25 days ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
GIS
2008
ACM
13 years 8 months ago
2008
ACM
One of the formalisms to qualitatively describe polylines in the plane are double-cross matrices. In a double-cross matrix the relative position of any two line segments in a poly...
BIRTHDAY
2005
Springer
14 years 27 days ago
2005
Springer
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
CIVR
2007
Springer
14 years 1 months ago
2007
Springer
This paper deals with a new interest points detector. Unlike most standard detectors which concentrate on the local shape of the signal, the main objective of this new operator is...