论文信息 - Applying GSAT to Non-Clausal Formulas (Research Note)

Applying GSAT to Non-Clausal Formulas (Research Note)

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.

Roberto Sebastiani

[1] Bart Selman,et al. Planning as Satisfiability , 1992, ECAI.

[2] Bart Selman,et al. Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .

[3] Robert G. Jeroslow,et al. Computation-oriented reductions of predicate to propositional logic , 1988, Decis. Support Syst..

[4] Ian P. Gent,et al. The Enigma of SAT Hill-climbing Procedures , 1992 .

[5] David A. Plaisted,et al. A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..

[6] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[7] Toby Walsh,et al. Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.

[8] John K. Slaney. SCOTT: A Model-Guided Theorem Prover , 1993, IJCAI.

[9] Hector J. Levesque,et al. Making Believers out of Computers , 1986, Artif. Intell..

[10] Roberto Sebastiani,et al. Applying GSAT to Non-Clausal Formulas , 1993, J. Artif. Intell. Res..

[11] Raymond Reiter,et al. A Logical Framework for Depiction and Image Interpretation , 1989, Artif. Intell..

[12] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.

[13] Thierry Boy de la Tour. Minimizing the Number of Clauses by Renaming , 1990, CADE.