sat启发的叠加消去法

IF 0.7 4区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS

ACM Transactions on Computational Logic Pub Date : 2023-01-18 DOI:https://dl.acm.org/doi/10.1145/3565366

Petar Vukmirović, Jasmin Blanchette, Marijn J. H. Heule

{"title":"sat启发的叠加消去法","authors":"Petar Vukmirović, Jasmin Blanchette, Marijn J. H. Heule","doi":"https://dl.acm.org/doi/10.1145/3565366","DOIUrl":null,"url":null,"abstract":"<p>Optimized SAT solvers not only preprocess the clause set, they also transform it during solving as inprocessing. Some preprocessing techniques have been generalized to first-order logic with equality. In this article, we port inprocessing techniques to work with superposition, a leading first-order proof calculus, and we strengthen known preprocessing techniques. Specifically, we look into elimination of hidden literals, variables (predicates), and blocked clauses. Our evaluation using the Zipperposition prover confirms that the new techniques usefully supplement the existing superposition machinery.</p>","PeriodicalId":50916,"journal":{"name":"ACM Transactions on Computational Logic","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2023-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SAT-Inspired Eliminations for Superposition\",\"authors\":\"Petar Vukmirović, Jasmin Blanchette, Marijn J. H. Heule\",\"doi\":\"https://dl.acm.org/doi/10.1145/3565366\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Optimized SAT solvers not only preprocess the clause set, they also transform it during solving as inprocessing. Some preprocessing techniques have been generalized to first-order logic with equality. In this article, we port inprocessing techniques to work with superposition, a leading first-order proof calculus, and we strengthen known preprocessing techniques. Specifically, we look into elimination of hidden literals, variables (predicates), and blocked clauses. Our evaluation using the Zipperposition prover confirms that the new techniques usefully supplement the existing superposition machinery.</p>\",\"PeriodicalId\":50916,\"journal\":{\"name\":\"ACM Transactions on Computational Logic\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-01-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Computational Logic\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/https://dl.acm.org/doi/10.1145/3565366\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Computational Logic","FirstCategoryId":"94","ListUrlMain":"https://doi.org/https://dl.acm.org/doi/10.1145/3565366","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

优化的SAT求解器不仅对子句集进行预处理，而且在求解过程中将其转换为处理过程。一些预处理技术已经推广到一阶等价逻辑。在本文中，我们移植了处理技术来处理叠加，这是一种领先的一阶证明微积分，我们加强了已知的预处理技术。具体来说，我们将研究隐藏文字、变量(谓词)和阻塞子句的消除。我们使用Zipperposition证明的评估证实了新技术有效地补充了现有的叠加机制。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

SAT-Inspired Eliminations for Superposition

Optimized SAT solvers not only preprocess the clause set, they also transform it during solving as inprocessing. Some preprocessing techniques have been generalized to first-order logic with equality. In this article, we port inprocessing techniques to work with superposition, a leading first-order proof calculus, and we strengthen known preprocessing techniques. Specifically, we look into elimination of hidden literals, variables (predicates), and blocked clauses. Our evaluation using the Zipperposition prover confirms that the new techniques usefully supplement the existing superposition machinery.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ACM Transactions on Computational Logic 工程技术-计算机：理论方法

CiteScore

2.30

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： TOCL welcomes submissions related to all aspects of logic as it pertains to topics in computer science. This area has a great tradition in computer science. Several researchers who earned the ACM Turing award have also contributed to this field, namely Edgar Codd (relational database systems), Stephen Cook (complexity of logical theories), Edsger W. Dijkstra, Robert W. Floyd, Tony Hoare, Amir Pnueli, Dana Scott, Edmond M. Clarke, Allen E. Emerson, and Joseph Sifakis (program logics, program derivation and verification, programming languages semantics), Robin Milner (interactive theorem proving, concurrency calculi, and functional programming), and John McCarthy (functional programming and logics in AI). Logic continues to play an important role in computer science and has permeated several of its areas, including artificial intelligence, computational complexity, database systems, and programming languages. The Editorial Board of this journal seeks and hopes to attract high-quality submissions in all the above-mentioned areas of computational logic so that TOCL becomes the standard reference in the field. Both theoretical and applied papers are sought. Submissions showing novel use of logic in computer science are especially welcome.