Symmetry Reduction for SAT Representations of Transition Systems

Symmetry Reduction for SAT Representations of Transition Systems

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Jussi Rintanen

Citations:

14 - 1 self

BibTeX

@MISC{Rintanen_symmetryreduction,
    author = {Jussi Rintanen},
    title = {Symmetry Reduction for SAT Representations of Transition Systems},
    year = {}
}

Bookmark

OpenURL

Abstract

Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if the presence of symmetries is recognized. In earlier work, symmetries in constraint satisfaction problems have been handled by introducing symmetry-breaking constraints.

Citations

909	Chaff: Engineering an efficient SAT solver - Moskewicz, Madigan, et al. - 2001
463	Pushing the envelope: Planning, propositional logic, and stochastic search - KAUTZ, SELMAN - 1996
173	D.L.: Better verification through symmetry - Ip, Dill
152	A.P.: Symmetry and model checking - Emerson, Sistla
135	Symmetry-breaking Predicates for Search Problems - Crawford, Ginsberg, et al. - 1996
134	Encoding plans in propositional logic - Kautz, McAllester, et al. - 1996
122	Constructing conditional plans by a theorem prover - Rintanen - 1999
116	Eliminating interchangeable values in constraint satisfaction problems - Freuder - 1991
49	Contingent planning under uncertainty via stochastic satisfiability - Majercik, Littman - 2003
47	The detection and exploitation of symmetry in planning problems - Fox, Long - 1999
26	Exploiting symmetries in lifted csps - Joslin, Roy - 1997
20	Extending the exploitation of symmetries in planning - Fox, Long - 2002
9	Exploiting symmetry when model-checking software - Godefroid - 1999
8	One action is enough to plan - Guere, Alami