A Survey on Applications of Quantified Boolean Formulas
2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)(2019)
摘要
The decision problem of quantified Boolean formulas (QBFs) is the archetypical problem for the complexity class PSPACE. Beside such theoretical aspects QBF also provides an attractive framework for encoding and solving various application problems ranging from symbolic reasoning in artificial intelligence to the formal verification and synthesis of computing systems. In this paper, we survey the different application areas that exploit QBF technology for solving their specific problems.
更多查看译文
关键词
Satisfiability,SAT Applications,QBF
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要