逻辑算法满足CHR：具有规则优先级的约束处理规则的元复杂性结果
Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities
摘要：
本文研究了Ganzinger和McAllester的逻辑算法语言（LA）与约束处理规则（REQ）之间的关系。我们提出了一个从LA到CHR-rp的翻译模式：具有规则优先级的LLP，并证明了LA的元复杂性定理可以通过逆翻译应用于CHR-rp的子集。受Ganzinger和McAllester的逻辑算法的高级实现建议的启发，并基于一种新的调度算法，我们提出了一种替代实现CHR-rp，提供了强大的复杂性保证，并导致CHR-rp的一个新的和准确的元复杂性定理。进一步表明，从逻辑算法到CHR-rp的转换与新的CHR-rp实现相结合，满足逻辑算法元复杂性结果所需的复杂性。
英文摘要：
This paper investigates the relationship between the Logical Algorithms language (LA) of Ganzinger and McAllester and Constraint Handling Rules (CHR). We present a translation schema from LA to CHR-rp: CHR with rule priorities, and show that the meta-complexity theorem for LA can be applied to a subset of CHR-rp via inverse translation. Inspired by the high-level implementation proposal for Logical Algorithm by Ganzinger and McAllester and based on a new scheduling algorithm, we propose an alternative implementation for CHR-rp that gives strong complexity guarantees and results in a new and accurate meta-complexity theorem for CHR-rp. It is furthermore shown that the translation from Logical Algorithms to CHR-rp combined with the new CHR-rp implementation, satisfies the required complexity for the Logical Algorithms meta-complexity result to hold.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
