Sciweavers

700 search results - page 29 / 140
» On Termination of Constraint Logic Programs
Sort
View
LOPSTR
2009
Springer
15 years 5 months ago
Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
José Iborra, Naoki Nishida, Germán V...
AADEBUG
2000
Springer
15 years 3 months ago
Slicing of Constraint Logic Programs
Gyöngyi Szilágyi, Tibor Gyimóth...