846 search results - page 96 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
145
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
For a logic design with level-sensitive latches, we need to validate timing signal paths which may flush through several latches. We developed efficient algorithms based on the mo...
143
click to vote
AAAI
2006
15 years 7 months ago
2006
In this paper, we propose a family of operators for merging stratified knowledge bases under integrity constraints. The operators are defined in a model-theoretic way. Our merging...
145
click to vote
DLOG
2006
15 years 7 months ago
2006
We recently proposed action formalisms based on description logics (DLs) as decidable fragments of well-established action theories such as the Situation Calculus and the Fluent C...
154
click to vote
ASPDAC
1998
ACM
15 years 10 months ago
1998
ACM
−This paper describes a new redundant fault identification algorithm with Exclusive-OR circuit reduction. The experimental results using this algorithm with a FAN-based test patt...
146
click to vote
CORR
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we introduce a general framework for defining the depth of a sequence with respect to a class of observers. We show that our general framework captures all depth not...