论文标题
简化表达式方法的实验评估
Experimental Evaluation of a Method to Simplify Expressions
论文作者
论文摘要
我们提出了一种在方程理论的上下文中简化表达的方法。该方法的基本思想和概念先前已在其他地方介绍，但是在这里，我们解决了使其在实践中有效的艰巨任务，尽管它具有巨大的一般性。我们首先回想起一系列结构的概念，该概念使我们能够操纵非常大的（可能是无限）的整体术语，即不枚举其元素。然后，我们使用此工具来构建算法来简化表达式。我们给出了各种原因，为什么很难使这些算法精确有效。然后，我们提出了许多批准来解决提出的问题。最后，重要的是，我们提供了该方法的详细实验评估，并比较了它的几种变体。尽管该方法是完全通用的，但我们使用（任意两级）布尔表达式作为这些实验的应用程序字段，因为尽管问题的硬度很难，但仍可获得令人印象深刻的简化。
We present a method to simplify expressions in the context of an equational theory. The basic ideas and concepts of the method have been presented previously elsewhere but here we tackle the difficult task of making it efficient in practice, in spite of its great generality. We first recall the notion of a collection of structures, which allows us to manipulate very large (possibly infinite) sets of terms as a whole, i.e., without enumerating their elements. Then we use this tool to construct algorithms to simplify expressions. We give various reasons why it is difficult to make these algorithms precise and efficient. We then propose a number of approches to solve the raised issues. Finally, and importantly, we provide a detailed experimental evaluation of the method and a comparison of several variants of it. Although the method is completely generic, we use (arbitrary, not only two-level) boolean expressions as the application field for these experiments because impressive simplifications can be obtained in spite of the hardness of the problem.
