5243 search results - page 241 / 1049 » Reasoning About Strategies |
154
Voted
ICCBR
2005
Springer
16 years 5 days ago
2005
Springer
Conversational Case Based Reasoning (CCBR) is a form of CBR where users initiate conversations with the system to solve a certain problem. Current CCBR solutions are limited to spe...
232
Voted
ALP
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
173
click to vote
IFIP
1997
Springer
15 years 10 months ago
1997
Springer
The factory of the future is going to have a high, but not full, degree of automation. There are three reasons for that. First, no great level of automation is compatible with req...
191
Voted
CCL
1994
Springer
15 years 10 months ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
206
click to vote
IJCAI
2003
15 years 8 months ago
2003
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often b...