default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernhard Gramlich
Person information
- affiliation: Vienna University of Technology, Autria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j12]Bernhard Gramlich:
Modularity in term rewriting revisited. Theor. Comput. Sci. 464: 3-19 (2012)- [c35]Karl Gmeiner, Bernhard Gramlich, Felix Schernhammer:
On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems. RTA 2012: 193-208 - [c34]Eugen Jiresch, Bernhard Gramlich:
Realizing Monads in Interaction Nets via Generic Typed Rules. TAMC 2012: 509-524 - [e6]Bernhard Gramlich, Dale Miller, Uli Sattler:
Automated Reasoning - 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 26-29, 2012. Proceedings. Lecture Notes in Computer Science 7364, Springer 2012, ISBN 978-3-642-31364-6 [contents] - 2010
- [j11]Felix Schernhammer, Bernhard Gramlich:
Characterizing and proving operational termination of deterministic conditional term rewriting systems. J. Log. Algebraic Methods Program. 79(7): 659-688 (2010) - [j10]María Alpuente
, Santiago Escobar, Bernhard Gramlich, Salvador Lucas:
On-demand strategy annotations revisited: An improved on-demand evaluation strategy. Theor. Comput. Sci. 411(2): 504-541 (2010) - [c33]Karl Gmeiner, Bernhard Gramlich, Felix Schernhammer:
On (Un)Soundness of Unravelings. RTA 2010: 119-134 - [c32]Bernhard Gramlich, Felix Schernhammer:
Termination of Rewriting with and Automated Synthesis of Forbidden Patterns. IWS 2010: 35-50
2000 – 2009
- 2009
- [c31]Felix Schernhammer, Bernhard Gramlich:
VMTL-A Modular Termination Laboratory. RTA 2009: 285-294 - [c30]Bernhard Gramlich, Felix Schernhammer:
Extending Context-Sensitivity in Term Rewriting. WRS 2009: 56-68 - 2008
- [c29]Karl Gmeiner, Bernhard Gramlich:
Transformations of Conditional Rewrite Systems Revisited. WADT 2008: 166-186 - 2007
- [c28]Felix Schernhammer, Bernhard Gramlich:
Termination of Lazy Rewriting Revisited. WRS@RDP 2007: 35-51 - 2006
- [c27]Bernhard Gramlich, Salvador Lucas:
Generalizing Newman's Lemma for Left-Linear Rewrite Systems. RTA 2006: 66-80 - [c26]María Alpuente, Bernhard Gramlich, Alicia Villanueva:
A Framework for Timed Concurrent Constraint Programming with External Functions. PROLE 2006: 143-155 - 2005
- [j9]Bernhard Gramlich, Salvador Lucas:
Reduction strategies in rewriting and programming. J. Symb. Comput. 40(1): 745-747 (2005) - [e5]Bernhard Gramlich:
Frontiers of Combining Systems, 5th International Workshop, FroCoS 2005, Vienna, Austria, September 19-21, 2005, Proceedings. Lecture Notes in Computer Science 3717, Springer 2005, ISBN 3-540-29051-6 [contents] - 2004
- [c25]Bernhard Gramlich:
Strategic Issues, Problems and Challenges in Inductive Theorem Proving. STRATEGIES@IJCAR 2004: 5-43 - 2003
- [c24]Bernhard Gramlich, Salvador Lucas:
Preface: 3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final Proceedings. WRS 2003: 567-569 - [e4]Bernhard Gramlich, Salvador Lucas:
3rd International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2003, Valencia, Spain, June 8, 2003, Final Proceedings. Electronic Notes in Theoretical Computer Science 86(4), Elsevier 2003 [contents] - 2002
- [c23]Bernhard Gramlich, Reinhard Pichler:
Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations. CADE 2002: 241-259 - [c22]María Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas:
Improving On-Demand Strategy Annotations. LPAR 2002: 1-18 - [c21]Bernhard Gramlich, Salvador Lucas:
Modular termination of context-sensitive rewriting. PPDP 2002: 50-61 - [c20]Bernhard Gramlich, Salvador Lucas:
Simple termination of context-sensitive rewriting. ACM SIGPLAN Workshop on Rule-Based Programming 2002: 29-42 - [c19]Bernhard Gramlich, Salvador Lucas:
Preface. WRS 2002: 196-197 - [e3]Bernhard Gramlich, Salvador Lucas:
2nd International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2002, FLoC Satellite Event, Copenhagen, Denmark, July 21, 2002, Final Proceedings. Electronic Notes in Theoretical Computer Science 70(6), Elsevier 2002 [contents] - 2001
- [j8]Bernhard Gramlich:
On interreduction of semi-complete term rewriting systems. Theor. Comput. Sci. 258(1-2): 435-451 (2001) - [c18]Bernhard Gramlich, Salvador Lucas:
1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) - Preface. WRS 2001: 201-202 - [c17]Maria Paola Bonacina, Bernhard Gramlich:
Preface: STRATEGIES 2001. STRATEGIES@IJCAR 2001: 217-218 - [e2]Maria Paola Bonacina, Bernhard Gramlich:
4th International Workshop on Strategies in Automated Deduction, STRATEGIES 2001, in connection with IJCAR 2001, Siena, Italy, June 18, 2001, Selected Papers. Electronic Notes in Theoretical Computer Science 58(2), Elsevier 2001 [contents] - [e1]Bernhard Gramlich, Salvador Lucas:
1st International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2001, Utrecht, The Netherlands, May 26, 2001. Electronic Notes in Theoretical Computer Science 57, Elsevier 2001 [contents] - 2000
- [j7]Bernhard Gramlich, Hélène Kirchner, Frank Pfenning:
Editorial: Strategies in Automated Deduction. Ann. Math. Artif. Intell. 29(1-4) (2000) - [c16]Bernhard Gramlich:
Simplifying termination proofs for rewrite systems by preprocessing. PPDP 2000: 139-150
1990 – 1999
- 1997
- [c15]Bernhard Gramlich:
Modular aspects of rewrite-based specifications. WADT 1997: 253-268 - 1996
- [b1]Bernhard Gramlich:
Termination and confluence: properties of structured rewrite systems. Kaiserslautern University of Technology, Germany, 1996, pp. 1-217 - [j6]Bernhard Gramlich:
On Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems. Theor. Comput. Sci. 165(1): 97-131 (1996) - [c14]Bernhard Gramlich:
Confluence without Termination via Parallel Critical Pairs. CAAP 1996: 211-225 - [c13]Bernhard Gramlich:
On Proving Termination by Innermost Termination. RTA 1996: 93-107 - [c12]Bernhard Gramlich, Claus-Peter Wirth:
Confluence of Terminating Conditional Rewrite Systems Revisited. RTA 1996: 245-259 - 1995
- [j5]Aart Middeldorp, Bernhard Gramlich:
Simple termination is difficult. Appl. Algebra Eng. Commun. Comput. 6: 115-128 (1995) - [j4]Bernhard Gramlich:
Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems. Fundam. Informaticae 24(1/2): 2-23 (1995) - 1994
- [j3]Bernhard Gramlich:
Generalized Sufficient Conditions for Modular Termination of Rewriting. Appl. Algebra Eng. Commun. Comput. 5: 131-158 (1994) - [j2]Bernhard Gramlich:
A Note on a Parameterized Version of the Well-Founded Induction Pricible. Bull. EATCS 52: 274-277 (1994) - [j1]Claus-Peter Wirth, Bernhard Gramlich:
A Constructor-Based Approach to Positive/Negative-Conditional Equational Specifications. J. Symb. Comput. 17(1): 51-90 (1994) - [c11]Bernhard Gramlich:
On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems. ALP 1994: 186-203 - [c10]Claus-Peter Wirth, Bernhard Gramlich:
On Notions of Inductive Validity for First-Oder Equational Clauses. CADE 1994: 162-176 - [c9]Bernhard Gramlich:
On Termination and Confluence of Conditional Rewrite Systems. CTRS 1994: 166-185 - 1993
- [c8]Aart Middeldorp, Bernhard Gramlich:
Simple Termination is Difficult. RTA 1993: 228-242 - 1992
- [c7]Bernhard Gramlich:
Generalized Sufficient Conditions for Modular Termination of Rewriting. ALP 1992: 53-68 - [c6]Bernhard Gramlich:
Sufficient Conditions for Modular Termination of Conditional Term Rewriting Systems. CTRS 1992: 128-142 - [c5]Claus-Peter Wirth, Bernhard Gramlich:
A Constructor-Based Approach for Positive/Negative-Conditional Equational Specifications. CTRS 1992: 198-212 - [c4]Bernhard Gramlich:
Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems. LPAR 1992: 285-296 - 1990
- [c3]Bernhard Gramlich:
UNICOM: A Refined Completion Based Inductive Theorem Prover. CADE 1990: 655-656 - [c2]Bernhard Gramlich:
Completion Based Inductive Theorem Proving: An Abstract Framework and its Applications. ECAI 1990: 314-319
1980 – 1989
- 1987
- [c1]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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
