Magnanimous
发表于 2025-3-21 18:15:59
书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0232122<br><br> <br><br>书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0232122<br><br> <br><br>书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0232122<br><br> <br><br>书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0232122<br><br> <br><br>书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0232122<br><br> <br><br>书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0232122<br><br> <br><br>书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0232122<br><br> <br><br>书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0232122<br><br> <br><br>书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0232122<br><br> <br><br>书目名称Computational Aspects of an Order-Sorted Logic with Term Declarations读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0232122<br><br> <br><br>
迅速成长
发表于 2025-3-21 23:12:07
http://reply.papertrans.cn/24/2322/232122/232122_2.png
场所
发表于 2025-3-22 04:25:09
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
乐器演奏者
发表于 2025-3-22 08:19:03
http://reply.papertrans.cn/24/2322/232122/232122_4.png
gerrymander
发表于 2025-3-22 10:12:33
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 hold also in the presence of term delarations. The results concerning the f
缩影
发表于 2025-3-22 14:31:11
http://reply.papertrans.cn/24/2322/232122/232122_6.png
缩影
发表于 2025-3-22 20:59:56
978-3-540-51705-4Springer-Verlag Berlin Heidelberg 1989
MURAL
发表于 2025-3-22 23:21:40
http://reply.papertrans.cn/24/2322/232122/232122_8.png
滔滔不绝地说
发表于 2025-3-23 04:42:10
http://reply.papertrans.cn/24/2322/232122/232122_9.png
Hdl348
发表于 2025-3-23 07:27:20
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.