We describe two market-inspired approaches to propositional satisfiability. Whereas a previous market-inspired approach exhibited extremely slow performance, we find that variatio...
William E. Walsh, Makoto Yokoo, Katsutoshi Hirayam...
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...