量化约束处理规则
Quantified Constraint Handling Rules
摘要：
通过启用动态绑定器和访问用户定义的约束，我们将QCSP（量化约束满足问题）框架转换为QSTO（量化约束处理规则）框架。QCSP提供了一个自然的框架来表达PSPACE问题作为有限的两个玩家的游戏。但是要定义QCSP模型，绑定器必须是以前已知的，即使最坏的情况不会发生，也不能动态地构建。为了克服这个问题，我们定义了新的Qingdom的形式主义，允许动态地建立在解决绑定器。我们的QCSP模型表现出最先进的性能静态粘结剂和优于以前的QCSP方法时，粘结剂是动态的。
英文摘要：
We shift the QCSP (Quantified Constraint Satisfaction Problems) framework to the QCHR (Quantified Constraint Handling Rules) framework by enabling dynamic binder and access to user-defined constraints. QCSP offers a natural framework to express PSPACE problems as finite two-players games. But to define a QCSP model, the binder must be formerly known and cannot be built dynamically even if the worst case won't occur. To overcome this issue, we define the new QCHR formalism that allows to build the binder dynamically during the solving. Our QCHR models exhibit state-of-the-art performances on static binder and outperforms previous QCSP approaches when the binder is dynamic.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
