Applying GSATto Non-Clausal Formulas | Zendy

Roberto Sebastiani | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Applying GSATto Non-Clausal Formulas

Author(s) -

Roberto Sebastiani

Publication year - 1994

Publication title -

journal of artificial intelligence research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.79

H-Index - 123

eISSN - 1943-5037

pISSN - 1076-9757

DOI - 10.1613/jair.49

Subject(s) - computer science , function (biology) , value (mathematics) , generating function , algorithm , mathematics , discrete mathematics , machine learning , evolutionary biology , biology

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research