dblp.uni-trier.dewww.uni-trier.de

Bernhard Gramlich Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
39EEFelix Schernhammer, Bernhard Gramlich: VMTL-A Modular Termination Laboratory. RTA 2009: 285-294
2008
38EEFelix Schernhammer, Bernhard Gramlich: Termination of Lazy Rewriting Revisited. Electr. Notes Theor. Comput. Sci. 204: 35-51 (2008)
2007
37EEMaría Alpuente, Bernhard Gramlich, Alicia Villanueva: A Framework for Timed Concurrent Constraint Programming with External Functions. Electr. Notes Theor. Comput. Sci. 188: 143-155 (2007)
2006
36EEBernhard Gramlich, Salvador Lucas: Generalizing Newman's Lemma for Left-Linear Rewrite Systems. RTA 2006: 66-80
2005
35 Bernhard Gramlich: Frontiers of Combining Systems, 5th International Workshop, FroCoS 2005, Vienna, Austria, September 19-21, 2005, Proceedings Springer 2005
34EEBernhard Gramlich: Strategic Issues, Problems and Challenges in Inductive Theorem Proving. Electr. Notes Theor. Comput. Sci. 125(2): 5-43 (2005)
33EEBernhard Gramlich, Salvador Lucas: Reduction strategies in rewriting and programming. J. Symb. Comput. 40(1): 745-747 (2005)
2003
32EEBernhard Gramlich, Salvador Lucas: 3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final Proceedings. Electr. Notes Theor. Comput. Sci. 86(4): (2003)
2002
31EEBernhard Gramlich, Salvador Lucas: Simple termination of context-sensitive rewriting. ACM SIGPLAN Workshop on Rule-Based Programming 2002: 29-42
30EEBernhard Gramlich, Reinhard Pichler: Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations. CADE 2002: 241-259
29EEMaría Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas: Improving On-Demand Strategy Annotations. LPAR 2002: 1-18
28EEBernhard Gramlich, Salvador Lucas: Modular termination of context-sensitive rewriting. PPDP 2002: 50-61
27EEBernhard Gramlich, Salvador Lucas: Preface. Electr. Notes Theor. Comput. Sci. 70(6): (2002)
2001
26EEBernhard Gramlich, Salvador Lucas: 1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) - Preface. Electr. Notes Theor. Comput. Sci. 57: (2001)
25EEMaria Paola Bonacina, Bernhard Gramlich: Preface: STRATEGIES 2001. Electr. Notes Theor. Comput. Sci. 58(2): (2001)
24EEBernhard Gramlich: On interreduction of semi-complete term rewriting systems. Theor. Comput. Sci. 258(1-2): 435-451 (2001)
2000
23EEBernhard Gramlich: Simplifying termination proofs for rewrite systems by preprocessing. PPDP 2000: 139-150
22 Bernhard Gramlich, Hélène Kirchner, Frank Pfenning: Editorial: Strategies in Automated Deduction. Ann. Math. Artif. Intell. 29(1-4): (2000)
1997
21 Bernhard Gramlich: Modular aspects of rewrite-based specifications. WADT 1997: 253-268
1996
20EEBernhard Gramlich: Confluence without Termination via Parallel Critical Pairs. CAAP 1996: 211-225
19EEBernhard Gramlich, Claus-Peter Wirth: Confluence of Terminating Conditional Rewrite Systems Revisited. RTA 1996: 245-259
18EEBernhard Gramlich: On Proving Termination by Innermost Termination. RTA 1996: 93-107
17EEBernhard Gramlich: On Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems. Theor. Comput. Sci. 165(1): 97-131 (1996)
1995
16 Aart Middeldorp, Bernhard Gramlich: Simple Termination Difficult. Appl. Algebra Eng. Commun. Comput. 6: 115-128 (1995)
15 Bernhard Gramlich: Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems. Fundam. Inform. 24(1/2): 2-23 (1995)
1994
14EEBernhard Gramlich: On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems. ALP 1994: 186-203
13EEClaus-Peter Wirth, Bernhard Gramlich: On Notions of Inductive Validity for First-Oder Equational Clauses. CADE 1994: 162-176
12 Bernhard Gramlich: On Termination and Confluence of Conditional Rewrite Systems. CTRS 1994: 166-185
11 Bernhard Gramlich: Generalized Sufficient Conditions for Modular Termination of Rewriting. Appl. Algebra Eng. Commun. Comput. 5: 131-158 (1994)
10 Bernhard Gramlich: A Note on a Parameterized Version of the Well-Founded Induction Pricible. Bulletin of the EATCS 52: 274-277 (1994)
9 Claus-Peter Wirth, Bernhard Gramlich: A Constructor-Based Approach to Positive/Negative-Conditional Equational Specifications. J. Symb. Comput. 17(1): 51-90 (1994)
1993
8EEAart Middeldorp, Bernhard Gramlich: Simple Termination is Difficult. RTA 1993: 228-242
1992
7EEBernhard Gramlich: Generalized Sufficient Conditions for Modular Termination of Rewriting. ALP 1992: 53-68
6 Bernhard Gramlich: Sufficient Conditions for Modular Termination of Conditional Term Rewriting Systems. CTRS 1992: 128-142
5 Claus-Peter Wirth, Bernhard Gramlich: A Constructor-Based Approach for Positive/Negative-Conditional Equational Specifications. CTRS 1992: 198-212
4EEBernhard Gramlich: Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems. LPAR 1992: 285-296
1990
3EEBernhard Gramlich: UNICOM: A Refined Completion Based Inductive Theorem Prover. CADE 1990: 655-656
2 Bernhard Gramlich: Completion Based Inductive Theorem Proving: An Abstract Framework and its Applications. ECAI 1990: 314-319
1987
1 Jürgen Avenhaus, Richard Göbel, Bernhard Gramlich, Klaus Madlener, Joachim Steinbach: TRSPEC: A Term Rewriting Based System for Algebraic Specifications. CTRS 1987: 245-248

Coauthor Index

1María Alpuente [29] [37]
2Jürgen Avenhaus [1]
3Maria Paola Bonacina [25]
4Santiago Escobar [29]
5Richard Göbel [1]
6Hélène Kirchner [22]
7Salvador Lucas [26] [27] [28] [29] [31] [32] [33] [36]
8Klaus Madlener [1]
9Aart Middeldorp [8] [16]
10Frank Pfenning [22]
11Reinhard Pichler [30]
12Felix Schernhammer [38] [39]
13Joachim Steinbach [1]
14Alicia Villanueva [37]
15Claus-Peter Wirth [5] [9] [13] [19]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)