1410 search results - page 70 / 282 » Proving theorems by reuse |
160
click to vote
JSYML
2002
15 years 5 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...
129
click to vote
ECCC
2010
15 years 4 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...
148
click to vote
GLOBECOM
2008
IEEE
16 years 5 days 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 ...
151
click to vote
PPPJ
2009
ACM
15 years 10 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...
143
click to vote
JAIR
2011
15 years 21 days 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...