37 search results - page 3 / 8 » Towards Structurally-Free Theorem Proving |
SYNASC
2006
IEEE
15 years 5 months ago
2006
IEEE
In the eld of automated reasoning, one of the most challenging (even if, perhaps, somewhat overlooked) problems thus far has been to develop a means of discerning, from amongst al...
CADE
2008
Springer
15 years 12 months ago
2008
Springer
Abstract. We implement an algorithm for extracting appropriate collections of classic-like sound and complete tableaux rules for a large class of finite-valued logics. Its output c...
113
click to vote
EC
2006
14 years 11 months ago
2006
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
103
click to vote
CADE
2010
Springer
15 years 23 days ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
118
click to vote
STOC
2006
ACM
15 years 12 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...