2308 search results - page 128 / 462 » Representing Symbolic Reasoning |
162
click to vote
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
162
click to vote
SMA
2005
ACM
15 years 12 months ago
2005
ACM
We present an algorithm for generating the Voronoi cells for a set of rational C1 -continuous planar closed curves, which is precise up to machine precision. Initially, bisectors ...
181
click to vote
TACAS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...
207
click to vote
AMDO
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we describe a recognition approach based on the notion of primitives. As opposed to recognizing actions based on temporal trajectories or temporal volumes, primitive-...
169
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
A k-ary necklace of order n is an equivalence class of strings of length n of symbols from {0, 1, . . . , k − 1} under cyclic rotation. In this paper we define an ordering on t...