2490 search results - page 47 / 498 » Complexity of Contextual Reasoning |
124
Voted
DALT
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. This paper proposes a formal framework for agent communication where agents can reason about their goals using strategic reasoning. This reasoning is argumentation-based ...
110
Voted
AAAI
1996
15 years 4 months ago
1996
An important problem faced by auditors is gauging how much reliance can be placed on the accounting systems that process millions of transactions to produce the numbers summarized...
136
click to vote
KGC
1997
Springer
15 years 7 months ago
1997
Springer
Rice’s Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting p...
147
Voted
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
81
Voted
CSL
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We give a recursion-theoretic characterization of the complexity classes NCk