4617 search results - page 696 / 924 » Automation of Diagrammatic Reasoning |
187
click to vote
LOPSTR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We introduce a just-in-time specializer for Prolog. Just-intime specialization attempts to unify of the concepts and benefits of partial evaluation (PE) and just-in-time...
211
click to vote
LOPSTR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
229
click to vote
LOPSTR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper we focus on the problem of testing agent programs written in BUpL, an executable, high-level modelling agent language. Our approach consists of two main ste...
202
click to vote
LOPSTR
2009
Springer
16 years 1 months ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
165
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...