4370 search results - page 422 / 874 » Algebra of Logic Programming |
133
click to vote
ESOP
1998
Springer
15 years 7 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...
154
click to vote
RTA
2010
Springer
15 years 7 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 ...
123
Voted
CSL
2008
Springer
15 years 5 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...
142
Voted
LOGCOM
2010
14 years 10 months 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,...
112
Voted
KI
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Rule-based programming paradigm is omnipresent in number of engineering domains. However, there are some fundamental semantical differences between it, and classic progr...