Sciweavers

903 search results - page 5 / 181
» Completeness Results for Memory Logics
Sort
View
LICS
1994
IEEE
13 years 11 months ago
Linear Logic, Totality and Full Completeness
I give a `totality space' model for linear logic [4], detaking an abstract view of computations on a datatype. The model has similarities with both the coherence space model ...
Ralph Loader
ASPDAC
2006
ACM
117views Hardware» more  ASPDAC 2006»
14 years 1 months ago
A memory grouping method for sharing memory BIST logic
- With the increasing demand for SoCs to include rich functionality, SoCs are being designed with hundreds of small memories with different sizes and frequencies. If memory BIST lo...
Masahide Miyazaki, Tomokazu Yoneda, Hideo Fujiwara
LPAR
2001
Springer
13 years 12 months ago
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
Volker Diekert, Paul Gastin
STACS
1999
Springer
13 years 11 months ago
Completeness of Neighbourhood Logic
This paper presents a completeness result for a first-order interval temporal logic, called Neighbourhood Logic (NL) which has two neighbourhood modalities. NL can support the spe...
Rana Barua, Suman Roy, Zhou Chaochen
DLOG
2010
13 years 5 months ago
Optimal Rewritings in Definitorially Complete Description Logics
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
Inanç Seylan, Enrico Franconi, Jos de Bruij...