WSAT(cc) - a fast local-search ASP solver
arXiv:cs/0310062
Abstract
We describe WSAT(cc), a local-search solver for computing models of theories in the language of propositional logic extended by cardinality atoms. WSAT(cc) is a processing back-end for the logic PS+, a recently proposed formalism for answer-set programming.
Proceedings of LPNMR-03 (7th International Conference), LNCS, Springer Verlag