3047 search results - page 406 / 610 » On the Meaning of Logical Completeness |
GLVLSI
2009
IEEE
15 years 5 months ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
TIME
2009
IEEE
15 years 5 months ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
KCAP
2009
ACM
15 years 4 months ago
2009
ACM
Ontologies are conceptual models of particular domains, and domains can be modeled differently, representing different opinions, beliefs or perspectives. In other terms, ontolog...
103
click to vote
ASAP
2008
IEEE
15 years 4 months ago
2008
IEEE
Process technology has reduced in size such that it is possible to implement complete applicationspecific architectures as Systems-on-Chip (SoCs) using both Application-Specific I...
FGCN
2008
IEEE
15 years 4 months ago
2008
IEEE
The home network system (HNS, for short) is comprised of networked home appliances, which achieves various value-added services for home users. Assuring safety of the HNS and the ...