WSAT(CC) — A Fast Local-Search ASP Solver
L Liu, M Truszczyński - … : 7th International Conference, LPNMR 2004 Fort …, 2004 - Springer
L Liu, M Truszczyński
Logic Programming and Nonmonotonic Reasoning: 7th International Conference …, 2004•Springer… 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. …
In [4], we showed that WSAT(CC) is often much faster than a local-search SAT solver WSAT
and has, in general, a higher success rate (likelihood that it will find a model if an input
theory has one). In [1], we used …
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. …
In [4], we showed that WSAT(CC) is often much faster than a local-search SAT solver WSAT
and has, in general, a higher success rate (likelihood that it will find a model if an input
theory has one). In [1], we used …
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.
Springer
Showing the best result for this search. See all results