2661 search results - page 89 / 533 » Model Checking Performability Properties |
114
click to vote
CAV
2010
Springer
15 years 6 months ago
2010
Springer
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
140
click to vote
LPNMR
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
150
Voted
AGP
2003
IEEE
15 years 7 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
109
click to vote
ENTCS
2008
15 years 2 months ago
2008
The broad availability of multi-core chips on standard desktop PCs provides strong motivation for the development of new algorithms for logic model checkers that can take advantag...
ECIR
2010
Springer
15 years 3 months ago
2010
Springer
Performance prediction has gained increasing attention in the IR field since the half of the past decade and has become an established research topic in the field. The present work...