3446 search results - page 238 / 690 » A Reasoning Algorithm for pD* |
134
click to vote
ICLP
1999
Springer
15 years 9 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
146
click to vote
ICLP
1993
Springer
15 years 9 months ago
1993
Springer
A basic requirement of declarative programming is to free the programmer from the need to manually insert control annotations into the program. Here we study the execution of logi...
138
click to vote
PLILP
1993
Springer
15 years 9 months ago
1993
Springer
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
132
click to vote
ESA
2008
Springer
15 years 7 months ago
2008
Springer
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...
175
click to vote
EWCBR
2008
Springer
15 years 7 months ago
2008
Springer
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...