WSAT(cc) - a fast local-search ASP solver
| dc.creator | Liu, Lengning | |
| dc.creator | Truszczynski, Miroslaw | |
| dc.date | 2003-10-31 | |
| dc.date.accessioned | 2026-07-07T03:20:31Z | |
| dc.date.available | 2026-07-07T03:20:31Z | |
| dc.description | 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. | |
| dc.description | Proceedings of LPNMR-03 (7th International Conference), LNCS, Springer Verlag | |
| dc.identifier | https://arxiv.org/abs/cs/0310062 | |
| dc.identifier | http://arxiv.org/abs/cs/0310062 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31856 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | I.2.8; F.4.1 | |
| dc.title | WSAT(cc) - a fast local-search ASP solver | |
| dc.type | text |