2 citations · 2 across the 5 of their papers we have counts for
3 papers · 1 filter
Satisfiability and computing van der Waerden numbers
Michael R. Dransfield, Victor W. Marek, Miroslaw Truszczynski
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive…
WSAT(cc) - a fast local-search ASP solver
Lengning Liu, Miroslaw Truszczynski
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…
Local-search techniques for propositional logic extended with cardinality constraints
Lengning Liu, Miroslaw Truszczynski
We study local-search satisfiability solvers for propositional logic extended with cardinality atoms, that is, expressions that provide explicit ways to model constraints on cardin…