2492 search results - page 229 / 499 » On the General Signature Trees |
183
click to vote
CAV
2012
Springer
13 years 9 months ago
2012
Springer
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
154
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
We describe an adaptive method for extracting records from web pages. Our algorithm combines a weighted tree matching metric with clustering for obtaining data extraction patterns...
147
click to vote
ICAISC
2004
Springer
16 years 6 hour ago
2004
Springer
Model checking of temporal logic has already been proposed for automatic planning. In this paper, we introduce a simple adaptation of the ATL model checking algorithm that returns ...
165
click to vote
CSL
2001
Springer
15 years 11 months ago
2001
Springer
We reveal a symmetric structure in the ho/n games model of innocent strategies, introducing rigid strategies, a concept dual to bracketed strategies. We prove a direct definabilit...
193
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...