40 search results - page 7 / 8 » Compressing Propositional Refutations |
AGP
1995
IEEE
13 years 11 months ago
1995
IEEE
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
BIRTHDAY
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. In this survey on implicit induction I recollect some memories on the history of implicit induction as it is relevant for future research on computer-assisted theorem pro...
IJCAI
1997
13 years 9 months ago
1997
Several qualitative notions of epistemic dependence between propositions are studied. They are closely related to the ordinal notion of conditional possibility. What this paper pr...
ECCC
2010
13 years 6 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
The theory of compressed sensing has a natural application in interferometric aperture synthesis. As in many real-world applications, however, the assumption of random sampling, w...