WSAT(CC) -- a fast local-search ASP solver. 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.

References in zbMATH (referenced in 1 article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Liu, Lengning; Truszczyński, Mirosław: WSAT(CC) -- a fast local-search ASP solver (2004)