由初等推理系统定义的计算的语义性质
Semantic Properties of Computations Defined by Elementary Inference Systems
AI总结:
该研究针对初等推理系统定义的计算的语义性质,提出借助其任意一阶模型的可满足性来(否)证性质的方法,可应用于编程语言及重写系统等的性质分析。
摘要:
我们研究由*初等推理系统(Elementary Inference Systems)*I定义的集合/关系/计算,这类系统是从Smullyan的*初等形式系统(elementary formal systems)*出发,采用Gentzen的推理规则表示法,以及原子P(t_1,...,t_n)的证明树构建而成,其中谓词P代表所研究的集合/关系/计算。我们为I赋予一阶理论Th(I),它实际上是一组确定霍恩子句(definite Horn clauses)。由I定义的对象的性质被表示为一阶语句F,通过F在Th(I)的*典范*模型M中的*满足性*M |= F,可证明F为真或为假,因此我们将F称为I的*语义性质*。由于典范模型通常是不可计算的,我们展示了如何通过Th(I)的*任意*模型A中的可满足性来(否)证语义性质。我们将这些思路应用于编程语言与系统的性质分析,这类系统的计算可通过初等推理系统描述,尤其是基于重写的系统。
英文摘要:
We consider sets/relations/computations defined by *Elementary Inference Systems* I, which are obtained from Smullyan's *elementary formal systems* using Gentzen's notation for inference rules, and proof trees for atoms P(t_1,...,t_n), where predicate P represents the considered set/relation/computation. A first-order theory Th(I), actually a set of definite Horn clauses, is given to I. Properties of objects defined by I are expressed as first-order sentences F, which are proved true or false by *satisfaction* M |= F of F in a *canonical* model M of Th(I). For this reason, we call F a *semantic property* of I. Since canonical models are, in general, incomputable, we show how to (dis)prove semantic properties by satisfiability in an *arbitrary* model A of Th(I). We apply these ideas to the analysis of properties of programming languages and systems whose computations can be described by means of an elementary inference system. In particular, rewriting-based systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。