Sciweavers

24 search results - page 2 / 5
» Symmetry Reduction for SAT Representations of Transition Sys...
Sort
View
CSCLP
2004
Springer
13 years 10 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
13 years 11 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert
JSAT
2008
89views more  JSAT 2008»
13 years 4 months ago
Towards a Classification of Hamiltonian Cycles in the 6-Cube
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representati...
Yury Chebiryak, Daniel Kroening
ADCM
1998
133views more  ADCM 1998»
13 years 4 months ago
Numerical exploitation of symmetry in integral equations
: Linear integral operators describing physical problems on symmetric domains often are equivariant, which means that they commute with certain symmetries, i.e., with a group of or...
Eugene L. Allgower, Kurt Georg
ATVA
2006
Springer
123views Hardware» more  ATVA 2006»
13 years 8 months ago
Symmetry Reduction for Probabilistic Model Checking Using Generic Representatives
Generic representatives have been proposed for the effective combination of symmetry reduction and symbolic representation with BDDs in non-probabilistic model checking. This appro...
Alastair F. Donaldson, Alice Miller