1410 search results - page 70 / 282 » Proving theorems by reuse |
JSYML
2002
13 years 9 months ago
2002
An interpolation theorem holds for many standard modal logics, but first order S5 is a prominent example of a logic for which it fails. In this paper it is shown that a first orde...
ECCC
2010
13 years 8 months ago
2010
We initiate the study of the proof complexity of propositional encoding of (weak cases of) concrete independence results. In particular we study the proof complexity of Paris-Harr...
GLOBECOM
2008
IEEE
14 years 4 months ago
2008
IEEE
This paper proposes a decentralized adaptive soft frequency reuse scheme for the uplink of a 4G long-term evolution (LTE) system. While universal frequencies reuse (UFR) is being ...
PPPJ
2009
ACM
14 years 2 months ago
2009
ACM
Reuse distance analysis has been proved promising in evaluating and predicting data locality for programs written in Fortran or C/C++. But its effect has not been examined for ap...
JAIR
2011
13 years 5 months ago
2011
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...