903 search results - page 80 / 181 » Completeness Results for Memory Logics |
ISCA
1997
IEEE
14 years 1 months ago
1997
IEEE
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, ...
FOIKS
2008
Springer
13 years 10 months ago
2008
Springer
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and V¨a¨an¨anen, and their compositional semantics due to Hodges. We show h...
AIML
2004
13 years 10 months ago
2004
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
ET
2000
13 years 8 months ago
2000
: We present a method for obtaining a minimal set of test configurations and their associated set oftest patterns that completely tests re-programmable Programmable Logic Arrays (P...