Sciweavers

425 search results - page 53 / 85
» The TPS Theorem Proving System
Sort
View
TON
2010
132views more  TON 2010»
14 years 8 months ago
The optimality of two prices: maximizing revenue in a stochastic communication system
—This paper considers the problem of pricing and transmission scheduling for an Access Point (AP) in a wireless network, where the AP provides service to a set of mobile users. T...
Longbo Huang, Michael J. Neely
NDJFL
1998
105views more  NDJFL 1998»
14 years 9 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau
CORR
2007
Springer
133views Education» more  CORR 2007»
14 years 9 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel
CSFW
2006
IEEE
15 years 3 months ago
Simulation-Based Security with Inexhaustible Interactive Turing Machines
Recently, there has been much interest in extending models for simulation-based security in such a way that the runtime of protocols may depend on the length of their input. Findi...
Ralf Küsters
FROCOS
2009
Springer
15 years 4 months ago
Combining Theories with Shared Set Operations
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
Thomas Wies, Ruzica Piskac, Viktor Kuncak