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

2003/10/31 by Lengning Liu, Liu, Lengning, Mirosław Truszczyński +2
Computer Science · #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation #Semantic Web and Ontologies #cs.AI

paper · pdf · doi:10.48550/arxiv.cs/0310062

Proceedings of LPNMR-03 (7th International Conference), LNCS, Springer Verlag

arxiv created 2003/10/31 · arxiv updated 2009/12/01

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.

Related

• Local-search techniques for propositional logic extended with cardinality constraints
• aspps --- an implementation of answer-set programming with propositional schemata
• Proceedings of Answer Set Programming and Other Computing Paradigms (ASPOCP 2012), 5th International Workshop, September 4, 2012, Budapest, Hungary
• Proceedings of Answer Set Programming and Other Computing Paradigms (ASPOCP 2013), 6th International Workshop, August 25, 2013, Istanbul, Turkey
• lpopt: A Rule Optimization Tool for Answer Set Programming