29 search results - page 4 / 6 » Proving Termination for Logic Programs by the Query-Mapping ... |
POPL
2008
ACM
14 years 7 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
TPHOL
2003
IEEE
14 years 24 days ago
2003
IEEE
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
ICLP
1999
Springer
13 years 11 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
SAS
2004
Springer
14 years 26 days ago
2004
Springer
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...