Graph transformation systems in Constraint Handling Rules: improved methods for program analysis

Raiser, Frank

doi:10.18725/oparu-1742

Cited by 1 publication

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We define an equivalence relation over CHR states. Definition 6 (CHR state equivalence [11,12]). Let ρ := G; C; V and ρ := G ; C ; V be CHR states with local variables ȳ, ȳ that have been renamed apart.…”

Section: Definition 5 (Chr Program) a Chr Program Is A Finite Set Of ...mentioning

confidence: 99%

“…The operational semantics is now defined by the following transition scheme over equivalence classes of CHR states i.e. [ρ] := {ρ | ρ ≡ ρ} Definition 7 (operational semantics of CHR [11,12]). For a CHR program the state transition system over CHR states and the rule transition relation → is defined as the following transition scheme:…”

Section: Definition 5 (Chr Program) a Chr Program Is A Finite Set Of ...mentioning

confidence: 99%

“…The idea of the invariant-based confluence theorem for CHR is to extend all states where the invariant does not hold such that the invariant is repaired and include the extended states in the confluence test. Since in general there are infinitely many extensions that maintain the invariant, only minimal extensions according to a partial order defined in [11] have to be considered. Then, monotonicity can be applied again.…”

Section: Invariant-based Confluencementioning

confidence: 99%

“…In prior work, we presented a sound and complete embedding of ACT-R in CHR [9,8]. An invariant-based confluence test for CHR [6,11] is used to decide confluence of the translated models with invariants on CHR states that come from the abstract operational semantics of ACT-R. The confluence test identifies the rules that lead to non-confluence supporting the decision if a model has the desired behavior regarding competing strategies.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Decidable Confluence Test for Cognitive Models in ACT-R

Gall¹,

Frühwirth²

2017

Rules and Reasoning

View full text Add to dashboard Cite

Abstract. Computational cognitive modeling investigates human cognition by building detailed computational models for cognitive processes. Adaptive Control of Thought -Rational (ACT-R) is a rule-based cognitive architecture that offers a widely employed framework to build such models. There is a sound and complete embedding of ACT-R in Constraint Handling Rules (CHR). Therefore analysis techniques from CHR can be used to reason about computational properties of ACT-R models. For example, confluence is the property that a program yields the same result for the same input regardless of the rules that are applied. In ACT-R models, there are often cognitive processes that should always yield the same result while others e.g. implement strategies to solve a problem that could yield different results. In this paper, a decidable confluence criterion for ACT-R is presented. It allows to identify ACT-R rules that are not confluent. Thereby, the modeler can check if his model has the desired behavior. The sound and complete translation of ACT-R to CHR from prior work is used to come up with a suitable invariant-based confluence criterion from the CHR literature. Proper invariants for translated ACT-R models are identified and proven to be decidable. The presented method coincides with confluence of the original ACT-R models.

show abstract

Section: Definition 5 (Chr Program) a Chr Program Is A Finite Set Of ...mentioning

confidence: 99%

Section: Definition 5 (Chr Program) a Chr Program Is A Finite Set Of ...mentioning

confidence: 99%

Section: Invariant-based Confluencementioning

confidence: 99%