arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2605.04819cs.LG
收藏

通过子句-文字超图上的极性感知表示学习进行不可满足核心预测

Unsat Core Prediction through Polarity-Aware Representation Learning over Clause-Literal Hypergraphs

University of Science and Technology of China(中国科学技术大学)

Zhenchao Sun, Shuai Ma, Ping Lu, Chongyang Tao

AI总结:

提出一种极性感知的表示学习框架,将SAT公式建模为子句-文字超图,通过极性感知分解和极性反转一致性正则化,有效预测不可满足核心。

摘要:

图神经网络已广泛用于布尔可满足性(SAT)任务中,以从SAT公式中学习结构信息。这些研究的目标是解决SAT实例或增强SAT求解器,包括不可满足核心预测等任务。然而,大多数现有方法将SAT公式建模为二分图或有向无环图,这些方法在捕捉文字和子句之间的子句级和高阶交互方面不够直接。此外,这些方法在建模SAT固有的极性相关属性(如变量的正负文字之间的互补关系)方面存在局限性。为了解决这些局限性,我们提出了一种基于子句-文字超图的极性感知表示学习框架。我们将SAT公式建模为子句-文字超图,并辅以子句关联图以捕捉高阶结构交互。然后,我们引入一种极性感知分解机制,将变量表示分离为极性不变和等变分量,显式建模正负文字之间的关系,并将生成的文字表示沿超图结构传播。我们进一步引入极性反转一致性正则化,以在训练过程中强化极性一致的表示。在多个SAT数据集上的实验结果表明了该方法的有效性。

英文摘要:

Graph neural networks have been widely used in Boolean satisfiability (SAT) tasks to learn structural information from SAT formulas. The goal of these studies is to solve SAT instances or to enhance SAT solvers, including tasks such as unsat-core prediction. However, most existing approaches model a SAT formula as a bipartite graph or a directed acyclic graph, which are less direct in capturing clause-level and higher-order interactions among literals and clauses. Moreover, these approaches are limited in modeling intrinsic polarity-related properties of SAT, such as the complementary relationship between the positive and negative literals of a variable. To address these limitations, we propose a polarity-aware representation learning framework over clause-literal hypergraphs. We model SAT formulas as clause-literal hypergraphs augmented with a clause incidence graph to capture higher-order structural interactions. We then introduce a polarity-aware decomposition mechanism that separates variable representations into polarity invariant and equivariant components, explicitly modeling the relationship between positive and negative literals, with the resulting literal representations propagated along the hypergraph structure. We further incorporate a polarity-inversion consistency regularization to reinforce polarity-consistent representations during training. Experimental results on multiple SAT datasets demonstrate the effectiveness of the proposed approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑