id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
cord-030683-xe9bn1cc	Wang, Wenxi	A Study of Symmetry Breaking Predicates and Model Counting	2020-03-13		.txt	text/plain	6667	345	55	We study the use of CNF-level and domain-level symmetry breaking predicates in the context of the state-of-the-art in model counting, specifically the leading approximate model counter ApproxMC and the recently introduced exact model counter ProjMC. Domain-specific predicates are particularly useful, and in many cases can provide full symmetry breaking to enable highly efficient model counting up to isomorphism. The other option is to ensure the formula that is input to the model counter includes symmetry breaking predicates [20, 21] , i.e., additional constraints that only allow canonical solutions from each isomorphism class, so the model counter can report the desired count. A key lesson of our study (in the context of the model counting problems considered) is: if non-isomorphic solution counts are desired, use full symmetry breaking predicates at the domain-level whenever feasible -even if it is straightforward to compute the number of non-isomorphic solutions from the number of all solutions, or even if the symmetry breaking constraints have to be written manually.	./cache/cord-030683-xe9bn1cc.txt	./txt/cord-030683-xe9bn1cc.txt