Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Thom W. Frühwirth
2010 – today
- 2013
[j22]Hariolf Betz, Thom W. Frühwirth: Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction. ACM Trans. Comput. Log. 14(1): 1 (2013)- 2012
[c40]Andrea Triossi, Salvatore Orlando, Alessandra Raffaetà, Thom W. Frühwirth: Compiling CHR to parallel hardware. PPDP 2012: 173-184- 2011
[j21]Frank Raiser, Thom W. Frühwirth: Analysing graph transformation systems through constraint handling rules. TPLP 11(1): 65-109 (2011)- 2010
[j20]Hariolf Betz, Frank Raiser, Thom W. Frühwirth: A complete and terminating execution model for Constraint Handling Rules. TPLP 10(4-6): 597-610 (2010)
[i6]Frank Raiser, Thom W. Frühwirth: Analyzing Graph Transformation Systems through Constraint Handling Rules. CoRR abs/1006.1497 (2010)
[i5]Hariolf Betz, Frank Raiser, Thom W. Frühwirth: A Complete and Terminating Execution Model for Constraint Handling Rules. CoRR abs/1007.3829 (2010)
[i4]Hariolf Betz, Thom W. Frühwirth: Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction. CoRR abs/1009.2900 (2010)
2000 – 2009
- 2009
[j19]Frank Raiser, Thom W. Frühwirth: Strong Joinability Analysis for Graph Transformation Systems in CHR. Electr. Notes Theor. Comput. Sci. 253(4): 91-111 (2009)- 2008
[j18]Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Frühwirth: Theory of finite or infinite trees revisited. TPLP 8(4): 431-489 (2008)
[p2]
[e3]Tom Schrijvers, Thom W. Frühwirth (Eds.): Constraint Handling Rules, Current Research Topics. Lecture Notes in Computer Science 5388, Springer 2008, ISBN 978-3-540-92242-1- 2007
[c39]Thom W. Frühwirth: Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR. CSCLP 2007: 91-108
[c38]Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Frühwirth: Toward a first-order extension of Prolog's unification using CHR: a CHR first-order constraint solver over finite or infinite trees. SAC 2007: 58-64
[i3]Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Frühwirth: Theory of Finite or Infinite Trees Revisited. CoRR abs/0706.4323 (2007)- 2006
[j17]Tom Schrijvers, Bart Demoen, Gregory J. Duck, Peter J. Stuckey, Thom W. Frühwirth: Automatic Implication Checking for CHR Constraints. Electr. Notes Theor. Comput. Sci. 147(1): 93-111 (2006)
[j16]Tom Schrijvers, Thom W. Frühwirth: Optimal union-find in Constraint Handling Rules. TPLP 6(1-2): 213-224 (2006)
[c37]Marc Meister, Khalil Djelloul, Thom W. Frühwirth: Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees. CSCLP 2006: 139-153
[c36]- 2005
[j15]Slim Abdennadher, Thom W. Frühwirth, Christian Holzbaur: Introduction to the Special Issue on Constraint Handling Rules. TPLP 5(4-5): 401-402 (2005)
[c35]Hariolf Betz, Thom W. Frühwirth: A Linear-Logic Semantics for Constraint Handling Rules. CP 2005: 137-151
[c34]Thom W. Frühwirth: Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains. CSCLP 2005: 14-28
[c33]Thom W. Frühwirth: Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis. ICLP 2005: 113-127
[c32]Tom Schrijvers, Thom W. Frühwirth: Analysing the CHR Implementation of Union-Find. W(C)LP 2005: 135-146
[e2]Armin Wolf, Thom W. Frühwirth, Marc Meister (Eds.): 19th Workshop on (Constraint) Logic Programming, Ulm, Germany, February 21-23, 2005. Ulmer Informatik-Berichte 2005-01, Universität Ulm, Germany 2005
[i2]Tom Schrijvers, Thom W. Frühwirth: Optimal Union-Find in Constraint Handling Rules. CoRR abs/cs/0501073 (2005)- 2004
[j14]Stefano Bistarelli, Thom W. Frühwirth, Michael Marte, Francesca Rossi: Soft Constraint Propagation and Solving in Constraint Handling Rules. Computational Intelligence 20(2): 287-307 (2004)
[c31]Thom W. Frühwirth: Specialization of Concurrent Guarded Multi-set Transformation Rules. LOPSTR 2004: 133-148
[e1]Susanne Biundo, Thom W. Frühwirth, Günther Palm (Eds.): KI 2004: Advances in Artificial Intelligence, 27th Annual German Conference on AI, KI 2004, Ulm, Germany, September 20-24, 2004, Proceedings. Lecture Notes in Computer Science 3238, Springer 2004, ISBN 3-540-23166-8
[i1]Thom W. Frühwirth, Slim Abdennadher: The Munich Rent Advisor: A Success for Logic Programming on the Internet. CoRR cs.AI/0402019 (2004)- 2003
[b2]Thom W. Frühwirth, Slim Abdennadher: Essentials of constraint programming. Cognitive Technologies, Springer 2003, ISBN 978-3-540-67623-2, pp. I-IX, 1-144
[c30]Thom W. Frühwirth, Christian Holzbaur: Source-to-Source Transformation for a Class of Expressive Rules. APPIA-GULP-PRODE 2003: 386-397
[c29]Slim Abdennadher, Thom W. Frühwirth: Integration and Optimization of Rule-Based Constraint Solvers. LOPSTR 2003: 198-213- 2002
[j13]Peggy S. Eaton, Thom W. Frühwirth, Milind Tambe: Special Issue on Constraint Agents. Constraints 7(1): 5-6 (2002)
[j12]Thom W. Frühwirth, Alessandra Di Pierro, Herbert Wiklicky: Probabilistic Constraint Handling Rules. Electr. Notes Theor. Comput. Sci. 76: 115-130 (2002)
[c28]Thom W. Frühwirth, Slim Abdennadher: Tutorial: Reasoning with, about and for Constraint Handling Rules. FroCoS 2002: 192
[c27]Slim Abdennadher, Thom W. Frühwirth: Using Program Analysis for Integration and Optimization of Rule-based Constraint Solvers. JFPLC 2002: 257-
[c26]Thom W. Frühwirth: As Time Goes by: Automatic Complexity Analysis of Simplified Rules. KR 2002: 547-557
[c25]Stefano Bistarelli, Thom W. Frühwirth, Michael Marte: Soft constraint propagation and solving in CHRs. SAC 2002: 1-5- 2001
[j11]Thom W. Frühwirth: On the number of rule applications in constraint programs. Electr. Notes Theor. Comput. Sci. 48: 147-166 (2001)
[j10]Thom W. Frühwirth: As Time Goes By II: More Automatic Complexity Analysis of Concurrent Rule Programs. Electr. Notes Theor. Comput. Sci. 59(3): 185-206 (2001)
[j9]Thom W. Frühwirth, Slim Abdennadher: The Munich Rent Advisor: A Success for Logic Programming on the Internet. TPLP 1(3): 303-319 (2001)
[c24]Alessandra Raffaetà, Thom W. Frühwirth: Spatio-temporal Annotated Constraint Logic Programming. PADL 2001: 259-273- 2000
[j8]Christian Holzbaur, Thom W. Frühwirth: Guest Editorial. Applied Artificial Intelligence 14(4): 309-310 (2000)
[j7]Christian Holzbaur, Thom W. Frühwirth: A PROLOG Constraint Handling Rules Compiler and Runtime System. Applied Artificial Intelligence 14(4): 369-388 (2000)
[j6]Thom W. Frühwirth, Pascal Brisset: Placing Base Stations in Wireless Indoor Communication Networks. IEEE Intelligent Systems 15(1): 49-53 (2000)
[c23]Thom W. Frühwirth: Predicting Derivation Lengths in Rule-based Constraint Programs. JFPLC 2000: 89-108
[c22]Slim Abdennadher, Thom W. Frühwirth: Definition von angepaßten Constraint-Solvern mit Constraint-Handling-Rules. WLP 2000: 15
1990 – 1999
- 1999
[j5]Slim Abdennadher, Thom W. Frühwirth, Holger Meuss: Confluence and Semantics of Constraint Simplification Rules. Constraints 4(2): 133-165 (1999)
[c21]Thom W. Frühwirth: Proving Termination of Constraint Solver Programs. New Trends in Constraints 1999: 298-317
[c20]Slim Abdennadher, Thom W. Frühwirth: Operational Equivalence of CHR Programs and Constraints. CP 1999: 43-57
[c19]Luis Mandel, Marcelo Campo, Analía Amandi, Thom W. Frühwirth, Bernd Meyer, Slim Abdennadher, Bernhard Bauer: JACK - Java Constraint Kit. German-Argentinian Workshop on Information Technology 1999: 47-58
[c18]Angelo E. M. Ciarlini, Thom W. Frühwirth: Symbolic Execution for the Derivation of Meaningful Properties of Hybrid Systems. ICLP 1999: 606
[c17]Christian Holzbaur, Thom W. Frühwirth: Compiling Constraint Handling Rules into Prolog with Attributed Variables. PPDP 1999: 117-133- 1998
[j4]Thom W. Frühwirth: Theory and Practice of Constraint Handling Rules. J. Log. Program. 37(1-3): 95-138 (1998)
[c16]
[c15]Thom W. Frühwirth, Pascal Brisset: Optimal Placement of Base Stations in Wireless Indoor Telecommunication. CP 1998: 476-480- 1997
[b1]Thom W. Frühwirth, Slim Abdennadher: Constraint-Programmierung - Grundlagen und Anwendungen. Springer 1997, ISBN 978-3-540-60670-3, pp. I-IX, 1-165
[j3]Thom W. Frühwirth, Slim Abdennadher: Der Mietspiegel im Internet: Ein Fall für Constraint-Logikprogrammierung. KI 11(1): 33-36 (1997)
[c14]Thom W. Frühwirth, Slim Abdennadher: Anwendungen Constraintbasierter Programmierung. GI Jahrestagung 1997: 317-326- 1996
[j2]Thom W. Frühwirth, Pascal Brisset, Jörg-Rainer Molwitz: Planning Cordless Business Communication Systems. IEEE Expert 11(1): 50-55 (1996)
[j1]Thom W. Frühwirth: Temporal Annotated Constraint Logic Programming. J. Symb. Comput. 22(5/6): 555-583 (1996)
[c13]Slim Abdennadher, Thom W. Frühwirth, Holger Meuss: On Confluence of Constraint Handling Rules. CP 1996: 1-15- 1994
[c12]Thom W. Frühwirth: Annotated Constraint Logic Programming Applied to Temporal Reasoning. PLILP 1994: 230-243
[c11]
[c10]- 1993
[c9]
[c8]Thom W. Frühwirth: Temporal Logic and Annotated Constraint Logic Programming. Executable Modal and Temporal Logics 1993: 58-68
[c7]Thom W. Frühwirth, Philipp Hanschke: Terminological Reasoning with Constraint Handling Rules. PPCP 1993: 80-89- 1992
[c6]Thom W. Frühwirth, Alexander Herold, Volker Küchenhoff, Thierry Le Provost, Pierre Lim, Eric Monfroy, Mark Wallace: Contraint Logic Programming - An Informal Introduction. Logic Programming Summer School 1992: 3-35
[p1]Eyal Yardeni, Thom W. Frühwirth, Ehud Y. Shapiro: Polymorphically Typed Logic Programs. Types in Logic Programming 1992: 63-90- 1991
[c5]Eyal Yardeni, Thom W. Frühwirth, Ehud Y. Shapiro: Polymorphically Typed Logic Programs. ICLP 1991: 379-393
[c4]Thom W. Frühwirth, Ehud Y. Shapiro, Moshe Y. Vardi, Eyal Yardeni: Logic Programs as Types for Logic Programs. LICS 1991: 300-309- 1990
[c3]
1980 – 1989
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:19 CEST by the dblp team



