903 search results - page 24 / 181 » Completeness Results for Memory Logics |
ASPLOS
1998
ACM
13 years 11 months ago
1998
ACM
Optimizations aimed at reducing the impact of memory operations on execution speed have long concentrated on improving cache performance. These efforts achieve a reasonable level...
ICLP
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
AAAI
2008
13 years 9 months ago
2008
Logic programming with negation offers a compelling approach to abductive reasoning. This paper shows a simple view of abduction in this context for the completion semantics, unde...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results. We use a Church style exte...
GLVLSI
2003
IEEE
14 years 24 days ago
2003
IEEE
We introduce a simple hierarchical design technique for using dynamic domino circuits to build high-performance self-timed data path circuits. We wrap the dynamic domino circuit i...