可满足性检验中的符号计算技术

2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2016-09-01 DOI:10.1109/SYNASC.2016.014

E. Ábrahám

{"title":"可满足性检验中的符号计算技术","authors":"E. Ábrahám","doi":"10.1109/SYNASC.2016.014","DOIUrl":null,"url":null,"abstract":"Satisfiability Checking is a relatively young research area, aiming at the development of efficient software technologies for checking the satisfiability of existentially quantified logical formulas. Besides the success story of SAT solving for propositional logic, SAT-modulo-theories (SMT) solvers offer sophisticated solutions for different theories. When targeting arithmetic theories, SMT solvers also make use of decision procedures rooted in Symbolic Computation. In this paper we give a brief introduction to SMT solving, discuss differences to Symbolic Computation, and illustrate the potentials and obstacles for embedding Symbolic Computation techniques in SMT solving on the example of the Cylindrical Algebraic Decomposition.","PeriodicalId":268635,"journal":{"name":"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Symbolic Computation Techniques in Satisfiability Checking\",\"authors\":\"E. Ábrahám\",\"doi\":\"10.1109/SYNASC.2016.014\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Satisfiability Checking is a relatively young research area, aiming at the development of efficient software technologies for checking the satisfiability of existentially quantified logical formulas. Besides the success story of SAT solving for propositional logic, SAT-modulo-theories (SMT) solvers offer sophisticated solutions for different theories. When targeting arithmetic theories, SMT solvers also make use of decision procedures rooted in Symbolic Computation. In this paper we give a brief introduction to SMT solving, discuss differences to Symbolic Computation, and illustrate the potentials and obstacles for embedding Symbolic Computation techniques in SMT solving on the example of the Cylindrical Algebraic Decomposition.\",\"PeriodicalId\":268635,\"journal\":{\"name\":\"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2016.014\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2016.014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

可满足性检验是一个相对年轻的研究领域，旨在开发有效的软件技术来检验存在量化逻辑公式的可满足性。除了命题逻辑SAT求解的成功案例，SAT-模理论(SMT)求解器为不同的理论提供了复杂的解决方案。当针对算术理论时，SMT求解器也使用植根于符号计算的决策过程。本文简要介绍了SMT求解，讨论了与符号计算的区别，并以柱面代数分解为例说明了符号计算技术在SMT求解中的潜力和障碍。

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

查看原文本刊更多论文

Symbolic Computation Techniques in Satisfiability Checking

Satisfiability Checking is a relatively young research area, aiming at the development of efficient software technologies for checking the satisfiability of existentially quantified logical formulas. Besides the success story of SAT solving for propositional logic, SAT-modulo-theories (SMT) solvers offer sophisticated solutions for different theories. When targeting arithmetic theories, SMT solvers also make use of decision procedures rooted in Symbolic Computation. In this paper we give a brief introduction to SMT solving, discuss differences to Symbolic Computation, and illustrate the potentials and obstacles for embedding Symbolic Computation techniques in SMT solving on the example of the Cylindrical Algebraic Decomposition.

求助全文

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

来源期刊

2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

自引率

0.00%

发文量