432 search results - page 83 / 87 » Open Problems with Part-Whole Relations |
OOPSLA
2005
Springer
14 years 27 days ago
2005
Springer
Designing component-based application that meets performance requirements remains a challenging problem, and usually requires a prototype to be constructed to benchmark performanc...
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
ECAI
2004
Springer
13 years 11 months ago
2004
Springer
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
FC
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
CLIMA
2004
13 years 8 months ago
2004
The aim of this work is the design of a framework for the revision of knowledge in abductive reasoning agents, based on interaction. We address issues such as: how to exploit knowl...