内容简介：The Kissat SAT solver is a condensed and improved reimplementation ofCaDiCaL in C.It has improved data structures, better scheduling of inprocessing, optimized algorithms and implementation.The solver is not incremental yet, but can be used as a library.
The Kissat SAT solver is a condensed and improved reimplementation ofCaDiCaL in C.
It has improved data structures, better scheduling of inprocessing, optimized algorithms and implementation.
The solver is not incremental yet, but can be used as a library.
News
Kissat won first place in the main track of the SAT Competition 2020 and first place on unsatisfiable instances.
SAT Competition Winners
In order to show that SAT solving improved considerably in recent years, particularly also with Kissat in 2020, we collectedwinners of the SAT Competition from 2002 to 2020 and fixed and ported them to be compatabile with modern compilers.
Then we were running those "all-time winners" on our cluster on the competition instances from 2011, 2019 and 2020, more precisely on the 300 instances from the SAT Competition 2011 application track , the 400 instances from the SAT Race 2019 and the 400 instances from SAT Competition 2020 main track .
Here are plots showing the number of instances solved within a certain time limit, thus in essence the runtime cumulative distribution function (higher is better).
Note, the SAT Competition 2011 application track had only 300 instances, while the other two benchmarks sets from 2019 and 2020 consist of 400 apparently much harder instances each.
Our cluster has two Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz CPUs and 128 GB of main memory on each node, thus is slightly slower, but comparable to the StarExec cluster used in the competition. As time limit we used 5000 seconds as it is now common in the competition. Main memory was limited to 8 GB for 2011 and 2019 to utilize our cluster best. For 2020 we increased the limit to 32 GB, which allowed all solvers to stay below the memory limit (the organizers announced a 24 GB memory limit originally but actually used 128 GB).
Download
The latest version is available on GitHub at https://github.com/arminbiere/kissat
The following source code submitted to the SAT Competition 2020 won first place in the main track and first place on the unsatisfiable instances of the main track:
[ kissat-sc2020-039805f2.tar.xz ]
The code has an MIT license.
Resources
See the following SAT Competition 2020 system description for more details:
Armin Biere, Katalin Fazekas, Mathias Fleury, Maximillian Heisinger.
CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling Entering the SAT Competition 2020 .
To appear in Proc. of SAT Competition 2020 - Solver and Benchmark Descriptions .
[paper |bibtex |kissat |cadical | paracooba |plingeling |treengeling ]
There was also a related talk at POS'20 :
Armin Biere and Mathias Fleury.
11th Workshop on Pragmatics of SAT (POS'20)
Cyberspace, July 3, 2020.
[slides [ video |experiments ]
以上所述就是小编给大家介绍的《Kissat SAT Solver》，希望对大家有所帮助，如果大家有任何疑问请给我留言，小编会及时回复大家的。在此也非常感谢大家对 码农网 的支持！
猜你喜欢:
本站部分资源来源于网络，本站转载出于传递更多信息之目的，版权归原作者或者来源机构所有，如转载稿涉及版权问题，请联系我们。
计算机程序设计艺术：第4卷 第4册（双语版）
Donald E.Knuth / 苏运霖 / 机械工业出版社 / 2007-4 / 42.00元
关于算法分析的这多卷论著已经长期被公认为经典计算机科学的定义性描述。迄今已出版的完整的三卷组成了程序设计理论和实践的惟一的珍贵源泉，无数读者都赞扬Knuth的著作对个人的深远影响。科学家们为他的分析的美丽和优雅所惊叹，而从事实践的程序员们已经成功地应用他的“菜谱式”的解到日常问题上，所有人都由于Knuth在书中所表现出的博学、清晰、精确和高度幽默而对他无比敬仰。 为开始后续各卷的写作并更......一起来看看 《计算机程序设计艺术：第4卷 第4册（双语版）》 这本书的介绍吧!
