7167 search results - page 1156 / 1434 » Answer Set Programming |
204
Voted
CP
2009
Springer
16 years 3 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
241
click to vote
CP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Many combinatorial problems encountered in practice involve constraints that require that a set of variables take distinct or equal values. The AllDifferent constraint, i...
139
Voted
CAV
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...
145
Voted
CAV
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptio...
119
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...