Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Experimental results on the application of satisfiability algorithms to scheduling problems
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Phase Transitions in the Regular Random 3-SAT Problem
ISMIS '99 Proceedings of the 11th International Symposium on Foundations of Intelligent Systems
Transformations between Signed and Classical Clause Logic
ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic
Domain-independent extensions to GSAT: solving large structured satisfiability problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Evidence for invariants in local search
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Capturing Structure with Satisfiability
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Sports league scheduling: enumerative search for prob026 from CSPLib
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
An algorithm for random signed 3-SAT with intervals
Theoretical Computer Science
| Hi-index | 0.01 |
In this paper we describe new local secirch algorithms for regular CNP formulcis and investigate their suitability for solving problems from the dom2uns of graph coloring and sports scheduling. First, we define suitable encodings for such problems in the logic of regular CNF formulas. Second, we describe Regular-GSAT and Regular-WSAT, as well as some varisuits, which are a natured generalization of two prominent local search algorithms - GSAT and WSAT - used to solve the prepositional satisfiability (SAT) problem in classical logic. Third, we report on experimented results that demonstrate that encoding graph coloring and sports scheduling problems as instances of the SAT problem in regular CNF formulas and then solving these instances with local search algorithms can outperform or compete with state-of-the-art approciches to solving hard combinatorial problems.