WSAT(cc) - a fast local-search ASP solver
Lengning Liu, Miroslaw Truszczynski
TL;DR
WSAT(cc) is a fast local-search solver designed for propositional logic theories with cardinality atoms, serving as an efficient backend for the PS+ formalism in answer-set programming.
Contribution
The paper introduces WSAT(cc), a novel local-search solver optimized for theories with cardinality atoms, enhancing answer-set programming capabilities.
Findings
WSAT(cc) demonstrates high speed in computing models.
It effectively handles theories with cardinality atoms.
The solver improves answer-set programming performance.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Semantic Web and Ontologies · Multi-Agent Systems and Negotiation