3446 search results - page 331 / 690 » A Reasoning Algorithm for pD* |
133
Voted
TARK
1998
Springer
15 years 11 months ago
1998
Springer
We look at the Big Match game, a variation of the repeated Matching Pennies game where if the rst player plays tails the game ends with the rst player receiving the last round...
130
click to vote
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
164
click to vote
LICS
1996
IEEE
15 years 10 months ago
1996
IEEE
Ahybrid automatonis a formalmodelfor a mixeddiscrete-continuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically...
165
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
210
click to vote
LPKR
1997
Springer
15 years 10 months ago
1997
Springer
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...