论文信息 - Applying GSAT to Non-Clausal Formulas

Applying GSAT to Non-Clausal Formulas

In this paper we describe how to modify GSAT so that it can be applied to non-clausal 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 | R. Sebastiani

[1] Roberto Sebastiani. Applying GSAT to Non-Clausal Formulas (Research Note) , 1994, J. Artif. Intell. Res..

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

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

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

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

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

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

[8] Stefan Klingenbeck. Generating Finite Counter Examples with Semantic Tableaux , 1995, TABLEAUX.

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

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