• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>urnal of Symbolic Computation >On using ground joinable equations in equational theorem proving
【24h】

On using ground joinable equations in equational theorem proving

机译：在方程定理证明中使用地面可连接方程

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

When rewriting and completion techniques are used for equational theorem proving, the axiom set is saturated with the aim to get a rewrite system that is terminating and confluent on ground terms. To reduce the computational effort it should (1) be powerful for rewriting and (2) create not too many critical pairs. These problems become especially important if some operators are associative and commutative (AC). We show in this paper how these two goals can be reached to some extent by using ground joinable equations for simplification purposes and omitting them from the generation of new facts. For the special case of AC-operators we present a simple redundancy criterion which is easy to implement, efficient, and effective in practice, leading to significant speed-ups.
机译：当将重写和完成技术用于方程式定理证明时，公理集趋于饱和，其目的是获得一个终止且汇合于地面项的重写系统。为了减少计算量，应该（1）强大的重写能力（2）创建的关键对不太多。如果某些算子是关联和可交换的（AC），这些问题就变得尤为重要。我们在本文中展示了如何通过使用地面可联结方程简化目的并将其从新事实的生成中省略，从而在某种程度上可以实现这两个目标。对于交流操作员的特殊情况，我们提出了一个简单的冗余标准，该标准易于实施，有效且在实践中有效，从而可显着提高速度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利