Article thumbnail

MarketSAT: An extremely decentralized (but really slow) algorithm for propositional satisfiability

By William E. Walsh and Michael P. Wellman


We describe MarketSAT, a highly decentralized, market-based algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a supply chain, where producers of particular variable as-signments must acquire licenses to fail to satisfy particular clauses. MarketSAT employs a market protocol for general supply chain problems, which we show to be expressively equivalent to 3SAT. Experiments suggest that MarketSAT re-liably converges to market allocations corresponding to sat-isfiable truth assignments. We experimentally compare the computational performance with GSAT, a centralized local search algorithm

Publisher: AAAI Press
Year: 2015
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.