Sciweavers

1302 search results - page 5 / 261
» Deductive Plan Generation
Sort
View
JMLR
2010
149views more  JMLR 2010»
13 years 2 months ago
Coherent Inference on Optimal Play in Game Trees
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
Philipp Hennig, David H. Stern, Thore Graepel
ACL
1989
13 years 8 months ago
A Semantic-Head-Driven Generation Algorithm for Unification-Based Formalisms
We present an algorithm for generating strings from logical form encodings that improves upon previous algorithms in that it places fewer restrictions on the class of grammars to ...
Stuart M. Shieber, Gertjan van Noord, Robert C. Mo...
VLDB
1990
ACM
86views Database» more  VLDB 1990»
13 years 11 months ago
How to Forget the Past Without Repeating It
Bottom-up evaluation of deductive database programs has the advantage that it avoids repeated computation by storing all intermediate results and replacing recomputation by table ...
Jeffrey F. Naughton, Raghu Ramakrishnan
IKE
2004
13 years 8 months ago
Analogy and Deduction for Knowledge Discovery
Analogy-based hypothesis generation is a promising technique for knowledge discovery. However, some hypotheses generated are nonsensical. This paper describes a two-phased method ...
Jim Reynolds, Adam Pease, John Li
CCIA
2008
Springer
13 years 9 months ago
On Partial Deduction and Conversational Agents
Agents are situated autonomous entities that perceive and act in their environment, and communicate with other agents. An agent usually starts a conversation by querying another a...
M. Mariela Morveli-Espinoza, Josep Puyol-Gruart