In computational cognitive science, the cognitive architecture ACT-R is very
popular. It describes a model of cognition that is amenable to computer
implementation, paving the way for computational psychology. Its underlying
psychological theory has been investigated in many psychological experiments,
but ACT-R lacks a formal definition of its underlying concepts from a
mathematical-computational point of view. Although the canonical implementation
of ACT-R is now modularized, this production rule system is still hard to adapt
and extend in central components like the conflict resolution mechanism (which
decides which of the applicable rules to apply next).
In this work, we present a concise implementation of ACT-R based on
Constraint Handling Rules which has been derived from a formalization in prior
work. To show the adaptability of our approach, we implement several different
conflict resolution mechanisms discussed in the ACT-R literature. This results
in the first implementation of one such mechanism. For the other mechanisms, we
empirically evaluate if our implementation matches the results of reference
implementations of ACT-R.

本文介绍了一种基于约束处理规则的 ACT-R 认知架构的简洁实现，并实现了 ACT-R 中多个不同的冲突解决机制，是第一个实现其中一种机制的文章，文章还对比了其他机制的参考实现的结果。

可适应的 ACT-R 实现中的冲突解决交换

Exchanging Conflict Resolution in an Adaptable Implementation of ACT-R

Constraint Handling Rules (CHR) is a declarative committed-choice programming
language with a strong relationship to linear logic. Its generalization CHR
with Disjunction (CHRv) is a multi-paradigm declarative programming language
that allows the embedding of horn programs. We analyse the assets and the
limitations of the classical declarative semantics of CHR before we motivate
and develop a linear-logic declarative semantics for CHR and CHRv. We show how
to apply the linear-logic semantics to decide program properties and to prove
operational equivalence of CHRv programs across the boundaries of language
paradigms.

本文关注 Constraint Handling Rules（CHR）及其拓展 CHRv 的声明式语言，分析其经典的声明式语义的优缺点，提出并开发基于线性逻辑的声明式语义，探讨如何将其应用于决定程序属性和证明跨语言范式的 CHRv 程序的运行等价性。

基于线性逻辑的包含析取的约束处理规则分析

Linear-Logic Based Analysis of Constraint Handling Rules with  Disjunction

FLUX is a programming method for the design of agents that reason logically
about their actions and sensor information in the presence of incomplete
knowledge. The core of FLUX is a system of Constraint Handling Rules, which
enables agents to maintain an internal model of their environment by which they
control their own behavior. The general action representation formalism of the
fluent calculus provides the formal semantics for the constraint solver. FLUX
exhibits excellent computational behavior due to both a carefully restricted
expressiveness and the inference paradigm of progression.

FLUX 使用约束处理规则系统对代理进行编程，使其能够在不完整知识的情况下合理地推理其行为和传感器信息，并通过表达式演算法提供形式语义学。由于限制表达的准确性和升级推理范式，FLUX 表现出优秀的计算行为。