Subterm contextual rewriting

Christoph Weidenbach; Patrick Wischnewski

首页> 外文期刊>AI communications >Subterm contextual rewriting

【24h】

Subterm contextual rewriting

机译：子语境上下文重写

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

Sophisticated reductions are an important means to achieve progress in automated theorem proving. We consider the powerful reduction rule Contextual Rewriting in connection with the superposition calculus. If considered in its most general form the applicability of contextual rewriting is not decidable. We develop an instance of contextual rewriting where applicability becomes decidable while preserving a great deal of its simplification power. A sophisticated implementation of the rule in Spass reveals its application potential. Our contextual rewriting instance called subterm contextual rewriting is feasible in the sense that it can be executed on the overall TPTP resulting in a gain of solved problems and new solutions to a number of problems that could not be solved by theorem provers so far.

机译：复杂的约简是在自动定理证明中取得进展的重要手段。我们考虑与叠加演算相关的强大归约规则“上下文重写”。如果以其最一般的形式考虑，上下文重写的适用性是不确定的。我们开发了一个上下文重写的实例，该实例的适用性是可决定的，同时保留了其大量的简化功能。 Spass中规则的复杂实现显示了其应用潜力。我们的上下文重写实例称为子术语上下文重写，从某种意义上讲是可行的，因为它可以在整个TPTP上执行，从而获得了已解决的问题以及针对迄今为止定理证明无法解决的许多问题的新解决方案。

著录项

来源
《AI communications》 |2010年第3期|p.97-109|共13页
作者
Christoph Weidenbach; Patrick Wischnewski;
展开▼
作者单位

Max Planck Institute for Informatics, Campus E 1.4, Saarbruecken, Germany;

rnMax Planck Institute for Informatics, Campus E 1.4, Saarbruecken, Germany;

展开▼
收录信息美国《科学引文索引》(SCI);美国《工程索引》(EI);
原文格式 PDF
正文语种 eng
中图分类
关键词
automated theorem proving; rewriting;

机译：自动定理证明;改写;

相似文献

外文文献
中文文献
专利

1. More on Graph Rewriting With Contextual Refinement [J] . Berthold Hoffmann Electronic Communications of the EASST . 2015,第11期

机译：有关通过上下文优化进行图重写的更多信息
2. Graph Rewriting with Contextual Refinement [J] . Berthold Hoffmann Electronic Communications of the EASST . 2013,第1期

机译：具有上下文细化的图重写
3. Further Results on Contextual and Rewriting P Systems [J] . Shankara Narayanan Krishna, R. Rama, H. Ramesh Fundamenta Informaticae . 2005,第1a4期

机译：上下文和重写P系统的进一步结果
4. Inductive Reasoning with Equality Predicates,Contextual Rewriting and Variant-Based Simplification [C] . Jose Meseguer, Stephen Skeirik International Workshop on Rewriting Logic and its Applications . 2020

机译：平等谓词的归纳推理，上下文重写和基于变种的简化
5. The Protestant Quest for Contextualized Hymnology in Twentieth Century China: A Case Study of the Collaboration Between T. C. Chao and Bliss Wiant in the Contextualization of Chinese Hymns. [D] . Chen, Ruiwen. 2014

机译：在20世纪中国的新教徒对语境化赞美诗的追求中：赵超和Bliss Wiant在中国赞美诗语境化中的合作案例研究。
6. Rewriting the human genome rewriting human rights law? Human rights human dignity and human germline modification in the CRISPR era [O] . Britta C van Beers 2020

机译：重写人类基因组重写人权法？克里普尔特时代的人权人权人体尊严和人种种系改性
7. A Reconstruction and Extension of Maple's Assume Facility via Constraint Contextual Rewriting. [O] . A. ARMANDO, BALLARIN C. 2005

机译：通过约束上下文重写重构和扩展Maple的假设功能。
8. Within ARM's (Abstract Rewriting Machine's) Reach: Compilation of Left-Linear Rewrite Systems Via Minimal Rewrite Systems; Software engineering rept [R] . Fokkink, W. J., Kamperman, J. F. T., Walters, H. R. 1997

机译：在aRm（抽象重写机）的范围内：通过最小重写系统编译左线性重写系统;软件工程部

Subterm contextual rewriting

摘要

著录项

相似文献

相关主题

期刊订阅