IU421 发表于 2025-3-21 16:18:45
书目名称Logic-Based Program Synthesis and Transformation影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0588100<br><br> <br><br>书目名称Logic-Based Program Synthesis and Transformation影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0588100<br><br> <br><br>书目名称Logic-Based Program Synthesis and Transformation网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0588100<br><br> <br><br>书目名称Logic-Based Program Synthesis and Transformation网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0588100<br><br> <br><br>书目名称Logic-Based Program Synthesis and Transformation被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0588100<br><br> <br><br>书目名称Logic-Based Program Synthesis and Transformation被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0588100<br><br> <br><br>书目名称Logic-Based Program Synthesis and Transformation年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0588100<br><br> <br><br>书目名称Logic-Based Program Synthesis and Transformation年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0588100<br><br> <br><br>书目名称Logic-Based Program Synthesis and Transformation读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0588100<br><br> <br><br>书目名称Logic-Based Program Synthesis and Transformation读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0588100<br><br> <br><br>Axillary 发表于 2025-3-21 21:32:35
http://reply.papertrans.cn/59/5881/588100/588100_2.pngeulogize 发表于 2025-3-22 03:48:18
http://reply.papertrans.cn/59/5881/588100/588100_3.png厚颜 发表于 2025-3-22 05:10:59
http://reply.papertrans.cn/59/5881/588100/588100_4.png使闭塞 发表于 2025-3-22 11:02:40
http://reply.papertrans.cn/59/5881/588100/588100_5.pngAGONY 发表于 2025-3-22 16:16:10
Specialising Finite Domain Programs Using Polyhedradividual finite domain constraints are over-approximated by polyhedra to describe the solution space over . integer variables as an . dimensional polyhedron. This polyhedron is then approximated, using projection, as an . dimensional bounding box that can be used to specialise and improve the domaininstallment 发表于 2025-3-22 19:43:17
http://reply.papertrans.cn/59/5881/588100/588100_7.pngBlemish 发表于 2025-3-22 22:20:54
Transformation of Left Terminating Programsxtends our previous proposal in by allowing to switch the atoms in the clause bodies when a specific applicability condition is satisfied. The applicability condition is very simple to verify, yet very common in practice. We also discuss how to verify such condition by exploiting mode informHEAVY 发表于 2025-3-23 03:47:42
http://reply.papertrans.cn/59/5881/588100/588100_9.pngTEM 发表于 2025-3-23 07:17:21
Making Mercury Programs Tail Recursiveing them before the recursive call, modifying them as necessary. The first optimization moves calls to associative predicates; it is a pure source to source transformation. The second optimization moves construction unifications; it required extensions to the mode system (to record aliases) and to t