1818 search results - page 202 / 364 » Granularity-Adaptive Proof Presentation |
131
Voted
WOLLIC
2010
Springer
15 years 8 months ago
2010
Springer
The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting were shown in [5] to be in NExpTime. This paper presents ...
135
Voted
ECAI
2004
Springer
15 years 9 months ago
2004
Springer
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
141
Voted
IJAC
2011
14 years 7 months ago
2011
We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good ca...
118
Voted
ICDCS
2003
IEEE
15 years 9 months ago
2003
IEEE
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...
120
Voted
EUROCRYPT
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...