The hazards of fancy backtracking
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A machine program for theorem-proving
Communications of the ACM
Proceedings of the 38th annual Design Automation Conference
Local search for distributed SAT with complex local problems
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Solving the Round Robin Problem Using Propositional Logic
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Constraint Processing
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
A new method for solving hard satisfiability problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Solving satisfiability in combinational circuits with backtrack search and recursive learning
SBCCI'99 Proceedings of the XIIth conference on Integrated circuits and systems design
Applications of SAT solvers to cryptanalysis of hash functions
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Hi-index | 0.00 |
We present DPLL ABT, a distributed Satisfiability solver (SAT) (Ansótegui and Manyà in IberoAm J Artif Intell 7(20):43---56, 2003) designed to solve distributed SAT problem instances. Since SAT is a particular case of constraint satisfaction, we propose a solving method based on the Asynchronous Backtracking algorithm (ABT) (Yokoo et al. in IEEE Trans Knowl Data Eng 10(5):673---685, 1998) developed for distributed constraint reasoning. In addition, we have applied the Davis-Putnam procedure (DPLL) in every agent, plus the minimum conflict heuristic in case DPLL does not detect any inconsistency. The resulting algorithm improves the performance in terms of communication cost and computational effort versus the basic ABT. The SAT instance is distributed into agents, which cooperate to solve SAT instances just sharing the minimum information. We also present the experimental results that demonstrate the performance of the method in terms of communication and execution time comparing the performance with the basic ABT algorithm.