3311 search results - page 227 / 663 » Deductive Object Programming |
78
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Supinterpretations have shown their interest to deal with...
137
Voted
CCE
2010
14 years 11 months ago
2010
In this work we address the problem of solving multiscenario optimization models that are deterministic equivalents of two-stage stochastic programs. We present a heuristic approx...
117
click to vote
PEPM
1993
ACM
15 years 6 months ago
1993
ACM
In this tutorial the specialisation of declarative logic programs is presented. The main correctness results are given, and the outline of a basic algorithm for partial evaluation...
131
click to vote
AAAI
2008
15 years 4 months ago
2008
In this article we work on certain aspects of the belief change theory in order to make them suitable for argumentation systems. This approach is based on Defeasible Logic Program...
100
click to vote
AAAI
2008
15 years 4 months ago
2008
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...