12774 search results - page 133 / 2555 » A Framework for Proof Systems |
145
click to vote
CSL
2010
Springer
15 years 5 months ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
118
click to vote
SCN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We introduce and define the notion of identity-based zeroknowledge, concentrating on the non-interactive setting. In this setting, our notion allows any prover to widely...
138
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
140
click to vote
FUIN
2006
15 years 4 months ago
2006
Traditional Machine Learning approaches based on single inference mechanisms have reached their limits. This causes the need for a framework that integrates approaches based on aba...
115
click to vote
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present a natural confluence of higher-order hereditary Harrop formulas (HH formulas), Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programmi...