3658 search results - page 291 / 732 » The logic of proofs, semantically |
209
Voted
IEEEHPCS
2010
15 years 5 months ago
2010
Model checking is a formal verification method widely accepted in the web service world because of its capability to reason about service behaviors, at their process-level. It ha...
169
click to vote
LFCS
2007
Springer
16 years 28 days ago
2007
Springer
Density elimination by substitutions is introduced as a uniform method for removing applications of the Takeuti-Titani density rule from proofs in firstorder hypersequent calculi....
155
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
We show that linear logic can serve as an expressive framework in which to model a rich variety of combinatorial auction mechanisms. Due to its resource-sensitive nature, linear l...
171
click to vote
CADE
1990
Springer
15 years 11 months ago
1990
Springer
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, kn...
182
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...