Towards Better Generalization for Neural Network-Based SAT Solvers-Reference-Cited by-同舟云学术

Towards Better Generalization for Neural Network-Based SAT Solvers

Published:2022 Issue: Volume: Page:199-210
ISSN:0302-9743
Container-title:Advances in Knowledge Discovery and Data Mining
language:
Short-container-title:

Author:

Zhang Chenhao,Zhang Yanjun,Mao Jeff,Chen Weitong,Yue Lin,Bai Guangdong,Xu Miao

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-05936-0_16

Reference23 articles.

1. Amizadeh, S., Matusevych, S., Weimer, M.: PDP: a general neural framework for learning constraint satisfaction solvers. arXiv:1903.01969 (2019)

2. Axelsson, R., Heljanko, K., Lange, M.: Analyzing context-free grammars using an incremental sat solver. In: International Colloquium on Automata, Languages, and Programming (2008)

3. Charniak, E.: Statistical parsing with a context-free grammar and word statistics. In: AAAI (1997)

4. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. ACM 5, 394–397 (1962)

5. Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7, 201–215 (1960)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. AI Knows Which Words Will Appear in Next Year’s Korean CSAT;2023 14th International Conference on Information and Communication Technology Convergence (ICTC);2023-10-11

2. AOPSS: A Joint Learning Framework for Aspect-Opinion Pair Extraction as Semantic Segmentation;Web and Big Data;2023

3. Detecting Contradictions from CoAP RFC Based on Knowledge Graph;Network and System Security;2022