Sciweavers

3793 search results - page 371 / 759
» Expressive Description Logics
Sort
View
ISCA
1997
IEEE
104views Hardware» more  ISCA 1997»
15 years 11 months ago
Complexity-Effective Superscalar Processors
The performance tradeoff between hardware complexity and clock speed is studied. First, a generic superscalar pipeline is defined. Then the specific areas of register renaming, ...
Subbarao Palacharla, Norman P. Jouppi, James E. Sm...
CONCUR
2007
Springer
15 years 10 months ago
Temporal Antecedent Failure: Refining Vacuity
We re-examine vacuity in temporal logic model checking. We note two disturbing phenomena in recent results in this area. The first indicates that not all vacuities detected in prac...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah
AGI
2008
15 years 8 months ago
How Might Probabilistic Reasoning Emerge from the Brain?
: A series of hypotheses is proposed, connecting neural structures and dynamics with the formal structures and processes of probabilistic logic. First, a hypothetical connection is...
Ben Goertzel, Cassio Pennachin
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
16 years 4 days ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
CORR
2007
Springer
162views Education» more  CORR 2007»
15 years 6 months ago
Order-Invariant MSO is Stronger than Counting MSO in the Finite
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), ex...
Tobias Ganzow, Sasha Rubin