Bernhard Gramlich - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2007

A Framework for Timed Concurrent Constraint Programming with External FunctionsMaría Alpuente, Bernhard Gramlich, Alicia Villanueva. ENTCS, 188:143-155, 2007. [doi]

2006

Generalizing Newman s Lemma for Left-Linear Rewrite SystemsBernhard Gramlich, Salvador Lucas. RTA 2006: 66-80 [doi]

2005

Frontiers of Combining Systems, 5th International Workshop, FroCoS 2005, Vienna, Austria, September 19-21, 2005, ProceedingsBernhard Gramlich, editor, Volume 3717 of Lecture Notes in Computer Science, Springer, 2005.

2003

3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final ProceedingsBernhard Gramlich, Salvador Lucas. ENTCS, 86(4):567-569, 2003. [doi]

2002

Improving On-Demand Strategy AnnotationsMaría Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas. lpar 2002: 1-18 [doi]

PrefaceBernhard Gramlich, Salvador Lucas. ENTCS, 70(6):196-197, 2002. [doi]

Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground EquationsBernhard Gramlich, Reinhard Pichler. cade 2002: 241-259 [doi]

2001

On interreduction of semi-complete term rewriting systemsBernhard Gramlich. TCS, 258(1-2):435-451, 2001. [doi]

1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) - PrefaceBernhard Gramlich, Salvador Lucas. TCS, 57:201-202, 2001. [doi]

1996

Confluence without Termination via Parallel Critical PairsBernhard Gramlich. caap 1996: 211-225

1995

Abstract Relations between Restricted Termination and Confluence Properties of Rewrite SystemsBernhard Gramlich. FUIN, 24(1/2):2-23, 1995.

Simple Termination DifficultAart Middeldorp, Bernhard Gramlich. aaecc, 6:115-128, 1995.

1994

A Note on a Parameterized Version of the Well-Founded Induction PricibleBernhard Gramlich. eatcs, 52:274-277, 1994.

On Termination and Confluence of Conditional Rewrite SystemsBernhard Gramlich. ctrs 1995: 166-185

On Notions of Inductive Validity for First-Oder Equational ClausesClaus-Peter Wirth, Bernhard Gramlich. cade 1994: 162-176

1992

Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting SystemsBernhard Gramlich. lpar 1992: 285-296

Generalized Sufficient Conditions for Modular Termination of RewritingBernhard Gramlich. icalp 1992: 53-68

1990

UNICOM: A Refined Completion Based Inductive Theorem ProverBernhard Gramlich. cade 1990: 655-656

1987

TRSPEC: A Term Rewriting Based System for Algebraic SpecificationsJürgen Avenhaus, Richard Göbel, Bernhard Gramlich, Klaus Madlener, Joachim Steinbach. ctrs 1988: 245-248

Sign in or sign up to see more results.

runs on WebDSL