Search results for "RTA"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Joachim Steinbach	Automatic Termination Proofs With Transformation Orderings.	RTA	1995	DBLP DOI BibTeX RDF
1	Jan Kuper	Proving the Genericity Lemma by Leftmost Reduction is Simple.	RTA	1995	DBLP DOI BibTeX RDF
1	Friedrich Otto, Paliath Narendran, Daniel J. Dougherty	Some Independent Results for Equational Unification.	RTA	1995	DBLP DOI BibTeX RDF
1	Mark E. Stickel, Hantao Zhang 0001	Studying Quasigroup Identities by Rewriting Techniques: Problems and First Results.	RTA	1995	DBLP DOI BibTeX RDF
1	Wolfgang Gehrke	Problems in Rewriting Applied to Categorical Concepts by the Example of a Computational Comonad.	RTA	1995	DBLP DOI BibTeX RDF
1	Christopher Lynch, Wayne Snyder	Redundancy Criteria for Constrained Completion.	RTA	1993	DBLP DOI BibTeX RDF
1	Michael Löwe, Martin Beyer	AGG - An Implementation of Algebraic Graph Rewriting.	RTA	1993	DBLP DOI BibTeX RDF
1	Rakesh M. Verma	Smaran: A Congruence-Closure Based System for Equational Computations.	RTA	1993	DBLP DOI BibTeX RDF
1	Leo Bachmair	Rewrite Techniques in Theorem Proving (Abstract).	RTA	1993	DBLP DOI BibTeX RDF
1	Zurab Khasidashvili	Optimal Normalization in Orthogonal Term Rewriting Systems.	RTA	1993	DBLP DOI BibTeX RDF
1	Hantao Zhang 0001	A Case Study of Completion Modulo Distributivity and Abelian Groups.	RTA	1993	DBLP DOI BibTeX RDF
1	Andrea Asperti, Cosimo Laneve	Paths, Computations and Labels in the Lambda-Calculus.	RTA	1993	DBLP DOI BibTeX RDF
1	Pilar Nivela, Robert Nieuwenhuis	Saturation of First-Order (Constrained) Clauses with the Saturate System.	RTA	1993	DBLP DOI BibTeX RDF
1	Anne-Cécile Caron, Jean-Luc Coquidé, Max Dauchet	Encompassment Properties and Automata with Constraints.	RTA	1993	DBLP DOI BibTeX RDF
1	Maribel Fernández	AC Complement Problems: Satisfiability and Negation Elimination.	RTA	1993	DBLP DOI BibTeX RDF
1	Daniel J. Dougherty	Some Lambda Calculi with Categorial Sums and Products.	RTA	1993	DBLP DOI BibTeX RDF
1	Zena M. Ariola	Relating Graph and Term Rewriting via Böhm Models.	RTA	1993	DBLP DOI BibTeX RDF
1	Jordi Levy, Jaume Agustí-Cullell	Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations.	RTA	1993	DBLP DOI BibTeX RDF
1	Jürgen Avenhaus, Jörg Denzinger	Distributing Equational Theorem Proving.	RTA	1993	DBLP DOI BibTeX RDF
1	Maria C. F. Ferreira, Hans Zantema	Total Termination of Term Rewriting.	RTA	1993	DBLP DOI BibTeX RDF
1	Claude Kirchner (eds.)	Rewriting Techniques and Applications, 5th International Conference, RTA-93, Montreal, Canada, June 16-18, 1993, Proceedings	RTA	1993	DBLP DOI BibTeX RDF
1	Jean-Claude Raoult	Recursively Defined Tree Transductions.	RTA	1993	DBLP DOI BibTeX RDF
1	Jean H. Gallier	Proving Properties of Typed Lambda Terms: Realizability, Covers, and Sheaves (Abstract).	RTA	1993	DBLP DOI BibTeX RDF
1	Rolf Backofen	Regular Path Expression in Feature Logic.	RTA	1993	DBLP DOI BibTeX RDF
1	Soumen Chakrabarti, Katherine A. Yelick	On the Correctness of a Distributed Memory Gröbner basis Algorithm.	RTA	1993	DBLP DOI BibTeX RDF
1	Ursula Martin	Linear Interpretations by Counting Patterns.	RTA	1993	DBLP DOI BibTeX RDF
1	Femke van Raamsdonk	Confluence and Superdevelopments.	RTA	1993	DBLP DOI BibTeX RDF
1	Catherine Delor, Laurence Puel	Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols.	RTA	1993	DBLP DOI BibTeX RDF
1	John Field	A Graph Reduction Approach to Incremental Term Rewriting (Preliminary Report).	RTA	1993	DBLP DOI BibTeX RDF
1	Franz Baader, Klaus U. Schulz	Combination Techniques and Decision Problems for Disunification.	RTA	1993	DBLP DOI BibTeX RDF
1	Albert Rubio, Robert Nieuwenhuis	A Precedence-Based Total AC-Compatible Ordering.	RTA	1993	DBLP DOI BibTeX RDF
1	Géraud Sénizergues	Some Undecidable Termination Problems for Semi-Thue Systems (Abstract).	RTA	1993	DBLP DOI BibTeX RDF
1	Brian Matthews	MERILL: An Equational Reasoning System in Standard ML.	RTA	1993	DBLP DOI BibTeX RDF
1	Yexuan Gui, Mitsuhiro Okada	LAMBDALG: Higher Order Algebraic Specification Language.	RTA	1993	DBLP DOI BibTeX RDF
1	David A. Plaisted	Polynomial Time Termination and Constraint Satisfaction Tests.	RTA	1993	DBLP DOI BibTeX RDF
1	Sergei I. Adian	On some Algorithmic Problems for Groups and Monoids.	RTA	1993	DBLP DOI BibTeX RDF
1	Reinhard Bündgen	Reduce the Redex -> ReDuX.	RTA	1993	DBLP DOI BibTeX RDF
1	Joachim Niehren, Andreas Podelski, Ralf Treinen	Equational and Membership Constraints for Finite Trees.	RTA	1993	DBLP DOI BibTeX RDF
1	Aart Middeldorp, Bernhard Gramlich	Simple Termination is Difficult.	RTA	1993	DBLP DOI BibTeX RDF
1	Andreas Werner	A Semantic Approach to Order-Sorted Rewriting.	RTA	1993	DBLP DOI BibTeX RDF
1	Nachum Dershowitz, Charles Hoot	Topics in Termination.	RTA	1993	DBLP DOI BibTeX RDF
1	Mohamed Tajine	The Negation Elimination from Syntactic Equational Formula is Decidable.	RTA	1993	DBLP DOI BibTeX RDF
1	Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop	More Problems in Rewriting.	RTA	1993	DBLP DOI BibTeX RDF
1	Ernst Lippe	Generating Tables for Bottom-Up Matching.	RTA	1993	DBLP DOI BibTeX RDF
1	Max Moser	Improving Transformation Systems for General E-Unification.	RTA	1993	DBLP DOI BibTeX RDF
1	Paliath Narendran, Michaël Rusinowitch	Any Gound Associative-Commutative Theory Has a Finite Canonical System.	RTA	1991	DBLP DOI BibTeX RDF
1	Michel Billaud	ANIGRAF: An Interactive System for the Animation of Graph Rewriting Systems with Priorities.	RTA	1991	DBLP DOI BibTeX RDF
1	Ronald V. Book (eds.)	Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings	RTA	1991	DBLP DOI BibTeX RDF
1	Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop	Open Problems in Rewriting.	RTA	1991	DBLP DOI BibTeX RDF
1	Franz Baader	Unification, Weak Unification, Upper Bound, Lower Bound, and Generalization Problems.	RTA	1991	DBLP DOI BibTeX RDF
1	Dieter Hofbauer	Time Bounded Rewrite Systems and Termination Proofs by Generalized Embedding.	RTA	1991	DBLP DOI BibTeX RDF
1	Maria Paola Bonacina, Jieh Hsiang	On Fairness of Completion-Based Theorem Proving Strategies.	RTA	1991	DBLP DOI BibTeX RDF
1	Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi	Bottom-Up Tree Pushdown Automata and Rewrite Systems.	RTA	1991	DBLP DOI BibTeX RDF	Rewrite systems (=term rewrite systems), Church-Rosser (=confluent) systems, Noetherian systems, Convergent (=noetherian+confluent) systems, (Deterministic) tree automaton with pushdown store, (Recognizable, Context-free) tree languages
1	Stefan Krischer, Alexander Bockmayr	Detecting Redundant Narrowing Derivations by the LSE-SL Reducability Test.	RTA	1991	DBLP DOI BibTeX RDF
1	Sieger van Denneheuvel, Karen L. Kwast, Gerard R. Renardel de Lavalette, Edith Spaan	Query Optimization Using Rewrite Rules.	RTA	1991	DBLP DOI BibTeX RDF
1	Raj Agarwal, David R. Musser, Deepak Kapur, Xumin Nie	The Tecton Proof System.	RTA	1991	DBLP DOI BibTeX RDF
1	Andrea Sattler-Klein	Divergence Phenomena during Completion.	RTA	1991	DBLP DOI BibTeX RDF
1	Jacques Chabin, Pierre Réty	Narrowing Directed by a Graph of Terms.	RTA	1991	DBLP DOI BibTeX RDF
1	Franz-Josef Brandenburg	The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree.	RTA	1991	DBLP DOI BibTeX RDF	boundary and confluent graph grammars, operator normal form, graph languages of bounded degree, graph grammars
1	Daniel J. Dougherty	Adding Algebraic Rewriting to the Untyped Lambda Calculus (Extended Abstract).	RTA	1991	DBLP DOI BibTeX RDF
1	Aart Middeldorp, Yoshihito Toyama	Completeness of Combinations of Constructor Systems.	RTA	1991	DBLP DOI BibTeX RDF
1	William M. Farmer, Ronald J. Watro	Redex Capturing in Term Graph Rewriting (Concise Version).	RTA	1991	DBLP DOI BibTeX RDF
1	Ulrich Fraus	A Narrowing-Based Theorem Prover.	RTA	1991	DBLP DOI BibTeX RDF
1	Frank Drewes, Clemens Lautemann	Incremental Termination Proofs and the Length of Derivations.	RTA	1991	DBLP DOI BibTeX RDF
1	Kai Salomaa	Decidability of Confluence and Termination of Monadic Term Rewriting Systems.	RTA	1991	DBLP DOI BibTeX RDF
1	Albert Gräf	Left-to-Right Tree Pattern Matching.	RTA	1991	DBLP DOI BibTeX RDF
1	Françoise Bellegarde	Program Transformation and Rewriting.	RTA	1991	DBLP DOI BibTeX RDF
1	Gregory Kucherov	On Relationship Between Term Rewriting Systems and Regular Tree Languages.	RTA	1991	DBLP DOI BibTeX RDF
1	Jürgen Avenhaus	Proving Equational and Inductive Theorems by Completion and Embedding Techniques.	RTA	1991	DBLP DOI BibTeX RDF
1	Hélène Kirchner	Proofs in Parameterized Specification.	RTA	1991	DBLP DOI BibTeX RDF
1	Tobias Nipkow, Zhenyu Qian	Modular Higher-Order E-Unification.	RTA	1991	DBLP DOI BibTeX RDF
1	Claude Marché	On Ground AC-Completion.	RTA	1991	DBLP DOI BibTeX RDF
1	Miki Hermann	On Proving Properties of Completion Strategies.	RTA	1991	DBLP DOI BibTeX RDF
1	Eric Domenjoud	AC Unification Through Order-Sorted AC1 Unification.	RTA	1991	DBLP DOI BibTeX RDF
1	Reinhard Bündgen	Simulation Buchberger's Algorithm by Knuth-Bendix Completion.	RTA	1991	DBLP DOI BibTeX RDF
1	R. Ramesh 0001, I. V. Ramakrishnan	Incremental Techniques for Efficient Normalization of Nonlinear Rewrite Systems.	RTA	1991	DBLP DOI BibTeX RDF
1	Francis Klay	Undecidable Properties of Syntactic Theories.	RTA	1991	DBLP DOI BibTeX RDF
1	Franz Baader, Werner Nutt	Adding Homomorphisms to Commutative/Monoidal Theories or How Algebra Can Help in Equational Unification.	RTA	1991	DBLP DOI BibTeX RDF
1	Wayne Snyder, Christopher Lynch	Goal Directed Strategies for Paramodulation.	RTA	1991	DBLP DOI BibTeX RDF
1	David A. Wolfram	Rewriting, and Equational Unification: the Higher-Order Cases.	RTA	1991	DBLP DOI BibTeX RDF
1	Loic Pottier	Minimal Solutions of Linear Diophantine Systems: Bounds and Algorithms.	RTA	1991	DBLP DOI BibTeX RDF
1	Pierre-Louis Curien, Giorgio Ghelli	On Confluence for Weakly Normalizing Systems.	RTA	1991	DBLP DOI BibTeX RDF
1	Dave Cohen, Phil Watson	An Efficient Representation of Arithmetic for Term Rewriting.	RTA	1991	DBLP DOI BibTeX RDF
1	Rolf Socher-Ambrosius	Boolean Algebra Admits No Convergent Term Rewriting System.	RTA	1991	DBLP DOI BibTeX RDF	Term Rewriting, Boolean Algebra, Automated Theorem Proving
1	Aline Deruyver	EMMY: A Refutational Theorem Prover for First-Order Logic with Equation.	RTA	1991	DBLP DOI BibTeX RDF
1	Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries	Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract).	RTA	1991	DBLP DOI BibTeX RDF	orthogonal term rewriting systems, infinitary rewriting, strong converging reductions, infinite Church-Rosser Properties, Böhm Trees, head normal forms, non-unifiable term rewriting systems, normal forms
1	Mike Lai	On How To Move Mountains 'Associatively and Commutatively'.	RTA	1989	DBLP DOI BibTeX RDF
1	Dieter Hofbauer, Clemens Lautemann	Termination Proofs and the Length of Derivations (Preliminary Version).	RTA	1989	DBLP DOI BibTeX RDF
1	Aart Middeldorp	Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms.	RTA	1989	DBLP DOI BibTeX RDF
1	Hubert Bertling, Harald Ganzinger	Completion-Time Optimization of Rewrite-Time Goal Solving.	RTA	1989	DBLP DOI BibTeX RDF
1	John Darlington, Yike Guo	Narrowing and Unification in Functional Programming - An Evaluation Mechanism for Absolute Set Abstraction.	RTA	1989	DBLP DOI BibTeX RDF
1	Max Dauchet, Aline Deruyver	Compilation of Ground Term Rewriting Systems and Applications.	RTA	1989	DBLP DOI BibTeX RDF
1	Tohru Naoi, Yasuyoshi Inagaki	Algebraic Semantics and Complexity of Term Rewriting Systems.	RTA	1989	DBLP DOI BibTeX RDF
1	Reinhard Bündgen, Wolfgang Küchlin	Computing Ground Reducability and Inductively Complete Positions.	RTA	1989	DBLP DOI BibTeX RDF
1	Stéphane Kaplan, Christine Choppy	Abstract Rewriting with Concrete Operations.	RTA	1989	DBLP DOI BibTeX RDF
1	Stephen J. Garland, John V. Guttag	An Overview of LP, The Larch Power.	RTA	1989	DBLP DOI BibTeX RDF
1	Timothy B. Baird, Gerald E. Peterson, Ralph W. Wilkerson	Complete Sets of Reductions Modulo Associativity, Commutativity and Identity.	RTA	1989	DBLP DOI BibTeX RDF
1	Robert Strandh	Classes of Equational Programs that Compile into Efficient Machine Code.	RTA	1989	DBLP DOI BibTeX RDF
1	Jim Christian	Fast Knuth-Bendix Completion: Summary.	RTA	1989	DBLP DOI BibTeX RDF
1	Naomi Lindenstrauss	A Parallel Implementation of Rewriting and Narrowing.	RTA	1989	DBLP DOI BibTeX RDF

Publications at "RTA"( http://dblp.L3S.de/Venues/RTA )