7 search results - page 2 / 2 » Symmetry breaking for pseudo-Boolean formulas |
IJCAI
2003
13 years 6 months ago
2003
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...
CORR
2011
Springer
13 years 7 days ago
2011
Springer
Grishin ([10]) proposed enriching the Lambek calculus with multiplicative disjunction (par) and coresiduals. Applications to linguistics were discussed by Moortgat ([15]), who spok...