2035 search results - page 89 / 407 » On the complexity of stratified logics |
132
click to vote
JANCL
2006
15 years 6 months ago
2006
We present an overview of linear-time temporal logics with Presburger constraints whose models are sequences of tuples of integers. Such formal specification languages are welldesi...
211
click to vote
KSEM
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper, we compare merging operators in possibilistic logic. We first propose an approach to evaluating the discriminating power of a merging operator. After that...
171
click to vote
ICCAD
2009
IEEE
15 years 4 months ago
2009
IEEE
The problem of calculating accurate impact of crosstalk on a circuit considering its inherent logic and timing properties is very complex. Although it has been widely studied, it ...
209
click to vote
LPAR
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
176
click to vote
TPHOL
2009
IEEE
16 years 28 days ago
2009
IEEE
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctne...