899 search results - page 34 / 180 » A CTL-Based Logic for Program Abstractions |
160
click to vote
ICFP
2012
ACM
13 years 4 months ago
2012
ACM
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
113
click to vote
ICLP
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We study termination of logic programs with dynamic scheduling, as it can be realised using delay declarations. Following previous work, our minimum assumption is that de...
109
click to vote
LOPSTR
2004
Springer
15 years 7 months ago
2004
Springer
Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been i...
114
click to vote
MLG
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. There are many connections between graph mining and inductive logic programming (ILP), or more generally relational learning. Up till now these connections have mostly be...
124
click to vote
JELIA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abduc...