Search results for "RTA"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Ana Paula Tomás, Miguel Filgueiras	Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space.	RTA	1997	DBLP DOI BibTeX RDF
1	Hans Zantema	Termination of Context-Sensitive Rewriting.	RTA	1997	DBLP DOI BibTeX RDF
1	Samuel M. H. W. Perlo-Freeman, Péter Pröhle	Scott's Conjecture is True, Position Sensitive Weights.	RTA	1997	DBLP DOI BibTeX RDF
1	Friedrich Otto	On the Property of Preserving Regularity for String-Rewriting Systems.	RTA	1997	DBLP DOI BibTeX RDF
1	Kazuhiro Ogata 0001, Koichi Ohhara, Kokichi Futatsugi	TRAM: An Abstract Machine for Order-Sorted Conditioned Term Rewriting Systems.	RTA	1997	DBLP DOI BibTeX RDF
1	Sergei G. Vorobyov	The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable.	RTA	1997	DBLP DOI BibTeX RDF
1	Yves Lafont	Two-Dimensional Rewriting.	RTA	1997	DBLP DOI BibTeX RDF
1	Leo Bachmair, Ashish Tiwari 0001	D-Bases for Polynomial Ideals over Commutative Noetherian Rings.	RTA	1997	DBLP DOI BibTeX RDF
1	Denis Béchet, Philippe de Groote, Christian Retoré	A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders.	RTA	1997	DBLP DOI BibTeX RDF
1	Deepak Kapur, G. Sivakumar	A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems.	RTA	1997	DBLP DOI BibTeX RDF
1	Klaus U. Schulz	A Criterion for Intractability of E-unification with Free Function Symbols and Its Relevance for Combination Algorithms.	RTA	1997	DBLP DOI BibTeX RDF
1	Edward L. Green, Lenwood S. Heath, Benjamin J. Keller	Opal: A System for Computing Noncommutative Gröbner Bases.	RTA	1997	DBLP DOI BibTeX RDF
1	Friedrich Otto, Masashi Katsura, Yuji Kobayashi	Cross-Sections for Finitely Presented Monoids with Decidable Word Problems.	RTA	1997	DBLP DOI BibTeX RDF
1	Hubert Comon (eds.)	Rewriting Techniques and Applications, 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997, Proceedings	RTA	1997	DBLP DOI BibTeX RDF
1	Christopher Lynch	Goal-Directed Completion Using SOUR Graphs.	RTA	1997	DBLP DOI BibTeX RDF
1	Ulrich Kühler, Claus-Peter Wirth	Conditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving.	RTA	1997	DBLP DOI BibTeX RDF
1	Deepak Kapur	Shostak's Congruence Closure as Completion.	RTA	1997	DBLP DOI BibTeX RDF
1	Nachum Dershowitz	Innocuous Constructor-Sharing Combinations.	RTA	1997	DBLP DOI BibTeX RDF
1	Thomas Arts, Jürgen Giesl	Proving Innermost Normalisation Automatically.	RTA	1997	DBLP DOI BibTeX RDF
1	Jerzy Marcinkowski	Undecidability of the First Order Theory of One-Step Right Ground Rewriting.	RTA	1997	DBLP DOI BibTeX RDF
1	Georg Struth	On the Word Problem for Free Lattices.	RTA	1997	DBLP DOI BibTeX RDF
1	Richard Statman	Effective Reduction and Conversion Strategies for Combinators.	RTA	1997	DBLP DOI BibTeX RDF
1	Manfred Göbel	The Invariant Package of MAS.	RTA	1997	DBLP DOI BibTeX RDF
1	Christophe Ringeissen	Prototyping Combination of Unification Algorithms with the ELAN Rule-Based Programming Language.	RTA	1997	DBLP DOI BibTeX RDF
1	Michio Oyamaguchi, Yoshikatsu Ohta	A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting Systems.	RTA	1997	DBLP DOI BibTeX RDF
1	Thomas Hillenbrand, Arnim Buch, Roland Fettig	On Gaining Efficiency in Completion-Based Theorem Proving.	RTA	1996	DBLP DOI BibTeX RDF
1	Evelyne Contejean, Claude Marché	CiME: Completion Modulo E.	RTA	1996	DBLP DOI BibTeX RDF
1	Alexandre Boudet, Evelyne Contejean, Claude Marché	AC-Complete Unification and its Application to Theorem Proving.	RTA	1996	DBLP DOI BibTeX RDF
1	Maria C. F. Ferreira	Dummy Elimination in Equational Rewriting.	RTA	1996	DBLP DOI BibTeX RDF
1	Stefano Guerrini, Simone Martini 0001, Andrea Masini	Coherence for Sharing Proof Nets.	RTA	1996	DBLP DOI BibTeX RDF
1	Roel Bloo, Kristoffer Høgsbro Rose	Combinatory Reduction Systems with Explicit Substitution that Preserve Strong Nomalisation.	RTA	1996	DBLP DOI BibTeX RDF
1	Claude Kirchner, Christopher Lynch, Christelle Scharff	Fine-Grained Concurrent Completion.	RTA	1996	DBLP DOI BibTeX RDF
1	Ralf Treinen	The First-Order Theory of One-Step Rewriting is Undecidable.	RTA	1996	DBLP DOI BibTeX RDF
1	Mark T. Vandevoorde, Deepak Kapur	Distributed Larch Prover (DLP): An Experiment in Parallelizing a Rewrite-Rule Based Prover.	RTA	1996	DBLP DOI BibTeX RDF
1	Masahiko Sakai, Yoshihito Toyama	Semantics and Strong Sequentiality of Priority Term Rewriting Systems.	RTA	1996	DBLP DOI BibTeX RDF
1	Delia Kesner	Confluence Properties of Extensional and Non-Extensional lambda-Calculi with Explicit Substitutions (Extended Abstract).	RTA	1996	DBLP DOI BibTeX RDF
1	Roland Fettig, Bernd Löchner	Unification of Higher-Order patterns in a Simply Typed Lambda-Calculus with Finite Products and terminal Type.	RTA	1996	DBLP DOI BibTeX RDF
1	H. R. Walters, J. F. Th. Kamperman	EPIC: An Equational Language -Abstract Machine Supporting Tools-.	RTA	1996	DBLP DOI BibTeX RDF
1	Régis Curien, Zhenyu Qian, Hui Shi 0001	Efficient Second-Order Matching.	RTA	1996	DBLP DOI BibTeX RDF
1	Roberto Virga	Higher-Order Superposition for Dependent Types.	RTA	1996	DBLP DOI BibTeX RDF
1	Bernhard Gramlich	On Proving Termination by Innermost Termination.	RTA	1996	DBLP DOI BibTeX RDF
1	Manfred Göbel	Symideal Gröbner Bases.	RTA	1996	DBLP DOI BibTeX RDF
1	Narjes Berregeb, Adel Bouhoula, Michaël Rusinowitch	SPIKE-AC: A System for Proofs by Induction in Associative-Commutative Theories.	RTA	1996	DBLP DOI BibTeX RDF
1	Gérard P. Huet	Design Proof Assistant (Abstract).	RTA	1996	DBLP DOI BibTeX RDF
1	Florent Jacquemard	Decidable Approximations of Term Rewriting Systems.	RTA	1996	DBLP DOI BibTeX RDF
1	Reinhard Bündgen, Carsten Sinz, Jochen Walter	ReDuX 1.5: New Facets of Rewriting.	RTA	1996	DBLP DOI BibTeX RDF
1	M. R. K. Krishna Rao	Modularity of Termination in Term Graph Rewriting.	RTA	1996	DBLP DOI BibTeX RDF
1	Manfred Schmidt-Schauß	An Algorithm for Distributive Unification.	RTA	1996	DBLP DOI BibTeX RDF
1	Bernhard Gramlich, Claus-Peter Wirth	Confluence of Terminating Conditional Rewrite Systems Revisited.	RTA	1996	DBLP DOI BibTeX RDF
1	Deepak Kapur	Rewrite-Based Automated Reasoning: Challenges Ahead.	RTA	1996	DBLP DOI BibTeX RDF
1	Harald Ganzinger (eds.)	Rewriting Techniques and Applications, 7th International Conference, RTA-96, New Brunswick, NJ, USA, July 27-30, 1996, Proceedings	RTA	1996	DBLP DOI BibTeX RDF
1	Géraud Sénizergues	On the Termination Problem for One-Rule Semi-Thue System.	RTA	1996	DBLP DOI BibTeX RDF	rational monoid, automatic structure, termination, finite automata, semi-Thue systems
1	Michael Hanus, Christian Prehofer	Higher-Order Narrowing with Definitional Trees.	RTA	1996	DBLP DOI BibTeX RDF
1	Klaus Madlener	Applications of Rewrite Techniques in Monoids and Rings (Abstract).	RTA	1996	DBLP DOI BibTeX RDF
1	Roberto Di Cosmo	On the Power of Simple Diagrams.	RTA	1996	DBLP DOI BibTeX RDF
1	Marian Vittek	A Compiler for Nondeterministic Term Rewriting Systems.	RTA	1996	DBLP DOI BibTeX RDF
1	Frédéric Voisin	A New Proof Manager and Graphic Interface for Larch Prover.	RTA	1996	DBLP DOI BibTeX RDF
1	Vincent van Oostrom	Higher-Order Families.	RTA	1996	DBLP DOI BibTeX RDF
1	Thomas Arts, Jürgen Giesl	Termination of Constructor Systems.	RTA	1996	DBLP DOI BibTeX RDF
1	Jean-Pierre Jouannaud, Albert Rubio	A Recursive Path Ordering for Higher-Order Terms in eta-Long beta-Normal Form.	RTA	1996	DBLP DOI BibTeX RDF
1	Christoph Lüth	Compositional Term Rewriting: An Algebraic Proof of Toyama's Theorem.	RTA	1996	DBLP DOI BibTeX RDF
1	Jordi Levy	Linear Second-Order Unification.	RTA	1996	DBLP DOI BibTeX RDF
1	Jürgen Stuber	Superposition Theorem Proving for Albelian Groups Represented as Integer Modules.	RTA	1996	DBLP DOI BibTeX RDF
1	Peter Graf	Substitution Tree Indexing.	RTA	1995	DBLP DOI BibTeX RDF
1	Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi	Completion for Multiple Reduction Orderings.	RTA	1995	DBLP DOI BibTeX RDF
1	Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop	Problems in Rewriting III.	RTA	1995	DBLP DOI BibTeX RDF
1	Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries	Infinitary Lambda Calculi and Böhm Models.	RTA	1995	DBLP DOI BibTeX RDF
1	Olav Lysne, Javier Piris	A Termination Ordering for Higher Order Rewrite System.	RTA	1995	DBLP DOI BibTeX RDF
1	M. Randall Holmes	Disguising Recursively Chained Rewrite Rules as Equational Theorems, as Implemented in the Prover EFTTP Mark 2.	RTA	1995	DBLP DOI BibTeX RDF
1	Stefan Kahrs	Towards a Domain Theory for Termination Proofs.	RTA	1995	DBLP DOI BibTeX RDF
1	Alberto Paccanaro	Guiding Term Reduction Through a Neural Network: Some Prelimanary Results for the Group Theory.	RTA	1995	DBLP DOI BibTeX RDF
1	Jürgen Avenhaus, Jörg Denzinger, Matthias Fuchs	DISCOUNT: A SYstem for Distributed Equational Deduction.	RTA	1995	DBLP DOI BibTeX RDF
1	Hélène Kirchner, Pierre-Etienne Moreau	Prototyping Completion with Constraints Using Computational Systems.	RTA	1995	DBLP DOI BibTeX RDF
1	Ta Chen, Siva Anantharaman	STORM: A MAny-to-One Associative-Commutative Matcher.	RTA	1995	DBLP DOI BibTeX RDF
1	Jochen Burghardt	Regular Substitution Sets: A Means of Controlling E-Unification.	RTA	1995	DBLP DOI BibTeX RDF
1	Klaus Schmid, Roland Fettig	Towards an Efficient Construction of Test Sets for Deciding Ground Reducability.	RTA	1995	DBLP DOI BibTeX RDF
1	Jieh Hsiang (eds.)	Rewriting Techniques and Applications, 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995, Proceedings	RTA	1995	DBLP DOI BibTeX RDF
1	Andrea Corradini 0001, Fabio Gadducci, Ugo Montanari	Relating Two Categorial Models of Term Rewriting.	RTA	1995	DBLP DOI BibTeX RDF	concurrency, term rewriting, rewriting logic, categorical models
1	Mark E. Stickel	Term Rewriting in Contemporary Resolution Theorem Proving (Abstract).	RTA	1995	DBLP DOI BibTeX RDF
1	Tobias Nipkow	Higher-Order Rewrite Systems (Abstract).	RTA	1995	DBLP DOI BibTeX RDF
1	Jürgen Giesl	Generating Polynomial Orderings for Termination Proofs.	RTA	1995	DBLP DOI BibTeX RDF
1	Yuri V. Matiyasevich	On Some Mathematical Logic Contributions to Rewriting Techniques: Lost Heritage (Abstract).	RTA	1995	DBLP DOI BibTeX RDF
1	Habib Abdulrab, Marianne Maksimenko	General Solution of Systems of Linear Diophantine Equations and Inequations.	RTA	1995	DBLP DOI BibTeX RDF
1	Siva Anantharaman, Gilles Richard	A Rewrite Mechanism for Logic Programs with Negation.	RTA	1995	DBLP DOI BibTeX RDF	linear completion, logic program, constraints, rewrite system, negation
1	Massimo Marchiori	Modularity of Completeness Revisited.	RTA	1995	DBLP DOI BibTeX RDF
1	Géraud Sénizergues	A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems.	RTA	1995	DBLP DOI BibTeX RDF	two tape finite automata, confluence, semi-Thue systems
1	Hans Zantema, Alfons Geser	A Complete Characterization of Termination of Op 1q -> 1r Os.	RTA	1995	DBLP DOI BibTeX RDF	simple termination, transformation ordering, dummy elimination, derivation length, termination, term rewriting, string rewriting
1	Reinhard Bündgen, Manfred Göbel, Wolfgang Küchlin	Parallel ReDuX -> PaReDuX.	RTA	1995	DBLP DOI BibTeX RDF
1	Richard J. Boulton	A Restricted Form on Higher-Order Rewriting Applied to an HDL Semantics.	RTA	1995	DBLP DOI BibTeX RDF
1	Pierre Lescanne, Jocelyne Rouyer-Degli	Explicit Substitutions with de Bruijn's Levels.	RTA	1995	DBLP DOI BibTeX RDF
1	H. R. Walters, Hans Zantema	Rewrite Systems for Integer Arithmetic.	RTA	1995	DBLP DOI BibTeX RDF
1	Françoise Bellegarde	ASTRE: Towards a Fully Automated Program Transformation System.	RTA	1995	DBLP DOI BibTeX RDF
1	Jacques Chazarain, Serge Muller	LEMMA: A System for Automated Synthesis of Recursive Programs in Equational Theories.	RTA	1995	DBLP DOI BibTeX RDF
1	Ilies Alouini	Concurrent Garbage Collection for Concurrent Rewriting.	RTA	1995	DBLP DOI BibTeX RDF	Concurrent rewriting, Concurrent garbage collection algorithms, Graph rewriting, MIMD architectures
1	Andrea Asperti	deltao!Epsilon = 1 - Optimizing Optimal lambda-Calculus Implementations.	RTA	1995	DBLP DOI BibTeX RDF
1	J. F. Th. Kamperman, H. R. Walters	Lazy Rewriting and Eager Machinery.	RTA	1995	DBLP DOI BibTeX RDF
1	Franz Baader, Klaus U. Schulz	Combination of Constraint Solving Techniques: An Algebraic POint of View.	RTA	1995	DBLP DOI BibTeX RDF
1	Taro Suzuki, Aart Middeldorp, Tetsuo Ida	Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides.	RTA	1995	DBLP DOI BibTeX RDF
1	Steffen van Bakel, Maribel Fernández	(Head-) Normalization of Typeable Rewrite Systems.	RTA	1995	DBLP DOI BibTeX RDF
1	Robert Nieuwenhuis	On Narrowing, Refutation Proofs and Constraints.	RTA	1995	DBLP DOI BibTeX RDF

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