The aim of this invited talk is to discuss strengths, limitations and challenges around one of the simplest yet most powerful practical automated deduction formalisms, namely propositional SAT and its extensions. We will see some of the reasons why CDCL SAT solvers are so effective for finding solutions to so diverse real-world problems, using a single fully automatic push-button strategy, and, by extending them to SAT Modulo Theories (SMT), also to optimization problems and problems with complex (e.g., arithmetic) constraints for which a full encoding into SAT would be too large and/or inefficient. We will give some examples of trade-offs regarding full SAT encodings vs SMT theory solvers, and discuss why SAT and even SMT are just binary resolution strategies, the consequences of this fact, and possible ways to overcome it. Many aspects of the discussion carry over to first-order logic and beyond.
展开▼
机译：这邀请谈话的目的是讨论最简单又最强大的实际自动扣除形式主义之一的优势，局限和挑战，即命题坐在六位及其扩展。我们将看到CDCL SAT Solvers如此有效地找到解决方案，以便使用单个全自动按钮策略来查找解决方案的原因如此有效，并通过将它们扩展到Sat Modulo理论（SMT），以及优化问题和复杂（例如，算术）约束的问题和问题，其完全编码到SAT中太大和/或低效。我们将提供关于完整的SAT编码VS SMT理论求解器的权衡的一些示例，并讨论为什么SAT甚至SMT只是二进制解决策略，这一事实的后果，以及克服它的可能方法。讨论的许多方面涉及一阶逻辑及更远。
展开▼
