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影響因子(影響力)學(xué)科排名




書目名稱Computational Aspects of an Order-Sorted Logic with Term Declarations網(wǎng)絡(luò)公開(kāi)度




書目名稱Computational Aspects of an Order-Sorted Logic with Term Declarations網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書目名稱Computational Aspects of an Order-Sorted Logic with Term Declarations被引頻次




書目名稱Computational Aspects of an Order-Sorted Logic with Term Declarations被引頻次學(xué)科排名




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




書目名稱Computational Aspects of an Order-Sorted Logic with Term Declarations年度引用學(xué)科排名




書目名稱Computational Aspects of an Order-Sorted Logic with Term Declarations讀者反饋




書目名稱Computational Aspects of an Order-Sorted Logic with Term Declarations讀者反饋學(xué)科排名

迅速成長(zhǎng)

場(chǎng)所

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

樂(lè)器演奏者

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

滔滔不絕地說(shuō)

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.