64 search results - page 12 / 13 » On the Proof Complexity of Deep Inference |
UAI
2003
13 years 10 months ago
2003
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
ENTCS
2007
13 years 8 months ago
2007
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
TABLEAUX
2005
Springer
14 years 2 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...
POPL
1999
ACM
14 years 26 days ago
1999
ACM
An increasing number of systems rely on programming language technology to ensure safety and security of low-level code. Unfortunately, these systems typically rely on a complex, ...