2490 search results - page 109 / 498 » Complexity of Contextual Reasoning |
125
click to vote
TIME
2008
IEEE
15 years 10 months ago
2008
IEEE
We survey temporal description logics that are based on standard temporal logics such as LTL and CTL. In particular, we concentrate on the computational complexity of the satisfi...
133
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
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...
133
Voted
EUROCRYPT
1999
Springer
15 years 8 months ago
1999
Springer
We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable...
133
click to vote
CSL
2006
Springer
15 years 8 months ago
2006
Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
134
click to vote
DLOG
2007
15 years 6 months ago
2007
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...