Sciweavers

3891 search results - page 626 / 779
» A logic for strategic reasoning
Sort
View
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
14 years 3 months ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...
LICS
2007
IEEE
14 years 3 months ago
A Dependent Set Theory
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
Wojciech Moczydlowski
COORDINATION
2007
Springer
14 years 3 months ago
Fact Spaces: Coordination in the Face of Disconnection
Coordination languages for ad hoc networks with a fluid topology do not offer adequate support to detect and deal with device disconnection. Such a disconnection is particularly ...
Stijn Mostinckx, Christophe Scholliers, Eline Phil...
CSL
2007
Springer
14 years 3 months ago
Incorporating Tables into Proofs
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
Dale Miller, Vivek Nigam
CSL
2007
Springer
14 years 3 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel