Applying GSAT to Non-Clausal Formulas
R. Sebastiani
Abstract
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.
Create a lesson
Related papers
OSGR: Observation-Support Graph Reasoning for Earth Observation Question Answering
Dazhou Yu, Zerong Wang, Riyang Bao et al.
Bidirectional Centered Score Matching for Discrete Diffusion Distillation
Peng Tu, Baoyou Chen, Haoyuan Xia et al.
Harness-S: Learning from Sibling Harnesses for Generalizable Agent Training
Kangning Zhang, Wenxiang Jiao, Bowen Fang et al.
Reliability Stress Testing of RAG Retrieval under Query-Relevant Corpus Poisoning
Janet Sung, Kainan Zhou, Gangzhen Qian et al.
Neologism Inoculation Prompting
David Demitri Africa, Cameron Holmes
AceAction-5M: Hierarchical Goals for Generalist Action Learning Across 3D Game Worlds
Kailing Li, Ruoxuan Zhang, Zheyuan Zhou et al.