smt -解算器的作用:NP和EXPTIME中选定问题的编码和求解

Sci. Ann. Comput. Sci. Pub Date : 2018-09-25 DOI:10.7561/SACS.2018.2.269

A. Niewiadomski, P. Switalski, Teofil Sidoruk, W. Penczek

{"title":"smt -解算器的作用:NP和EXPTIME中选定问题的编码和求解","authors":"A. Niewiadomski, P. Switalski, Teofil Sidoruk, W. Penczek","doi":"10.7561/SACS.2018.2.269","DOIUrl":null,"url":null,"abstract":"We compare the efficiency of seven modern SMT-solvers for several decision and combinatorial problems: the bounded Post correspondence problem (BPCP), the extended string correction problem (ESCP), and the Towers of Hanoi (ToH) of exponential solutions. For this purpose, we define new original reductions to SMT for all the above problems, and show their complexity. Our extensive experimental results allow for drawing quite interesting conclusions on efficiency and applicability of SMT-solvers depending on the theory used in the encoding.","PeriodicalId":394919,"journal":{"name":"Sci. Ann. Comput. Sci.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"SMT-Solvers in Action: Encoding and Solving Selected Problems in NP and EXPTIME\",\"authors\":\"A. Niewiadomski, P. Switalski, Teofil Sidoruk, W. Penczek\",\"doi\":\"10.7561/SACS.2018.2.269\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We compare the efficiency of seven modern SMT-solvers for several decision and combinatorial problems: the bounded Post correspondence problem (BPCP), the extended string correction problem (ESCP), and the Towers of Hanoi (ToH) of exponential solutions. For this purpose, we define new original reductions to SMT for all the above problems, and show their complexity. Our extensive experimental results allow for drawing quite interesting conclusions on efficiency and applicability of SMT-solvers depending on the theory used in the encoding.\",\"PeriodicalId\":394919,\"journal\":{\"name\":\"Sci. Ann. Comput. Sci.\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sci. Ann. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.7561/SACS.2018.2.269\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sci. Ann. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7561/SACS.2018.2.269","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

我们比较了七个现代smt求解器在几个决策和组合问题上的效率:有界后通信问题(BPCP)、扩展字符串修正问题(ESCP)和指数解的河内塔(ToH)。为此，我们为上述所有问题定义了新的原始SMT缩减，并显示了它们的复杂性。根据编码中使用的理论，我们广泛的实验结果可以得出关于smt求解器的效率和适用性的相当有趣的结论。

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

查看原文本刊更多论文

SMT-Solvers in Action: Encoding and Solving Selected Problems in NP and EXPTIME

We compare the efficiency of seven modern SMT-solvers for several decision and combinatorial problems: the bounded Post correspondence problem (BPCP), the extended string correction problem (ESCP), and the Towers of Hanoi (ToH) of exponential solutions. For this purpose, we define new original reductions to SMT for all the above problems, and show their complexity. Our extensive experimental results allow for drawing quite interesting conclusions on efficiency and applicability of SMT-solvers depending on the theory used in the encoding.

求助全文

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

来源期刊

Sci. Ann. Comput. Sci.

自引率

0.00%

发文量