37 search results - page 4 / 8 » A New Meta-complexity Theorem for Bottom-Up Logic Programs |
AMAI
2000
Springer
13 years 5 months ago
2000
Springer
This is a prospective on the research in the intersection of mathematics and artificial intelligence that I see as having been the most important over the past 10 years and that I...
ICFP
2009
ACM
14 years 6 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
TPHOL
2005
IEEE
13 years 11 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
ICLP
1997
Springer
13 years 10 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
POPL
2010
ACM
14 years 3 months ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...