2022 search results - page 201 / 405 » Complexity of Non-Monotonic Logics |
186
click to vote
SIGSOFT
2007
ACM
16 years 7 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
279
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
189
click to vote
MTDT
2003
IEEE
15 years 11 months ago
2003
IEEE
ct Defect-based testing for digital logic concentrates primarily on methods of test application, including for example at-speed structural tests and IDDQ testing. In contrast, defe...
165
click to vote
ICCD
2005
IEEE
16 years 3 months ago
2005
IEEE
In this paper, we make two major contributions: First, to enhance Boolean learning, we propose a new class of logic implications called extended forward implications. Using a nove...
155
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...