213 search results - page 4 / 43 » Automated Termination Analysis for Logic Programs with Cut |
109
click to vote
PEPM
2010
ACM
14 years 11 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
PLILP
1993
Springer
15 years 1 months ago
1993
Springer
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...