首页> 外文会议>International Colloquium on Theoretical Aspects of Computing >Nelson-Oppen, Shostak and the Extended Canonizer: A Family Picture with a Newborn
【24h】

Nelson-Oppen, Shostak and the Extended Canonizer: A Family Picture with a Newborn

机译:尼尔森对手,夏斯塔克和延长的山康机:与新生儿的家庭照片

获取原文

摘要

We consider the problem of building satisfiability procedures for unions of disjoint theories. We briefly review the combination schemas proposed by Nelson-Oppen, Shostak, and others. Three inference systems are directly derived from the properties satisfied by the theories being combined and known results from the literature are obtained in a uniform and abstract way. This rational reconstruction is the starting point for further investigations. We introduce the concept of extended canonizer and derive a modularity result for a new class of theories (larger than Shostak and smaller than Nelson-Oppen theories) which is closed under disjoint union. This is in contrast with the lack of modularity of Shostak theories. We also explain how to implement extended canonizers by using the basic building blocks used in Shostak schema or by means of rewriting techniques.
机译:我们考虑建立一个禁用理论的起薪程序的问题。我们简要介绍了尼尔森对立,Shostak等的组合模式。三种推理系统直接来自满足所合并的理论的性质,并且以统一和抽象的方式获得文献的已知结果。这种合理的重建是进一步调查的起点。我们介绍了扩展典范的概念,并导出了新的理论(比Shostak大于Shostak和小于纳尔逊对象理论)的模块化结果,这在不相交的联合下关闭。与雪铁酸基理论的模块化缺乏相比,这与缺乏模块化相反。我们还解释了如何通过使用Shostak模式或通过重写技术使用基本构建块来实现扩展的Canonizers。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号