11160 search results - page 56 / 2232 » Incompleteness in a General Setting |
CIA
2007
Springer
14 years 4 months ago
2007
Springer
In this paper, we propose a probabilistic framework targeting three important issues in the computation of quality and trust in decentralized systems. Specifically, our approach a...
CP
2003
Springer
14 years 3 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
KCAP
2009
ACM
14 years 2 months ago
2009
ACM
PowerAqua1 is a Question Answering system, which takes as input a natural language query and is able to return answers drawn from relevant semantic resources found anywhere on the...
TACAS
2000
Springer
14 years 1 months ago
2000
Springer
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
AAAI
2000
13 years 11 months ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...