4192 search results - page 380 / 839 » Probabilistic Logic Programming |
172
click to vote
ESOP
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...
189
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
167
Voted
CSL
2008
Springer
15 years 8 months ago
2008
Springer
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
184
click to vote
LOGCOM
2010
15 years 27 days ago
2010
When monitoring a system wrt. a property defined in a temporal logic such as LTL, a major concern is to settle with an adequate interpretation of observable system events; that is,...
169
Voted
CCE
2004
15 years 6 months ago
2004
The Resource-Constrained Project Scheduling Problem(RCPSP) is a significant challenge in highly regulated industries, such as pharmaceuticals and agrochemicals, where a large numb...