Sciweavers

1391 search results - page 35 / 279
» Completeness of Neighbourhood Logic
Sort
View
TARK
2009
Springer
14 years 3 months ago
A logical characterization of iterated admissibility
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty ...
Joseph Y. Halpern, Rafael Pass
AML
2010
96views more  AML 2010»
13 years 9 months ago
Implicational (semilinear) logics I: a new hierarchy
In Abstract Algebraic Logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this proce...
Petr Cintula, Carles Noguera
ISVLSI
2002
IEEE
89views VLSI» more  ISVLSI 2002»
14 years 1 months ago
Speedup of Self-Timed Digital Systems Using Early Completion
An Early Completion technique is developed to significantly increase the throughput of NULL Convention self-timed digital systems without impacting latency or compromising their s...
Scott C. Smith
CADE
2001
Springer
14 years 9 months ago
A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities
The modalities of Dynamic Logic refer to the final state of a program execution and allow to specify programs with pre- and postconditions. In this paper, we extend Dynamic Logic w...
Bernhard Beckert, Steffen Schlager
ICCAD
1997
IEEE
83views Hardware» more  ICCAD 1997»
14 years 1 months ago
Replication for logic bipartitioning
Logic replication, the duplication of logic in order to limit communication between partitions, is an effective part of a complete partitioning solution. In this paper we seek a b...
Morgan Enos, Scott Hauck, Majid Sarrafzadeh