Information Processing Letters
Making believers out of computers
Artificial Intelligence
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
A logical framework for depiction and image interpretation
Artificial Intelligence
On selecting a satisfying truth assignment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Efficient local search for very large-scale satisfiability problems
ACM SIGART Bulletin
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The complexity of automated reasoning
The complexity of automated reasoning
Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Overcoming the Christmas Tree Syndrome
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Testing Nondeterminate Systems
ISSRE '00 Proceedings of the 11th International Symposium on Software Reliability Engineering
SAT graph-based representation: A new perspective
Journal of Algorithms
An Iterative local-search framework for solving constraint satisfaction problem
Applied Soft Computing
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
The distributed breakout algorithms
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Automated reformulation of specifications by safe delay of constraints
Artificial Intelligence
A connectionist framework for reasoning: reasoning with examples
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Artificial Intelligence in Medicine
JSAI'03/JSAI04 Proceedings of the 2003 and 2004 international conference on New frontiers in artificial intelligence
DS'10 Proceedings of the 13th international conference on Discovery science
Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Journal of Automated Reasoning
A new artificial immune system for solving the maximum satisfiability problem
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
Artificial Intelligence Review
Querying uncertain data with aggregate constraints
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Adaptive iterated local search for cross-domain optimisation
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Pruning search space for weighted first order horn clause satisfiability
ILP'10 Proceedings of the 20th international conference on Inductive logic programming
Tight bounds on local search to approximate the maximum satisfiability problems
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A CSP solver focusing on FAC variables
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Evaluating las vegas algorithms: pitfalls and remedies
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Reasoning, metareasoning, and mathematical truth: studies of theorem proving under limited resources
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Penalty logic and its link with Dempster-Shafer theory
UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence
On the impact of small-world on local search
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Relative generic computational forensic techniques
IH'04 Proceedings of the 6th international conference on Information Hiding
Alloy+HotCore: a fast approximation to unsat core
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Symmetry breaking and local search spaces
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Solving over-constrained problems with SAT technology
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
A symbolic search based approach for quantified boolean formulas
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Diversification and determinism in local search for satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Random walk with continuously smoothed variable weights
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Constraint metrics for local search
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Improved exact solvers for weighted Max-SAT
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Mining chemical compound structure data using inductive logic programming
AM'03 Proceedings of the Second international conference on Active Mining
Introduction to inconsistency tolerance
Inconsistency Tolerance
Using bees to solve a data-mining problem expressed as a max-sat one
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
GRASP with path-relinking for the weighted maximum satisfiability problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
SAT solving with reference points
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
An evolutionary local search algorithm for the satisfiability problem
TAINN'05 Proceedings of the 14th Turkish conference on Artificial Intelligence and Neural Networks
Local search for unsatisfiability
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Approximate boolean reasoning: foundations and applications in data mining
Transactions on Rough Sets V
Improving parallel local search for SAT
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Constraint-Based approaches to the covering test problem
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
Adaptive memory-based local search for MAX-SAT
Applied Soft Computing
Improving PAWS by the island confinement method
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Multi-agent collaborative service and distributed problem solving
Cognitive Systems Research
Focused most probable world computations in probabilistic logic programs
Annals of Mathematics and Artificial Intelligence
An overview of parallel SAT solving
Constraints
Self-control of the time complexity of a constraint satisfaction problem solver program
Journal of Systems and Software
A multilevel memetic algorithm for large sat-encoded problems
Evolutionary Computation
Stochastic Learning for SAT-Encoded Graph Coloring Problems
International Journal of Applied Metaheuristic Computing
A method to avoid duplicative flipping in local search for SAT
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Hyperplane initialized local search for MAXSAT
Proceedings of the 15th annual conference on Genetic and evolutionary computation
On the usefulness of linkage processing for solving MAX-SAT
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Using cross-entropy for satisfiability
Proceedings of the 28th Annual ACM Symposium on Applied Computing
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
Comprehensive score: towards efficient local search for SAT with long clauses
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Weight-enhanced diversification in stochastic local search for satisfiability
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Using automatic programming to generate state-of-the-art algorithms for random 3-SAT
Journal of Heuristics
Efficient Two Dimensional-IP routing: An incremental deployment design
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improving the privacy of the asynchronous partial overlay protocol
Multiagent and Grid Systems - Principles and Practice of Multi-Agent Systems
| Hi-index | 0.00 |
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approaches such as the Davis-Putnam procedure or resolution. We also show that GSAT can solve structured satisfiability problems quickly. In particular, we solve encodings of graph coloring problems, N-queens, and Boolean induction. General application strategies and limitations of the approach are also discussed. GSAT is best viewed as a model-finding procedure. Its good performance suggests that it may be advantageous to reformulate reasoning tasks that have traditionally been viewed as theorem-proving problems as model-finding tasks.