arXiv:1909.11588

Graph Neural Reasoning May Fail in Certifying Boolean Unsatisfiability

Ziliang Chen, Zhanfu Yang

제출 2019-09-25

원문 초록

It is feasible and practically-valuable to bridge the characteristics between graph neural networks (GNNs) and logical reasoning. Despite considerable efforts and successes witnessed to solve Boolean satisfiability (SAT), it remains a mystery of GNN-based solvers for more complex predicate logic formulae. In this work, we conjectures with some evidences, that generally-defined GNNs present several limitations to certify the unsatisfiability (UNSAT) in Boolean formulae. It implies that GNNs may probably fail in learning the logical reasoning tasks if they contain proving UNSAT as the sub-problem included by most predicate logic formulae.

함께 살펴볼 논문

공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.

arXiv:2505.22752공통 태그 Logical Reasoning공식 코드 · Papers with Code

Climate Finance Bench

토론

이 논문과 연결된 포럼 글이 아직 없습니다.