Person: Thom W. Frühwirth

DBLP: Fr=uuml=hwirth:Thom_W=

Contributed to:

2015

2014

2014

2013

2012

2010

2007

2006

2005

2004

2003

2002

2002

2001

2001

1999

1999

1994

1993

1991

1991

Wrote 24 papers:

PPDP-2015-Fruhwirth #recursion #termination

A devil’s advocate against termination of direct recursion (TWF), pp. 103–113.

PPDP-2015-GallF #formal method #semantics

A refined operational semantics for ACT-R: investigating the relations between different ACT-R formalizations (DG, TWF), pp. 114–124.

ICLP-J-2014-GallF #adaptation #implementation

Exchanging Conflict Resolution in an Adaptable Implementation of ACT-R (DG, TWF), pp. 525–538.

ICLP-J-2014-SaadFG #constraints #reasoning #reliability

The P-Box CDF-Intervals: A Reliable Constraint Reasoning with Quantifiable Information (AS, TWF, CG), pp. 461–475.

LOPSTR-2014-GallF #architecture #semantics

A Formal Semantics for the Cognitive Architecture ACT-R (DG, TWF), pp. 74–91.

LOPSTR-2014-SharafAF #animation #constraints #named

CHRAnimation: An Animation Tool for Constraint Handling Rules (NS, SA, TWF), pp. 92–110.

ICLP-J-2013-SneyersSF #probability #reasoning

Probabilistic legal reasoning in CHRiSM (JS, DDS, TWF), pp. 769–781.

PPDP-2012-TriossiORF #compilation #hardware #parallel

Compiling CHR to parallel hardware (AT, SO, AR, TWF), pp. 173–184.

ICLP-J-2010-BetzRF #constraints #execution

A complete and terminating execution model for Constraint Handling Rules (HB, FR, TWF), pp. 597–610.

SAC-2007-DjelloulDF #constraints #finite #first-order #infinity #prolog #theorem proving #towards #unification #using

Toward a first-order extension of Prolog’s unification using CHR: a CHR first-order constraint solver over finite or infinite trees (KD, TBHD, TWF), pp. 58–64.

PPDP-2006-Fruhwirth #constraints

Constraint handling rules: the story so far (TWF), pp. 13–14.

ICLP-2005-Fruhwirth #analysis #confluence #constraints #using

Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis (TWF), pp. 113–127.

LOPSTR-2004-Fruhwirth #concurrent #multi

Specialization of Concurrent Guarded Multi-set Transformation Rules (TWF), pp. 133–148.

LOPSTR-2003-AbdennadherF #constraints #integration #optimisation #rule-based #theorem proving

Integration and Optimization of Rule-Based Constraint Solvers (SA, TWF), pp. 198–213.

KR-2002-Fruhwirth #analysis #automation #complexity

As Time Goes by: Automatic Complexity Analysis of Simplified Rules (TWF), pp. 547–557.

SAC-2002-BistarelliFM #constraints

Soft constraint propagation and solving in CHRs (SB, TWF, MM), pp. 1–5.

PADL-2001-RaffaetaF #constraints #logic programming

Spatio-temporal Annotated Constraint Logic Programming (AR, TWF), pp. 259–273.

QAPL-2001-Fruhwirth #analysis #automation #complexity #concurrent #source code

As Time Goes By II: More Automatic Complexity Analysis of Concurrent Rule Programs (TWF), pp. 185–206.

ICLP-1999-CiarliniF #execution #hybrid #symbolic computation

Symbolic Execution for the Derivation of Meaningful Properties of Hybrid Systems (AEMC, TWF), p. 606.

PPDP-1999-HolzbaurF #compilation #constraints #prolog

Compiling Constraint Handling Rules into Prolog with Attributed Variables (CH, TWF), pp. 117–133.

PLILP-1994-Fruhwirth #constraints #logic programming #reasoning

Annotated Constraint Logic Programming Applied to Temporal Reasoning (TWF), pp. 230–243.

ICLP-1993-Fruhwirth #constraints

User-Defined Constraint Handling (TWF), pp. 837–838.

ICLP-1991-YardeniFS #logic programming #source code

Polymorphically Typed Logic Programs (EY, TWF, EYS), pp. 379–393.

LICS-1991-FruhwirthSVY #logic programming #source code

Logic Programs as Types for Logic Programs (TWF, EYS, MYV, EY), pp. 300–309.