A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Making believers out of computers
Artificial Intelligence
Computation-oriented reductions of predicate to propositional logic
Decision Support Systems
A logical framework for depiction and image interpretation
Artificial Intelligence
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Minimizing the Number of Clauses by Renaming
Proceedings of the 10th International Conference on Automated Deduction
Partial instantiation theorem proving for distributed resource location
COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
Satisfiability Checking Using Boolean Expression Diagrams
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
CL '00 Proceedings of the First International Conference on Computational Logic
Applying the Davis-Putnam Procedure to Non-clausal Formulas
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Justification-Based Local Search with Adaptive Noise Strategies
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A stochastic non-CNF SAT solver
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Solving linear pseudo-Boolean constraint problems with local search
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Depth-driven circuit-level stochastic local search for SAT
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
| Hi-index | 0.00 |
In this paper we describe how to modify GSAT so that it can be applied to nonclausal formulas. The idea is to use a particular "score" function which gives the number of clauses of the CNF conversion of a formula which are false under a given truth assignment. Its value is computed in linear time, without constructing the CNF conversion itself. The proposed methodology applies to most of the variants of GSAT proposed so far.