139 search results - page 14 / 28 » Automated Termination Proofs for Logic Programs by Term Rewr... |
LOPSTR
2004
Springer
14 years 23 days ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
CL
2000
Springer
13 years 11 months ago
2000
Springer
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
PODS
1991
ACM
13 years 11 months ago
1991
ACM
d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...
ICLP
1995
Springer
13 years 11 months ago
1995
Springer
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...