Titlebook: Computational Aspects of an Order-Sorted Logic with Term Declarations; M. Schmidt-Schauß Book 1989 Springer-Verlag Berlin Heidelberg 1989

Magnanimous

书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations影响因子(影响力)




书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations影响因子(影响力)学科排名




书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations网络公开度




书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations网络公开度学科排名




书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations被引频次




书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations被引频次学科排名




书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations年度引用




书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations年度引用学科排名




书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations读者反馈




书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations读者反馈学科排名

迅速成长

场所

Unification of uninterpreted sorted terms,e show that for elementary, regular signatures Σ-unification is decidable and finitary. In the general case when we have signatures with term declarations, unification is undecidable and infinitary. We also determine the unification behaviour under certain restrictions such as linearity..Throughout

乐器演奏者

gerrymander

Sorted resolution-based calculi,otkin‘s resolution with built-in equational theories, J. Morris‘ E-resolution and M. Stickels theory resolution. We show that the completeness results that hold in the unsorted case or in the case of simple signatures [Wa83] hold also in the presence of term delarations. The results concerning the f

缩影

缩影

978-3-540-51705-4Springer-Verlag Berlin Heidelberg 1989

MURAL

滔滔不绝地说

Hdl348

Precision Elastic Structures Developmentlgorithms as a set of transformation rules for equational systems. Second we give an algorithm that solves unification problems by first ignoring the sort information using an unsorted algorithm and as a second step computes well-sorted instantiations.