188 search results - page 7 / 38 » What Is a Skeptical Proof |
ENTCS
2006
13 years 8 months ago
2006
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
APLAS
2011
ACM
12 years 8 months ago
2011
ACM
The well-known third list homomorphism theorem states that if a function h is both an instance of foldr and foldl, it is a list homomorphism. Plenty of previous works devoted to co...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
ENTCS
2006
13 years 8 months ago
2006
We describe an ongoing project in which we attempt to describe a neutral approach to proof and refutation. In particular, we present a language of neutral expressions which contai...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Common knowledge logic is meant to describe situations of the real world where a group of agents is involved. These agents share knowledge and make strong hypotheses on the knowled...