pith. sign in

arxiv: cs/0310062 · v1 · submitted 2003-10-31 · 💻 cs.AI

WSAT(cc) - a fast local-search ASP solver

classification 💻 cs.AI
keywords wsatlocal-searchlogicsolveranswer-setatomsback-endcardinality
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.