154 search results - page 30 / 31 » Proof Complexity of Non-classical Logics |
CADE
2007
Springer
14 years 5 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
SIAMCOMP
2008
13 years 5 months ago
2008
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
TABLEAUX
2005
Springer
13 years 10 months ago
2005
Springer
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
ESAS
2004
Springer
13 years 10 months ago
2004
Springer
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...