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

17 papers

cs.PL2025

Optimized Execution of FreeCHR

Sascha Rechenberger, Thom Frühwirth

Constraint Handling Rules (CHR) is a rule-based programming language that rewrites collections of constraints. It is typically embedded into a general-purpose language. There exist…

cs.PL2025

An instance of FreeCHR with refined operational semantics

Sascha Rechenberger, Thom Frühwirth

Constraint Handling Rules (CHR) is a rule-based programming language which is typically embedded into a general-purpose language. There exists a plethora of implementations of CHR…

cs.PL2023

FreeCHR: An Algebraic Framework for CHR-Embeddings

Sascha Rechenberger, Thom Frühwirth

We introduce the framework FreeCHR which formalizes the embedding of Constraint Handling Rules (CHR) into a host language, using the concept of initial algebra semantics from categ…

cs.DC2018

Exploring Parallel Execution Strategies for Constraint Handling Rules - Work-in-Progress Report

Thom Frühwirth, Daniel Gall

Constraint Handling Rules (CHR) is a declarative rule-based formalism and language. Concurrency is inherent as rules can be applied to subsets of constraints in parallel. Parallel…

cs.CG2018

Rule-Based Drawing, Analysis and Generation of Graphs for Mason's Mark Design

Thom Fruehwirth

We are developing a rule-based implementation of a tool to analyse and generate graphs. It is currently used in the domain of mason's marks. For thousands of years, stonemasons hav…

cs.LO2018

Confluence Modulo Equivalence with Invariants in Constraint Handling Rules

Daniel Gall, Thom Frühwirth

Confluence denotes the property of a state transition system that states can be rewritten in more than one way yielding the same result. Although it is a desirable property, conflu…

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…

cs.LO2014

The P-Box CDF-Intervals: Reliable Constraint Reasoning with Quantifiable Information

Aya Saad, Thom Fruehwirth, Carmen Gervet

This paper introduces a new constraint domain for reasoning about data with uncertainty. It extends convex modeling with the notion of p-box to gain additional quantifiable informa…

cs.DB2014★ 2 cited

From XML Schema to JSON Schema: Translation with CHR

Falco Nogatz, Thom Frühwirth

Despite its rising popularity as data format especially for web services, the software ecosystem around the JavaScript Object Notation (JSON) is not as widely distributed as that o…

cs.AI2014

Exchanging Conflict Resolution in an Adaptable Implementation of ACT-R

Daniel Gall, Thom Frühwirth

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…

cs.PL2010★ 1 cited

Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction

Hariolf Betz, Thom W. Frühwirth

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…