1410 search results - page 177 / 282 » Proving theorems by reuse |
TABLEAUX
1995
Springer
14 years 1 months ago
1995
Springer
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...
AAAI
2008
14 years 13 days ago
2008
Probabilistic logic programming is a powerful technique to represent and reason with imprecise probabilistic knowledge. A probabilistic logic program (PLP) is a knowledge base whi...
AMAST
2008
Springer
14 years 3 days ago
2008
Springer
Abstract. We present a static analysis technique for modeling and approximating the long-run resource usage of programs. The approach is based on a quantitative semantic framework ...
CANS
2008
Springer
14 years 3 days ago
2008
Springer
In a (r, n)-threshold secret sharing scheme, no group of (r - 1) colluding members can recover the secret value s. However, the number of colluders is likely to increase over time...
CCS
2008
ACM
14 years 3 days ago
2008
ACM
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...