1445 search results - page 5 / 289 » Abstract Interpretation of Logic Programs |
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a natural confluence of higher-order hereditary Harrop formulas (HH formulas), Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programmi...
CAV
2006
Springer
15 years 1 months ago
2006
Springer
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
100
Voted
PPCP
1993
15 years 1 months ago
1993
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
105
Voted
DLOG
2009
14 years 7 months ago
2009
Abstract. The paper describes how interpretations of multimedia documents can be formally derived using abduction over domain knowledge represented in an ontology. The approach use...
LOPSTR
2004
Springer
15 years 3 months 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...