1128 search results - page 19 / 226 » Classical Natural Deduction |
89
Voted
ALGORITHMICA
2002
14 years 9 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
JSC
2011
14 years 4 months ago
2011
Let Ω ≤ GLd(q) be a quasisimple classical group in its natural representation and let ∆ = NGLd(q)(Ω). We construct the projection from ∆ to ∆/Ω and provide fast, poly...
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
This paper proposes a Compiled Labelled Deductive System, called ACCLDS, for reasoning about role-based access control in distributed systems, which builds upon Massacci’s tablea...
ENTCS
2007
14 years 9 months ago
2007
Automated deduction methods should be specified not procedurally, but declaratively, as inference systems which are proved correct regardless of implementation details. Then, di...
APAL
2010
14 years 9 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...