activity
20102025
most citedFrom XML Schema to JSON Schema: Translation with CHR

2 citations · 3 across the 17 of their papers we have counts for

collaborators
Showing 2017Show all

7 papers · 1 filter

cs.SE2017

Visualization of Constraint Handling Rules: Semantics and Applications

Nada Sharaf, Slim Abdennadher, Thom Frühwirth

The work in the paper presents an animation extension () to Constraint Handling Rules (CHR). Visualizations have always helped programmers understand data and debug prog…

cs.AI2017

Justifications in Constraint Handling Rules for Logical Retraction in Dynamic Algorithms

Thom Fruehwirth

We present a straightforward source-to-source transformation that introduces justifications for user-defined constraints into the CHR programming language. Then a scheme of two rul…

cs.LO2017

A Decidable Confluence Test for Cognitive Models in ACT-R

Daniel Gall, Thom Frühwirth

Computational cognitive modeling investigates human cognition by building detailed computational models for cognitive processes. Adaptive Control of Thought - Rational (ACT-R) is a…

cs.LO2017

An Operational Semantics for the Cognitive Architecture ACT-R and its Translation to Constraint Handling Rules

Daniel Gall, Thom Frühwirth

Computational psychology has the aim to explain human cognition by computational models of cognitive processes. The cognitive architecture ACT-R is popular to develop such models.…

cs.PL2017

A Devil's Advocate against Termination of Direct Recursion

Thom Fruehwirth

A devil's advocate is one who argues against a claim, not as a committed opponent but in order to determine the validity of the claim. We are interested in a devil's advocate that…

cs.PL2017

Constraint Handling Rules - What Else?

Thom Fruehwirth

Constraint Handling Rules (CHR) is both an effective concurrent declarative constraint-based programming language and a versatile computational formalism. While conceptually simple…

cs.PL2017

Why Can't You Behave? Non-termination Analysis of Direct Recursive Rules with Constraints

Thom Fruehwirth

This paper is concerned with rule-based programs that go wrong. The unwanted behavior of rule applications is non-termination or failure of a computation. We propose a static progr…