Papers by Bernhard Gramlich (bibtex entries, abstracts, web citations)

• International Conference and Workshop Papers
• Journal Papers
• Books, Book Chapters and(Co-)Edited Works
• Theses
• National Conference and Workshop Papers
• Technical Reports

International Conference and Workshop Papers

• Karl Gmeiner, Bernhard Gramlich and Felix Schernhammer
  On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems
  Proc. 23rd International Conference on Rewriting Techniques and Applications (RTA 2012), Nagoya, Japan, May 28 - June 2, 2012, Ashish Tiwari, ed., LIPIcs (Leibniz International Proceedings in Informatics), 2012, to appear.
  abstract, bibtex
  
  
• Eugen Jiresch and Bernhard Gramlich
  Realizing Monads in Interaction Nets via Generic Typed Rules
  Proc. 9th Annual conference on Theory and Applications of Models of Computation (TAMC 2012), Beijing, China, May 16-21, 2012, Springer LNCS, Manindra Agrawal, S. Barry Cooper and Angsheng Li, eds., 2012, to appear.
  abstract, bibtex
  
  
• Bernhard Gramlich and Klaus Györgyfalvay
  On Modularity of Termination Properties of Rewriting under Strategies
  Proc. 12th International Workshop on Termination (Extended Abstracts) (WST 2012) Obergurgl, Austria, February 19-23, 2012, Georg Moser, ed., pp. 59-63, 2012.
  abstract, bibtex
  
  
• Karl Gmeiner, Bernhard Gramlich and Felix Schernhammer
  On (Un)Soundness of Unravelings
  Proc. 21st International Conference on Rewriting Techniques and Applications (RTA 2010), Edinburgh, Scotland, UK, July 11-13, 2010, Christopher Lynch, ed., LIPIcs (Leibniz International Proceedings in Informatics), 2010.
  abstract, bibtex
  
  
• Bernhard Gramlich and Felix Schernhammer
  Outermost Termination via Contextual Dependency Pairs
  Proc. 11th International Workshop on Termination (WST 2010), Edinburgh, Scotland, UK, July 14-15, 2010, Peter Schneider-Kamp, ed., 2010.
  abstract, bibtex, pdf
  
  
• Bernhard Gramlich and Felix Schernhammer
  Termination of Rewriting with and Automated Synthesis of Forbidden Patterns
  Prelim. Proc. 1st International Workshop on Strategies in Rewriting, Proving, and Programming (IWS 2010), Edinburgh, Scotland, UK, July 9, 2010, pp. 13-17, Hélène Kirchner and César Muñoz, eds., 2010.
  abstract, bibtex, pdf
  
  
• Felix Schernhammer and Bernhard Gramlich
  VMTL - A Modular Termination Laboratory
  Proc. 20th International Conference on Rewriting Techniques and Applications (RTA 2009), Brasilia, Brazil, June 29 - July 1, 2009, Ralf Treinen, ed., LNCS 5595, pp. 285-294, Springer-Verlag, 2009.
  © Springer-Verlag
  abstract, bibtex, pdf
  
  
• Bernhard Gramlich and Felix Schernhammer
  Extending Context-Sensitivity in Term Rewriting
  Prelim. Proc. 9th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2009), Brasilia, Brazil, June 28, 2009, Maribel Fernandez, ed., pp. 25-29, June 2009.
  abstract, bibtex
  
  
• Felix Schernhammer and Bernhard Gramlich
  On Some Implementation Aspects of VMTL
  Proc. 10th International Workshop on Termination (WST 2009), Leipzig, Germany, June 3-5, 2009, Alfons Geser and Johannes Waldmann, ed., pp. 72-75, 2009.
  abstract, bibtex, pdf
  
  
• Karl Gmeiner and Bernhard Gramlich
  Transformations of Conditional Rewrite Systems Revisited
  Recent Trends in Algebraic Development Techniques (WADT 2008) - Selected Papers, Andrea Corradini and Ugo Montanari, eds., LNCS 5486, pp. 166-186, Springer-Verlag, 2009.
  © Springer-Verlag
  abstract, bibtex, pdf
  
  
• Felix Schernhammer and Bernhard Gramlich
  On Operational Termination of Deterministic Conditional Rewrite Systems
  Proc. 20th Nordic Workshop on Programming Theory (Extended Abstracts) (NWPT 2008), Tarmo Uustalu, Jüri Vain and Juhan Emits, eds., pp. 84-86, Tallinn, Estonia, November 19-21, 2008.
  abstract, bibtex, pdf
  
  
• Karl Gmeiner and Bernhard Gramlich
  Transformations of Conditional Rewrite Systems Revisited
  Prelim. Proc. 19th International Workshop on Algebraic Development Techniques (WADT 2008), Andrea Corradini and Fabio Gadducci, eds., pp. 64-66, Pisa, Italy, June 13-16, 2008.
  abstract, bibtex, pdf
  
  
• Felix Schernhammer and Bernhard Gramlich
  On Proving and Characterizing Operational Termination of Deterministic Conditional Rewrite Systems
  Proc. 9th International Workshop on Termination - Extended Abstracts (WST 2007, held as part of RDP 2007, 4th Federated Conference on Rewriting, Deduction, and Programming), pp. 82-85, Dieter Hofbauer and Alexander Serebrenik, eds., Paris, France, June 29, 2007.
  abstract, bibtex, pdf
  
  
• Felix Schernhammer and Bernhard Gramlich
  Termination of Lazy Rewriting Revisited
  Proc. 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2007, held as part of RDP 2007, 4th Federated Conference on Rewriting, Deduction, and Programming), pp. 28-42, Jürgen Giesl, ed., Paris, France, June 25, 2007.
  abstract, bibtex, pdf
  
  
• Bernhard Gramlich and Salvador Lucas
  Generalizing Newman's Lemma for Left-Linear Rewrite Systems
  Proc. 17th International Conference on Rewriting Techniques and Applications (RTA 2006), held as part of FLoC 2006 (4th Federated Logic Conference), Seattle, Washington, USA, August 10-22, 2006, Frank Pfenning, ed., LNCS 4098, pp. 66-80, Springer-Verlag, August 2006.
  © Springer-Verlag
  abstract, bibtex, pdf (see also here)
  
  
• Bernhard Gramlich
  On Strategies for Inductive Theorem Proving [Invited Talk]
  Proc. 5th International Workshop on Strategies in Automated Deduction (STRATEGIES 2004), held in conjunction with IJCAR 2004 (2nd International Joint Conference on Automated Reasoning), Cork, Ireland, July 4, 2004, Maria Paola Bonacina and Thierry Boy de la Tour, eds., pp. 62-63 (abstract), July 2004.
  abstract, bibtex, ps.gz, slides (pdf.gz)
  
  
• Bernhard Gramlich
  Modularity of Termination of Left-Linear Rewrite Systems Revisited
  Proc. 7th International Workshop on Termination - Extended Abstracts (WST 2004), part of RDP 2004 (2nd Federated Conference on Rewriting, Deduction, and Programming), Aachen, Germany, June 1-2, 2004, Michael Codish and Aart Middeldorp, eds., Technical Report AIB-2004-07, ISSN 0935-3232, RWTH Aachen, June 2004.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich and Salvador Lucas
  Modular Context-Sensitive Algebraic Specifications
  Proc. 17th International Workshop on Algebraic Development Techniques - Extended Abstracts (WADT 2004), Barcelona, Spain, March 27-30, 2004, ed. Peter D. Mosses, pp. 20-22, 2004.
  abstract, bibtex, ps.gz
  
  
• María Alpuente, Santiago Escobar, Bernhard Gramlich and Salvador Lucas
  Improving On-demand Strategy Annotations
  Proc. 9th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2002), Tbilisi, Georgia, October 14-18, 2002, eds. Mattias Baaz and Andrei Voronkov, LNAI 2514, Springer-Verlag, 2002.
  © Springer-Verlag
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich and Salvador Lucas
  Modular Termination of Context-Sensitive Rewriting
  Proc. 4th International Conference on Principles and Practice of Declarative Programming (PPDP 2002), Pittsburgh, PA, USA, October 6-8, 2002, ed. Claude Kirchner, ACM Press, 2002.
  © ACM Press
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich and Salvador Lucas
  Simple Termination of Context-Sensitive Rewriting
  Proc. 3rd ACM Sigplan Workshop on Rule-based Programming (RULE 2002), Pittsburgh, PA, USA, October 5, 2002, eds. Bernd Fischer and Eelco Visser, ACM Press, 2002.
  © ACM Press
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich and Reinhard Pichler
  Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations
  Proc. 18th Int. Conference on Automated Deduction (CADE 2002), Copenhagen, Denmark, July 27-30, 2002, ed. A. Voronkov, LNAI 2392, pp. 241-259, Springer-Verlag, 2002.
  © Springer-Verlag
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Knowledge Based Simplification of Termination Proofs
  Proc. 5th Int. Workshop on Termination (WST 2001) - Extended Abstracts, Utrecht, The Netherlands, May 2001, ed. N. Dershowitz, pp. 19-21, 2001.
  bibtex, ps.gz
  
  
• Bernhard Gramlich
  Simplifying Termination Proofs for Rewrite Systems by Preprocessing
  Proc. 2nd Int. Conf. on Principles and Practice of Declarative Programming (PPDP 2000), Montreal, Canada, September 2000, eds. M. Gabrielli & F. Pfenning, pp. 139-150, ACM press, 2000.
  © ACM Press
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  On the (Non-)Existence of Least Fixed Points in Conditional Equational Logic and Conditional Rewriting
  Proc. 2nd Int. Workshop on Fixed Points in Computer Science (FICS 2000) - Extended Abstracts, Paris, France, July 2000, pp. 38-40, ed. I. Guessarian, July 2000.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Extending First-Order Unification by Tractable Second-Order Features
  Proc. 3rd Int. Workshop on First-Order Theorem Proving (FTP 2000), St. Andrews, Scotland, July 2000, pp. 122-133, eds. P. Baumgartner & H. Zhang, Fachbericht Informatik 5/2000, Universität Koblenz, July 2000.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Strategic Aspects in Inductive Theorem Proving and Proof Engineering (Extended Abstract)
  Proc. FLoC'99 Workshop on the Automation of Proof by Mathematical Induction (IND-WS'99), Trento, Italy, pp. 25-28, July 1999.
  bibtex
  
  
• Bernhard Gramlich
  On Some Abstract Termination Criteria
  Proc. 4th Int. Workshop on Termination (WST'99) - Abstracts, Dagstuhl, Germany, May 1999.
  bibtex, pdf (abstract), pdf (slides)
  
  
• Bernhard Gramlich
  On (Un)Sound Simplifications of Equational Theories
  Proc. 12th Int. Workshop on Unification (UNIF'98), Rome, Italy,
  ed. Marisa Venturini Zilli et al., Research Report SI-98/8, June 1998.
  bibtex
  
  
• Bernhard Gramlich
  Modular Aspects of Rewrite-Based Specifications
  Proc. 12th Int. Workshop on Algebraic Development Techniques - Selected Papers (WADT'97), Tarquinia, Italy,
  ed. F. Parisi-Presicce, LNCS 1376, pp. 253-268, 1998.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Design Issues for Inductive Theorem Proving Systems
  CADE-14 Workshop on Automated Induction Theorem Proving (IND-WS'97), Townsville, North Queensland, Australia, July 1997.
  bibtex
  
  
• Bernhard Gramlich
  A Refined Analysis for Termination of Combined Rewrite Systems
  Proc. 3rd Int. Workshop on Termination (IWT'97) - Extended Abstracts, Utrecht The Netherlands,
  pp. 4-5, May 1997.
  bibtex
  
  
• Bernhard Gramlich
  On Proving Termination by Innermost Termination
  Proc. 7th Int. Conf. on Rewriting Techniques and Applications (RTA'96), New Brunswick, NJ, USA,
  ed. H. Ganzinger, LNCS 1103, pp. 97-107, 1996.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich and Claus-Peter Wirth
  Confluence of Terminating Conditional Rewrite Systems Revisited
  Proc. 7th Int. Conf. on Rewriting Techniques and Applications (RTA'96), New Brunswick, NJ, USA,
  ed. H. Ganzinger, LNCS 1103, pp. 245-259, 1996.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Confluence without Termination via Parallel Critical Pairs
  Proc. 21st Int. Coll. on Trees in Algebra and Programming (CAAP'96), Linköping, Sweden,
  ed. H. Kirchner, LNCS 1059, pp. 211-225, 1996.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Conditional Rewrite Systems under Signature Extensions: Some Counterexamples
  Proc. 10th Int. Workshop on Unification (UNIF'96), Herrsching (Munich), Germany,
  eds. K.U. Schulz & S. Kepser, CIS-Report 96-91, pp. 45-50, 1996.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  On Evaluation Criteria for Inductive Theorem Proving Systems
  Proc. 4th Int. Workshop on the Automation of Proof by Mathematical Induction (IND-WS'95), Dagstuhl-Seminar-Report, Dagstuhl, Germany, July 1995.
  bibtex
  
  
• Bernhard Gramlich
  Termination by Divide and Conquer: Some New Preservation Results
  Proc. 2nd Int. Workshop on Termination (IWT'95) - Extended Abstracts, La Bresse, France
  pp. 4-5, May 1995.
  bibtex
  
  
• Bernhard Gramlich
  On Termination and Confluence of Conditional Rewrite Systems
  Proc. 4th Int. Workshop on Conditional and Typed Rewriting Systems (CTRS'94), Jerusalem, Israel,
  eds. N. Dershowitz & N. Lindenstrauss, LNCS 968, pp. 166-185, 1995.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems
  Proc. 4th Int. Conf. on Algebraic and Logic Programming (ALP'94), Madrid, Spain,
  eds. G. Levi & M. Rodríguez-Artalejo, LNCS 850, pp. 186-203, 1994.
  abstract, bibtex, ps.gz
  
  
• Claus-Peter Wirth and Bernhard Gramlich
  On Notions of Inductive Validity for First-Order Equational Clauses
  Proc. 12th Int. Conf. on Automated Deduction (CADE'94), Nancy, France,
  ed. A. Bundy, LNAI 814, pp. 162-176, 1994.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Experiences with the Development, Maintenance and Enhancement of UNICOM
  Proc. CADE-12 Workshop on Correctness and Metatheoretic Extensibility of Automated Reasoning Systems, Nancy, France,
  eds. D. Basin, F. Giunchiglia and M. Kaufmann, pp. 42-43, 1994.
  bibtex
  
  
• Aart Middeldorp and Bernhard Gramlich
  Simple Termination is Difficult
  Proc. 5th Int. Conf. on Rewriting Techniques and Applications (RTA'93), Montreal, Canada,
  ed. C. Kirchner, LNCS 690, pp. 228-242, 1993.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Termination Properties of Non-Orthogonal Term Rewriting Systems
  Proc. 1st Int. Workshop on Termination (IWT'93) - Abstracts, St. Andrews, Scotland, May 1993.
  bibtex
  
  
• Bernhard Gramlich
  Sufficient Conditions for Modular Termination of Conditional Term Rewriting Systems
  Proc. 3rd Int. Workshop on Conditional Term rewriting Systems (CTRS'92), Pont-à-Mousson, France,
  eds. M. Rusinowitch & J.-L. Rémy, LNCS 656, pp. 128-142, 1993.
  abstract, bibtex, ps.gz
  
  
• Claus-Peter Wirth and Bernhard Gramlich
  A Constructor-Based Approach for Positive/Negative Conditional Equational Specifications
  Proc. 3rd Int. Workshop on Conditional Term rewriting Systems (CTRS'92), Pont-à-Mousson, France,
  eds. M. Rusinowitch & J.-L. Rémy, LNCS 656, pp. 198-212, 1993.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Generalized Sufficient Conditions for Modular Termination of Rewriting
  Proc. 3rd Int. Conf. on Algebraic and Logic Programming (ALP'92), Volterra, Italy,
  eds. H. Kirchner & G. Levi, LNCS 632, pp. 53-68, 1992.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems
  Proc. 3rd Int. Conf. on Logic Programming and Automated Reasoning (LPAR'92), St. Petersburg, Russia,
  ed. A. Voronkov, LNAI 624, pp. 285-296, 1992.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Inductive Theorem Proving Based on Rewriting and Completion Techniques
  Proc. 1st Int. Workshop On the Automation of Inductive Proof (IND-WS'92) - Abstracts, held in conjunction with CADE-11, Saratoga Springs, NY, USA
  ed. Alan Bundy, pp. 14-15, June 1992.
  bibtex
  
  
• Bernhard Gramlich
  Completion Based Inductive Theorem Proving: An Abstract Framework and its Applications
  Proc. 9th European Conf. on Artificial Intelligence (ECAI'90), Stockholm, Sweden,
  ed. L.C. Aiello, Pitman Publishing, London, pp. 314-319, 1990.
  abstract, bibtex
  
  
• Bernhard Gramlich
  UNICOM: A Refined Completion Based Inductive Theorem Prover
  Proc. 10th Int. Conf. on Automated Deduction (CADE'90), Kaiserslautern, Germany,
  ed. M.E. Stickel, LNAI 449, pp. 655-656, 1990.
  abstract, bibtex
  
  
• Bernhard Gramlich
  Unification of Term Schemes
  Proc. 2nd Int. Workshop on Unification - Extended Abstracts (UNIF'89), Lambrecht, Germany,
  eds. H.-J. Bürckert & W. Nutt, 1989.
  abstract, bibtex
  
  
• Bernhard Gramlich
  Efficient AC-Matching using Constraint Propagation
  Proc. 2nd Int. Workshop on Unification - Abstracts (UNIF'88), Val d'Ajol, France,
  eds. C. Kirchner & G. Smolka, Rapport Interne No. 89-R-38, CRIN, 1988.
  abstract, bibtex
  
  
• Jürgen Avenhaus, Richard Göbel, Bernhard Gramlich, Klaus Madlener and Joachim Steinbach
  TRSPEC: A Term Rewriting Based System for Algebraic Specifications
  Proc. 1st Int. Workshop on Conditional Term Rewriting Systems (CTRS'97), Orsay, France,
  eds. S. Kaplan & J.-P. Jouannaud, LNCS 308, pp. 245-248, 1988.
  abstract, bibtex
  
  

Journal Papers

• Bernhard Gramlich and Felix Schernhammer
  Termination of Rewriting with and Automated Synthesis of Forbidden Patterns
  Final Proc. 1st International Workshop on Strategies in Rewriting, Proving, and Programming (IWS 2010), Electronic Proceedings in Theoretical Computer Science, Volume 44, pp. 35-50, Hélène Kirchner and César Muñoz, eds., December 2010.
  abstract, bibtex, pdf
  
  
• Bernhard Gramlich and Felix Schernhammer
  Extending Context-Sensitivity in Term Rewriting
  Final Proc. 1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2009), Electronic Proceedings in Theoretical Computer Science, Volume 15, Maribel Fernandez, ed., pp. 56-68, January 26, 2010.
  abstract, bibtex, pdf
  
  
• María Alpuente, Santiago Escobar, Bernhard Gramlich and Salvador Lucas
  On-Demand Strategy Annotations Revisited: An Improved On-Demand Evaluation Strategy
  Theoretical Computer Science, Volume 411, Issue 2, Pages 504-541, 2 January 2010.
  © Elsevier
  abstract, bibtex, doi
  
  
• Felix Schernhammer and Bernhard Gramlich
  Characterizing and Proving Operational Termination of Deterministic Conditional Term Rewriting Systems
  Journal of Logic and Algebraic Programming, Volume 79, Issue 7, Pages 659-688, Revised selected papers of NWPT 2008, Tarmo Uustalu and Jüri Vain, editors, October 2010.
  © Elsevier
  abstract, bibtex
  
  
• Felix Schernhammer and Bernhard Gramlich
  Termination of Lazy Rewriting Revisited
  Electronic Notes in Theoretical Computer Science, Volume 204, Final Proc. of WRS 2007 - 7th International Workshop on Reduction Strategies in Rewriting and Programming, (Jürgen Giesl), ed., pages 35-51, April 2008.
  © Elsevier B.V.
  abstract, bibtex, pdf
  
  
• María Alpuente, Bernhard Gramlich and Alicia Villanueva
  A Framework for Timed Concurrent Constraint Programming with External Functions
  Electronic Notes in Theoretical Computer Science, Volume 188 (Pages 1-156), Proc. 6th Spanish Conference on Programming and Languages (PROLE 2006), Sitges, Barcelona, Spain, Paqui Lucio and Fernando Orejas, eds., pages 143-155, July 2007.
  © Elsevier B.V.
  abstract, bibtex, pdf
  
  
• Bernhard Gramlich
  Strategic Issues, Problems and Challenges in Inductive Theorem Proving
  Electronic Notes in Theoretical Computer Science, Volume 125, Issue 2 (Proc. 5th International Workshop on Strategies in Automated Deduction, Strategies 2004 - Selected Papers, M.P. Bonacina and T. Boy de la Tour, eds.), Elsevier, pp. 5-43, March 2005.
  © Elsevier B.V.
  abstract, bibtex, pdf.gz
  
  
• Bernhard Gramlich
  On Interreduction of Semi-Complete Term Rewriting Systems
  Theoretical Computer Science 258(1-2), pp. 435-451, April 2001.
  abstract, bibtex, ps.gz (technical report version)
  
  
• Bernhard Gramlich
  On Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems
  Theoretical Computer Science 165(1), pp. 97-131, 1996.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems
  Fundamentae Informaticae 24 (special issue on term rewriting systems), pp. 3-23, 1995.
  abstract, bibtex, ps.gz
  
  
• Aart Middeldorp and Bernhard Gramlich
  Simple Termination is Difficult
  Applicable Algebra in Engineering, Communication and Computing, Volume 6, Number 2, pp. 115-128, March 1995.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Generalized Sufficient Conditions for Modular Termination of Rewriting
  Applicable Algebra in Engineering, Communication and Computing, Volume 5, Numbers 3-4, pp. 131-158, May 1994.
  abstract, bibtex, ps.gz
  
  
• Claus-Peter Wirth and Bernhard Gramlich
  A Constructor-Based Approach for Positive/Negative Conditional Equational Specifications
  Journal of Symbolic Computation 17, pp. 51-90, 1994.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  A Note on a Parameterized Version of the Well-Founded Induction Principle
  Bulletin of the EATCS 52, pp. 274-278, 1994.
  abstract, bibtex, ps.gz (long version)
  
  

Books, Book Chapters and(Co-)Edited Works

• Bernhard Gramlich, ed.
  Frontiers of Combining Systems 5th International Workshop, FroCoS 2005, Vienna, Austria, September 19-21, 2005, Proceedings
  (Springer web page on LNAI 3717, Springer online web page for LNAI 3717)
  Lecture Notes in Computer Science, Vol. 3717, Springer-Verlag, September 2005.
  abstract, bibtex
  
  
• Bernhard Gramlich and Salvador Lucas, eds.
  Journal of Symbol Computation -- Special issue on Reduction Strategies in Rewriting and Programming,
  Volume 40, Issue 1, pp. 745-903, Elsevier Science Publishers, July 2005.
  abstract, bibtex
  
  
• Bernhard Gramlich and Salvador Lucas, eds.
  3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) -- Final Proceedings
  Electronic Notes in Theoretical Computer Science (ENTCS), Volume 86, Issue 4, Elsevier Science Publishers, December 2003.
  abstract, bibtex
  
  
• Bernhard Gramlich and Salvador Lucas, eds.
  Proc. 3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003)
  Valenica, Spain, June 8, 2003, Technical Report DSIC-II/14/03, Departamento de Sistemas Informáticos y Computación, Universidad Polit{\'e}cnica de Valencia, 2003.
  abstract, bibtex, pdf.gz (preliminary proceedings)
  
  
• Bernhard Gramlich and Salvador Lucas, eds.
  2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2002) -- Final Proceedings
  Electronic Notes in Theoretical Computer Science (ENTCS), Volume 70, Issue 6, Elsevier Science Publishers, December 2002.
  abstract, bibtex
  
  
• Bernhard Gramlich and Salvador Lucas, eds.
  Proc. 2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2002)
  Copenhagen, Denmark, July 2002, Technical Report E1852-2002-02, Institut für Computersprachen, TU Wien, Austria, Verlag Berger, July 2002.
  abstract, bibtex, ps.gz (preliminary proceedings)
  
  
• Maria Paola Bonacina and Bernhard Gramlich, eds.
  4th International Workshop on Strategies in Automated Deduction (STRATEGIES 2001) - Selected Papers
  Electronic Notes in Theoretical Computer Science, Volume 58, Issue 2, Elsevier Science Publishers, 2001.
  abstract, bibtex
  
  
• Bernhard Gramlich and Salvador Lucas, eds.
  1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001)
  Electronic Notes in Theoretical Computer Science, Volume 57, Elsevier Science Publishers, 2001.
  abstract, bibtex
  
  
• Maria Paola Bonacina and Bernhard Gramlich, eds.
  Proceedings 4th International Workshop on Strategies in Automated Deduction (STRATEGIES 2001)
  Siena, Italy, June 2001.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich and Salvador Lucas, eds.
  Proceedings International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001)
  Utrecht, The Netherlands, May 2001.
  abstract, bibtex, pdf.gz (3 MB(!))
  
  
• Bernhard Gramlich, Hélène Kirchner and Frank Pfenning, eds.
  Strategies in Automated Deduction
  special issue of Annals of Mathematics and Artificial Intelligence, Volume 29, Issue 1/4, 2000, published in February 2001.
  abstract, bibtex
  
  
• Bernhard Gramlich, Hélène Kirchner and Frank Pfenning, eds.
  Proceedings of FLoC'99 Workshop on Strategies in Automated Deduction (STRATEGIES'99)
  Trento, Italy, July 1999.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich and Frank Pfenning, eds.
  Proceedings of CADE-15 Workshop on Strategies in Automated Deduction
  Lindau, Germany, July 1998.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich and Hélène Kirchner, eds.
  Proceedings of CADE-14 Workshop on Strategies in Automated Deduction
  Townsville, Australia, July 1997.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich and Jürgen Avenhaus
  Formal Specification and Verification of Equationally Defined Functional Programs with UNICOM
  in: Sichere Software, ed. H. Kersten, Hüthig Verlag, pp. 150-171, 1990.
  abstract, bibtex
  
  

Theses

• Bernhard Gramlich
  Towards a Structure Theory of Term Rewriting
  Habilitation Thesis, 135 pp., Technische Universität Wien, September 1999.
  bibtex,
  
  
• Bernhard Gramlich
  Termination and Confluence Properties of Structured Rewrite Systems
  PhD Thesis, 217 pp., Fachbereich Informatik, Universität Kaiserslautern, Germany, January 1996.
  abstract, bibtex, (searchable) pdf
  
  

National Conferences and Workshops

• María Alpuente, Bernhard Gramlich and Alicia Villanueva
  Timed Concurrent Constraint Programming with Instantaneous Computations
  Proc. 6th Spanish Conference on Programming and Computer Languages (PROLE 2006), Sitges, Spain,
  ed. Paqui Lucio, pp. 221-230, October 2006.
  abstract, bibtex
  
  

Technical Reports

• Bernhard Gramlich and Klaus Györgyfalvay
  On Modularity of Termination Properties of Rewriting under Position-Based Strategies
  Technical Report, Theory and Logic Group, Institute of Computer Languages, TU Wien, Austria, 2012, forthcoming.
  
  
• Bernhard Gramlich and Klaus Györgyfalvay
  A Note on Minimal Counterexamples to Modularity of Termination
  Technical Report E1852-2012-02, Theory and Logic Group, Institute of Computer Languages, TU Wien, Austria, August 2012.
  pdf
  
  
• Karl Gmeiner, Bernhard Gramlich and Felix Schernhammer
  On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems
  Technical Report E1852-2012-01, Theory and Logic Group, Institute of Computer Languages, TU Wien, Austria, April 2012.
  abstract, pdf
  
  
• Eugen Jiresch and Bernhard Gramlich
  Realizing Monads in Interaction Nets via Generic Typed Rules
  Technical Report E1852-2011-01, Theory and Logic Group, Institute of Computer Languages, TU Wien, Austria, June 2011.
  abstract, bibtex, pdf
  
  
• Karl Gmeiner, Bernhard Gramlich and Felix Schernhammer
  On (Un)Soundness of Unravelings
  Technical Report E1852-2010-01, Theory and Logic Group, Institute of Computer Languages, TU Wien, Austria, April 2010.
  abstract, bibtex, pdf
  
  
• Bernhard Gramlich and Felix Schernhammer
  Extending Context-Sensitivity in Term Rewriting
  Technical Report E1852-2009-02, Theory and Logic Group, Institute of Computer Languages, TU Wien, Austria, December 2009.
  abstract, bibtex, pdf
  
  
• Felix Schernhammer and Bernhard Gramlich
  Characterizing and Proving Operational Termination of Deterministic Conditional Term Rewriting Systems
  Technical Report E1852-2009-01 (revised and extended version of WST 2007 and NWPT 2008 contributions), Theory and Logic Group, Institute of Computer Languages, TU Wien, Austria, September 2009 (revised version).
  abstract, bibtex, pdf
  
  
• Felix Schernhammer and Bernhard Gramlich
  Characterizing and Proving Operational Termination of Deterministic Conditional Term Rewriting Systems
  Technical Report E1852-2009-01 (revised and extended version of WST 2007 and NWPT 2008 contributions), Theory and Logic Group, Institute of Computer Languages, TU Wien, Austria, September 2009 (revised version).
  abstract, bibtex, pdf
  
  
• Felix Schernhammer and Bernhard Gramlich
  Termination of Lazy Rewriting Revisited
  Technical Report E1852-2007-01 (full version of WRS 2007 paper, 30 pages), Theory and Logic Group, Institute of Computer Languages, TU Wien, Austria, November 2007.
  abstract, bibtex, pdf
  
  
• María Alpuente, Bernhard Gramlich and Alicia Villanueva
  A Framework for Timed Concurrent Constraint Programming with External Functions
  Technical Report DSIC-II/13/06, 16 pages, Departamento de Sistemas Informáticos y Computación, UPV, Valencia, Spain, December 2006.
  abstract, bibtex, pdf
  
  
• María Alpuente, Santiago Escobar, Bernhard Gramlich and Salvador Lucas
  On-Demand Strategy Annotations Revisited
  Technical Report DSIC-II/18/03, 51 pages, Departamento de Sistemas Informáticos y Computación, UPV, Valencia, Spain, July 2003.
  abstract, bibtex, pdf.gz
  
  
• Bernhard Gramlich
  On Interreduction of Semi-Complete Term Rewriting Systems
  Technical Report E1852-BG-99-01, Technische Universität Wien, September 1999.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Modular Aspects of Rewrite-Based Specifications
  Research Report RR-3330, INRIA Lorraine, Nancy, France, 1997.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  On Semi-Completeness of Term Rewriting Systems
  Research Report RR-3327, INRIA Lorraine, Nancy, France, 1997.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Confluence without Termination via Parallel Critical Pairs
  SEKI-Report SR-95-13, Fachbereich Informatik, Universität Kaiserslautern, 1995.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  A Note on a Parameterized Version of the Well-Founded Induction Principle
  SEKI-Report SR-95-08, Fachbereich Informatik, Universität Kaiserslautern, 1995.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  New Abstract Criteria for Termination and Confluence of Conditional Rewrite Systems
  SEKI-Report SR-93-17, Fachbereich Informatik, Universität Kaiserslautern, 1993.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems
  SEKI-Report SR-93-09, Fachbereich Informatik, Universität Kaiserslautern, 1993.
  abstract, bibtex, ps.gz
  
  
• Claus-Peter Wirth, Bernhard Gramlich, Ulrich Kühler and Horst Prote
  Constructor-Based Inductive Validity in Positive/Negative Conditional Equational Specifications
  SEKI-Report SR-93-05, Fachbereich Informatik, Universität Kaiserslautern, 1993.
  abstract, bibtex, pdf
  
  
• Claus-Peter Wirth and Bernhard Gramlich
  A Constructor-Based Approach for Positive/Negative-Conditional Equational Specifications
  SEKI-Report SR-92-10, Fachbereich Informatik, Universität Kaiserslautern, 1992.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Towards Intelligent Inductive Proof Engineering
  SEKI-Report SR-92-01, Fachbereich Informatik, Universität Kaiserslautern, 1992.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich and Wolfgang Lindner
  A Guide to UNICOM, an Inductive Theorem Prover Based on Rewriting and Completion Techniques
  SEKI-Report SR-91-17, Fachbereich Informatik, Universität Kaiserslautern, 1991.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  A Structural Analysis of Modular Termination of Term Rewriting Systems
  SEKI-Report SR-91-15, Fachbereich Informatik, Universität Kaiserslautern, 1991.
  abstract, bibtex, ps.gz
  
  
• Bernhard Gramlich
  Completion Based Inductive Theorem Proving: A Case Study in Verifying Sorting Algorithms
  SEKI-Report SR-90-04, Fachbereich Informatik, Universität Kaiserslautern, 1990.
  abstract, bibtex
  
  
• Bernhard Gramlich
  Inductive Theorem Proving Using Refined Unfailing Completion Techniques
  SEKI-Report SR-89-14, Fachbereich Informatik, Universität Kaiserslautern, 1989.
  abstract, bibtex
  
  
• Bernhard Gramlich
  Unification of Term Schemes - Theory and Applications
  SEKI-Report SR-88-18, Fachbereich Informatik, Universität Kaiserslautern, 1988.
  abstract, bibtex
  
  
• Bernhard Gramlich and Jörg Denzinger
  Efficient AC-matching Using Constraint Propagation
  SEKI-Report SR-88-15, Fachbereich Informatik, Universität Kaiserslautern, 1988.
  abstract, bibtex
  
  

Home Page B.G. | AG 185/2 | Institut 185 | Server Home Page | Faculty of Informatics | TU Wien

Bernhard Gramlich