1971 search results - page 265 / 395 » Tabu search - Uncharted domains |
199
click to vote
IJCAI
1997
15 years 7 months ago
1997
We present a design for an automated theorem prover that controls its search based on ideas from several areas of artificial intelligence (AI). The combination of case-based reaso...
195
click to vote
PUK
2000
15 years 7 months ago
2000
The generation of the set of all ground actions for a given set of ADL operators, which are allowed to have conditional effects and preconditions that can be represented using arbi...
182
click to vote
IJCAI
1989
15 years 7 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
125
click to vote
SLP
1989
15 years 7 months ago
1989
This paper describes a learning system, LASSY1, which explores domains represented by Prolog databases, and use its acquired knowledge to increase the efficiency of a Prolog inter...
166
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
It has been shown recently that deterministic conformant planning problems can be translated into classical problems that can be solved by off-the-shelf classical planners. In this...