Conferences in DBLP
Deepak Kapur Rewrite-Based Automated Reasoning: Challenges Ahead. [Citation Graph (0, 0)][DBLP ] Conf ] Claude Kirchner , Christopher Lynch , Christelle Scharff Fine-Grained Concurrent Completion. [Citation Graph (0, 0)][DBLP ] Conf ] Alexandre Boudet , Evelyne Contejean , Claude Marché AC-Complete Unification and its Application to Theorem Proving. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Stuber Superposition Theorem Proving for Albelian Groups Represented as Integer Modules. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Göbel Symideal Gröbner Bases. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Arts , Jürgen Giesl Termination of Constructor Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Maria C. F. Ferreira Dummy Elimination in Equational Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Bernhard Gramlich On Proving Termination by Innermost Termination. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Pierre Jouannaud , Albert Rubio A Recursive Path Ordering for Higher-Order Terms in eta -Long beta -Normal Form. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Virga Higher-Order Superposition for Dependent Types. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Hanus , Christian Prehofer Higher-Order Narrowing with Definitional Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Gérard P. Huet Design Proof Assistant (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Marian Vittek A Compiler for Nondeterministic Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Roel Bloo , Kristoffer Høgsbro Rose Combinatory Reduction Systems with Explicit Substitution that Preserve Strong Nomalisation. [Citation Graph (0, 0)][DBLP ] Conf ] Delia Kesner Confluence Properties of Extensional and Non-Extensional lambda -Calculi with Explicit Substitutions (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Di Cosmo On the Power of Simple Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Stefano Guerrini , Simone Martini , Andrea Masini Coherence for Sharing Proof Nets. [Citation Graph (0, 0)][DBLP ] Conf ] M. R. K. Krishna Rao Modularity of Termination in Term Graph Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Bernhard Gramlich , Claus-Peter Wirth Confluence of Terminating Conditional Rewrite Systems Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Madlener Applications of Rewrite Techniques in Monoids and Rings (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Lüth Compositional Term Rewriting: An Algebraic Proof of Toyama's Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Ralf Treinen The First-Order Theory of One-Step Rewriting is Undecidable. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Schmidt-Schauß An Algorithm for Distributive Unification. [Citation Graph (0, 0)][DBLP ] Conf ] Géraud Sénizergues On the Termination Problem for One-Rule Semi-Thue System. [Citation Graph (0, 0)][DBLP ] Conf ] Régis Curien , Zhenyu Qian , Hui Shi Efficient Second-Order Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Jordi Levy Linear Second-Order Unification. [Citation Graph (0, 0)][DBLP ] Conf ] Roland Fettig , Bernd Löchner Unification of Higher-Order patterns in a Simply Typed Lambda-Calculus with Finite Products and terminal Type. [Citation Graph (0, 0)][DBLP ] Conf ] Florent Jacquemard Decidable Approximations of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Masahiko Sakai , Yoshihito Toyama Semantics and Strong Sequentiality of Priority Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Vincent van Oostrom Higher-Order Families. [Citation Graph (0, 0)][DBLP ] Conf ] Frédéric Voisin A New Proof Manager and Graphic Interface for Larch Prover. [Citation Graph (0, 0)][DBLP ] Conf ] Reinhard Bündgen , Carsten Sinz , Jochen Walter ReDuX 1.5: New Facets of Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Evelyne Contejean , Claude Marché Ci ME: Completi on Modulo E . [Citation Graph (0, 0)][DBLP ] Conf ] Mark T. Vandevoorde , Deepak Kapur Distributed Larch Prover (DLP): An Experiment in Parallelizing a Rewrite-Rule Based Prover. [Citation Graph (0, 0)][DBLP ] Conf ] H. R. Walters , J. F. Th. Kamperman EPIC: An Equational Language -Abstract Machine Supporting Tools-. [Citation Graph (0, 0)][DBLP ] Conf ] Narjes Berregeb , Adel Bouhoula , Michaël Rusinowitch SPIKE-AC: A System for Proofs by Induction in Associative-Commutative Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Hillenbrand , Arnim Buch , Roland Fettig On Gaining Efficiency in Completion-Based Theorem Proving. [Citation Graph (0, 0)][DBLP ] Conf ] 