6978 search results - page 211 / 1396 » On Proofs in System P |
183
click to vote
LICS
1999
IEEE
15 years 11 months ago
1999
IEEE
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
205
click to vote
COMMA
2010
15 years 1 months ago
2010
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
149
click to vote
FOCS
2007
IEEE
16 years 27 days ago
2007
IEEE
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
190
click to vote
SIAMCO
2008
15 years 6 months ago
2008
The moment problem matured from its various special forms in the late 19th and early 20th Centuries to a general class of problems that continues to exert profound influence on the...
144
click to vote
LICS
2005
IEEE
16 years 4 days ago
2005
IEEE
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...