International Conference on
      	
      	
      	Rewriting Techniques and Applications (RTA)
      	
      
    
    
    
    
	
	From 2016, RTA is replaced by
	FSCD
	
	
    
    Equational reasoning is an important component in symbolic
    algebra, automated deduction, high-level programming languages, program
    verification, and artificial intelligence.  Reasoning with equations
    involves deriving consequences of given equations and finding values for
    variables that satisfy a given equation.
    Rewriting is a
    very powerful method for dealing with equations.
    Directed equations, called rewrite rules, are used to replace
    equals by equals, but only in the indicated direction.  The theory of
    rewriting centers around the concept of normal form, an expression
    that cannot be rewritten any further.  Computation consists of rewriting to
    a normal form; when the normal form is unique, it is taken as the value of
    the initial expression.  When rewriting equal terms always leads to the same 
    normal form, the set of rules is said to be convergent and
    rewriting can be used to check for equality.
    The International Conference on Rewriting Techniques and Applications (RTA)
    is the major conference in the domain of rewriting.  Its creation has been
    decided after the Workshop on the Rewrite Rule Laboratory,
    held in Schenectady (NY) in September 1983. From 1985 to 1993, RTA has been
    a bi-annual conference.  In 1995, RTA has been merged with the Workshop on
    Conditional (and Typed) Term Rewriting Systems (CTRS)
    and has become an annual conference.
    RTA has been classified as a class A conference by CORE, and is in
	    the top 23% in the CiteSeer impact list!
    
    The conference on Rewriting Techniques and Applications solicits oroginal
    papers on all aspects of rewriting, including
    (but not limited to):
    
      - Applications:
	case studies; rule-based programming; symbolic and algebraic
	computation; theorem proving; functional and logic programming; proof
	checking.
- Foundations:
	matching and unification; completion techniques; strategies; constraint
	solving; explicit substitutions; tree automata.
- Frameworks:
	string, term, and graph rewriting; lambda-calculus and higher-order
	rewriting; conditional rewriting; proof nets; categorical and infinitary
	rewriting.
- Implementation:
	compilation techniques; parallel execution; rewriting tools.
- Semantics:
	equational logic; rewriting logic.
In addition to full research papers, systems descriptions and problem sets
    that provide realistic, interesting challenges in the field of rewriting
    techniques are also welcome. High quality papers on applications of
    rewriting techniques are particularly encouraged.
    The conference proceedings are published by Springer-Verlag as part of their
    Lecture Notes in Computer Science series.
    
    
      - 
	RTA-26:
	Warsaw (Poland), June 29 - July 3, 2015.
 PC Chair: Maribel Fernandez (London).
 Conference Chair: Aleksy Schubert (Warsaw).
 Invited speakers:
	  - Grigore Roşu, Matching Logic
- Carolyn Talcott, Executable Formal Models in
	      Rewriting Logic
- Hélène Kirchner, Port Graphs, Rules and Strategies
	      for Dynamic Data Analytics
 Best paper:
	  - Joerg Endrullis, Helle Hvid Hansen, Dimitri Hendriks,
	    Andrew Polonsky and Alexandra Silva, A Coinductive
	    Framework for Infinitary Rewriting and Equational
	    Reasoning
 Submitted: 43,
	Accepted: 22 (including 3 systems)
 Web site,
	Proceedings,
	Call for papers,
	Minutes of the
	  Business Meeting.
 RTA was part of RDP 2015.
- 
	RTA-25, joint with TLCA:
	Vienna (Austria), July 14-17, 2014.
 PC Chair: Gilles Dowek (Paris).
 Conference Chair:  Gernot Salzer (Vienna).
 Invited speakers:
	  - Nicolas Gambino, A Unified Approach to Univalent Foundations and Homotopical Algebra
- Manfred Schmidt-Schauss, Concurrent Programming Languages and Methods for Semantic Analyses
- Nobuko Yoshida, Process Types as a Descriptive Tool for Distributed Protocols
 Best paper:
	  - Sylvain Schmitz, Implicational Relevance Logics is 2-ExpTime-Complete
 Submitted: 87,
	Accepted: 31
 Web site,
	Call for papers,
	Minutes of the
	  Business Meeting.
 RTA was be part of FLoC 2014 at VSL 2014.
- 
	RTA-24:
	Eindhoven (The Netherlands), June 24-26, 2013.
 PC Chair: Femke van Raamsdonk (Amsterdam).
 Conference Chair: Hans Zantema (Eindhoven).
 Invited speakers:
	  - Simon Peyton-Jones, Type-directed Compilation in the Wild: Haskell and Core
- Jarkko Kari, Pattern Generation by Cellular Automata
- Mitsu Okada, Husserl and Hilbert on Completeness
	      and Husserl's Term Rewrite-based Theory of
	      Multiplicity
 Best papers:
	  - B. Accattoli, Linear Logic and Strong
	      Normalization
- Y. Guiraud, P. Malbos and S. Mimram, A Homotopical
	      Completion Procedure with Applications to Coherence of
	      Monoids
 Submitted: 50,
	Accepted: 21
 Web site,
	Proceedings,
	Call for papers,
	Minutes of the
	  Business Meeting.
 RTA was be part of RDP 2013.
- 
	RTA-23:
	Nagoya (Japan), May 28 - June 2, 2012.
 PC Chair: Ashish Tiwari (SRI).
 Conference Chair: Masahiko Sakai (Nagoya).
 Invited speakers:
	  - Hirokazu Anai, Computational Real Algebraic Geometry in Practice
- Claude Kirchner, Rho-Calculi for Computation and Logic
- Sebastian Maneth, Dictionary-Based Tree Compression
 Best paper: Kazushige Terui,
	Semantic Evaluation, Intersection Types and Complexity of
	Simply Typed Lambda Calculus
 Submitted: 46,
	Accepted: 22
 Web site,
	Proceedings,
	Call for papers,
	Minutes of
	  the Business Meeting.
 
- 
	RTA-22:
	Novi Sad (Serbia), May 30 - June 1, 2011.
 PC Chair: Manfred Schmidt-Schauss (Frankfurt am Main).
 Conference Chair: Silvia Ghilezan (Novi Sad).
 Invited speakers:
	  - Sophie Tison, Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?
- Ashish Tiwari, Rewriting in Practice
- Stephanie Weirich, Combining Proofs and Programs
 Best paper: Aaron Stump, Garrin Kimmell and Roba El-Haj
	  Omar, Type Preservation as a Confluence Problem
 Submitted: 46,
	Accepted: 28 (including 8 systems)
 Web site,
	  Proceedings,
	Call for papers.
	Minutes of the Business
	  Meeting.
 RTA was part of RDP 2011.
- 
	RTA-21:
	Edinburgh (Scotland), July 11-13, 2010.
 PC Chair: Christopher Lynch (Potsdam).
 Conference Chair: Fairouz Kamareddine (Edinburgh).
 Invited speakers:
	  - M. Bojanczyk, Automata for Data Words and Data Trees
- V. van Oostrom, Realizing Optimal Sharing
 Best papers:
	  - P. Bahr, Partial Order Rewriting and Böhm Trees
- P. Bahr, Abstract Models Of Transfinite Reductions
 Submitted: 48,
	Accepted: 26 (including 3 systems)
 Web site,
	  Call for papers,
	  Proceedings,
	  Minutes of the Business
	    Meeting.
 RTA was part of FLOC 2010.
- 
	RTA-20:
	Brasília (Brazil), June 29 - July 1, 2009. LNCS 5595.
 PC Chair: Ralf Treinen (Paris).
 Conference Chair: Mauricio Ayala-Rincón (Brasilia).
 Invited speakers:
	  - V. Danos, 
- J. Waldmann, Automatic Termination
- R. Harper,  (joint with TLCA)
 Best papers:
	  - M. de Falco, An Explicit Framework for Interaction Nets
- J. Endrullis and D. Hendriks, From Outermost to Context-Sensitive Rewriting
 Submitted: 59,
	Accepted: 26 (including 4 systems)
 Web site,
	  Call for papers,
	  Minutes of the Business
	    Meeting.
 RTA was part of RDP 2009,
	that was held from June 28th to July 3rd.
 (TLCA PC Chair: Pierre-Louis Curien (Paris))
- 
	RTA-19:
	Hagenberg/Linz (Austria), July 15-17, 2008. LNCS 5117.
 PC Chair: Andrei Voronkov (Manchester).
 Conference Chair: Bruno Buchberger and Temur Kutsia (Linz).
 Invited speakers:
	  - V. Cortier,  Verification Techniques for Cryptographic Protocols
- T. Hillenbrand, Fast Equational Reasoning with Waldmeister
- A. Rubio, Present and Future of Proving Termination of Rewriting
- E. Kaltofen, The algebraic Synthesis of Algorithms (tutorial)
 Submitted: 57,
	Accepted: 30
 Web site,
	  Call for papers,
	  BibTeX file,
	  Minutes of the Business
	    Meeting.
- 
	RTA-18:
	Paris (France), June 26-28, 2007. LNCS 4533.
 PC Chair: Franz Baader (Dresden).
 Conference Chair: Ralf Treinen (ENS Cachan) and Xavier Urbain (IIE-CNAM, Evry).
 Invited speakers:
	  - X. Leroy, Formal Verification of an Optimizing Compiler
- R. Nieuwenhuis, Challenges in Satisfiability modulo Theories
- F. Pfenning, On a Logical Foundation for Explicit
	      Substitutions (joint with TLCA)
 Best paper: L. Vaux, On Linear Combinations of lamda-Terms
 Submitted: 69,
	Accepted: 27 (including 3 systems)
 Web site,
	Call for papers,
	  BibTeX file,
	  Minutes of the Business
	    Meeting.
 RTA-18 was part of
	RDP,
	the Federated Conference on Rewriting, Deduction, and Programming.
- 
	RTA-17:
	Seattle (WA, USA), August 12-14, 2006. LNCS 4098.
 PC Chair: Frank Pfenning (CMU)
 Conference Chair: Ashish Tiwari (SRI)
 Invited speakers:
	  - R. Bryant, Formal Verification of Infinite State Systems using Boolean Methods (FLoC plenary)
- J. Esparza, Rewriting Models of Control-Flow
- J. Giesl, Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
 Best paper: D. Hofbauer and J. Waldmann, Termination of String Rewriting with Matrix Interpretations
 Submitted: 52,
	Accepted: 27 (including 4 systems)
 Web site,
	  Call for papers,
	  Program,
	  BibTeX file,
	  Minutes of the Business
	    Meeting.
 RTA-17 was part of
	FLoC,
	the Federated Logic Conference.
- 
	RTA-16:
	Nara (Japan), April 19-21, 2005. LNCS 3467.
 PC Chair: Jürgen Giesl (Aachen)
 Conference Chair: Hitoshi Ohsaki
 Invited speakers:
	  - Y. Toyama, Confluent Term Rewriting Systems
- P. Wadler, Call-by-Value is dual to Call-by-Name, Reloaded
- A. Felty, A Tutorial Example of the Semantic
	      Approach to Foundational Proof-Carrying Code (joint
	    with TLCA)
 Invited speakers: (special session on history and future
	  of RTA and rewriting)
	  - G. Huet, Before RTA: Early Days in  Rewriting Research
- J.-P. Jouannaud, Twenty Years Later
- N. Dershowitz, Open. Closed. Open.
 Best paper: D. Kesner and S. Legrand, Extending the Explicit Substitution Paradigm
 Student travel grants:
	  - J. Rocheteau, lambda-my-calculus and Duality: Call-by-Name and Call-by-Value
- W. Moczydlowski, Termination of Single-Threaded One-Rule Semi-Thue Systems
 Submitted: 79,
	Accepted: 31 (including 2 systems)
 Web site,
	  Call for papers,
	  LNCS 3467,
	  BibTeX file,
	  Minutes of the Business
	    Meeting.
 RTA-16 was a major event of
	RDP'05
	(April 19-23, 2005), together with TLCA.
- 
	RTA-15:
	Aachen (Germany), June 1-5, 2004. LNCS 3091.
 PC Chair: Vincent van Oostrom (Utrecht)
 Conference Chair: Jürgen Giesl (Aachen)
 Invited speakers:
	  - N. D. Jones and N. Bohr, Termination Analysis of the Untyped lamba-Calculus
- N. Hirokawa and A. Middeldorp, Dependency Pairs Revisited
- R. Milner, Bigraphs, Link Graphs, Transitions and Nets
 Submitted: 43,
	Accepted: 19 (including 5 systems)
 Web site,
	  Call for papers,
	  LNCS 3091,
	  BibTeX file,
	  Minutes of the Business
	    Meeting.
 RTA-15 was the major event of
	RDP'04, the
	Federated Conference on Rewriting, Deduction and Programming.
- 
	RTA-14:
	Valencia (Spain), June 9-11, 2003. LNCS 2706.
 PC Chair: Robert Nieuwenhuis (Barcelona)
 Conference Chair: Salvador Lucas (Valencia)
 Invited speakers:
	  - D. McAllester, A Logical Algorithm for ML Type
	  Inference (joint with TLCA)
- P. Lincoln, Symbolic System Biology
- J.-L. Giavitto, Topological Collections, Transformations and their Application to the Modeling and the Simulation of Dynamical Systems
 Best papers:
	  - S. Salvati and P. de Groote, On the Complexity of Higher Order Matching in the Linear Lambda Calculus
- S. Dal Zilio and D. Lugiez, XML Schema, Tree Logic and Sheaves Automata
- N. Hirokawa and A. Middeldorp, Tsukuba Termination Tool
 Submitted: 61,
	Accepted: 32 (including 6 systems)
 Web site,
	  Call for papers,
	  Contents,
	  BibTeX file,
	  Minutes of the Business
	    Meeting.
 RTA-14 was part of the Federated Conference on Rewriting,
	  Deduction and Programming
 	  (RDP'03),
 	  together with the 6th Conference on Typed Lambda Calculi and
 	  Applications
	  (TLCA),
	  the 5th Workshop on First-order Theorem Proving
	  (FTP).
- 
	RTA-13:
	Copenhagen (Denmark), July 22-24, 2002. LNCS 2378.
 PC Chair: Sophie Tison (Lille)
 Conference Chair: Thomas Arts (Ericsson, Älvsjö)
 Invited speakers:
	  - N. Shankar and H. Ruess, Combining Shostak Theories
- J. C. Mitchell, Multiset Rewriting and Security Protocol Analysis
- F. Baader, Engineering of Logics for the Content-Based Representation of Information
 Best paper: P.-A. Mellies, Residual Theory Revisited
 Submitted: 49,
	Accepted: 26 (including 2 applications and 4 systems)
 Web site,
	  Call for papers,
	  Contents,
	  BibTeX file,
	  Minutes of the Business
	    Meeting.
 RTA-13 was part of
	  FLoC'02.
- 
	RTA-12:
	Utrecht (The Netherlands), May 22-24, 2001. LNCS 2051.
 PC Chair: Aart Middeldorp (Tsukuba)
 Conference Chair: Vincent van Oostrom (Utrecht)
 Invited speakers:
	  - Arvind, Rewriting the Rules for Chip Design
- H. Barendregt, Computing and Proving
- M. Rusinowitch, Rewriting for Deduction and Verification
 Best paper: J. R. Woinowski, A Normal Form for Church-Rosser Language Systems
 Submitted: 55,
	Accepted: 25 (including 2 systems)
 Web site,
	  Call for papers,
	  Contents,
	  BibTeX file,
	  Minutes of the Business
	    Meeting.
- 
	RTA-11:
	University of East Anglia, Norwich (UK), July 10-12, 2000. LNCS 1833.
 PC Chair: Leo Bachmair (Stony Brook)
 Conference Chair: Richard Kennaway (Norwich)
 Invited speakers:
	  - J. Meseguer, Rewriting Logic and Maude: Concepts and Applications
- D. Miller, Abstract Syntax for Variable Binders
- A. Voronkov, Formulae over Reduction Orderings: Some Solved and yet Unsolved Problems
- S. Tison, Tree Automata and Term Rewrite Systems (tutorial)
 Submitted: 44,
	Accepted: 18 (including 3 systems)
 Web site,
	  Call for papers,
	  Contents,
	  BibTeX file.
- 
	RTA-10:
	Trento (Italy), July 2-4, 1999.
 	LNCS 1631.
 PC Chairs: Paliath Narendran (Albany) and Michaël Rusinowitch
	(Nancy)
 Conference Chair: Andrea Asperti (Bologna)
 Invited speakers:
	  - B. Courcelle, Hierarchical Graph Decompositions  Defined by Grammars and Logical Formulas
- F. Otto, On the Connections between Rewriting and Formal Language Theory
- F. van Ramsdonk, Higher Order Rewriting (tutorial)
 Submitted: 53,
	Accepted: 27 (including 4 systems)
 Web site,
	  Call for papers,
	  Contents,
	  BibTeX file,
	  Minutes of the Business
	    Meeting.
- 
	RTA-9:
	Tsukuba (Japan), March 30 - April 1, 1998.
 	LNCS 1379.
 PC Chairs: Tobias Nipkow (Munich)
 Conference Chairs: Aart Middeldorp and Tetsuo Ida (Tsukuba)
 Invited speakers:
	  - H. Comon, About Proofs by Consistency
- J. K. Klop, Origin Tracking in Term Rewriting
- G. Plotkin, Binding Algebras: A Step between Universal Algebra and Type Theory
 Best student paper: J. Waldmann, Normalization of S Terms is Decidable
 Submitted: 61,
	Accepted: 22
 Web site,
	  Call for papers,
	  Contents,
	  BibTeX file,
	  Minutes of the Business Meeting.
- 
	RTA-8:
	Sitges (Spain), June 2-5, 1997. LNCS 1232.
 PC Chair: Hubert Comon (Orsay)
 Conference Chair: Robert Nieuwenhuis (Barcelona)
 Invited speakers:
	  - W. McCune, Well-Behaved Search and the Robbins Problem
- Y. Lafont, Two-Dimensional Rewriting
 Submitted: 54 (including 7 systems),
	Accepted: 27 (including 4 systems)
 Call for papers,
	  Contents,
	  BibTeX file,
	  Minutes of the Business Meeting.
- 
	RTA-7:
	New Brunswick (NJ, USA), July 27-30, 1996. LNCS 1103.
 PC Chair: Harald Ganzinger (Saarbruecken)
 Conference Chair: Leo Bachmair (Stony Brook)
 Invited speakers:
	  - D. Kapur, Rewrite-Based Automated Reasoning: Challenges Ahead
- G. Huet, Design of a Proof Assistant (joint with LICS)
- K. Madlener, Applications of Rewrite Techniques in Monoids and Rings
 Submitted: 84,
	Accepted: 34 (including 6 systems)
 Web site,
	  Call for papers,
	  Contents,
	  BibTeX file.
- 
	RTA-6:
	Kaiserslautern (Germany), April 5-7, 1995. LNCS 914.
 PC Chair: Jieh Hsiang (Taipei)
 Conference Chairs: Juergen Avenhaus and Klaus Madlener
	(Kaiserslautern)
 Invited speakers:
	  - Y. Matiyasevich, On Some Mathematical Logic Contributions to Rewriting Techniques: Lost Heritage
- T. Nipkow, Higher Order Rewrite Systems
- M. Stickel, Term Rewriting in Contemporary Resolution Theorem Proving
 Submitted: 87,
	Accepted: 40 (including 9 systems and 2 problems)
 Web site,
	  Call for papers,
	  Contents,
	  BibTeX file.
- 
	RTA-5:
	Montreal (Canada), June 16-18, 1993. LNCS 690.
 PC Chair: Claude Kirchner (Nancy)
 Conference Chair: Mitsuhiro Okada (Montreal)
 Invited speakers:
	  - L. Bachmair, Rewrite Techniques in Theorem Proving
- J. Gallier, Proving Properties of Typed Lambda Terms: Realizability, Covers and Sheaves
- S. Adian, On Some Algorithmic Problems for Groups and Monoids
 Submitted: 91,
	Accepted: 36 (including 6 systems and 1 problem)
 Call for papers,
	  Contents,
	  BibTeX file.
- 
	RTA-4:
	Como (Italy), April 10-12, 1991. LNCS 488.
 PC Chair: Ronald Book (Santa Barbara)
 Conference Chairs: Degli Antoni and Marelva Bianchi (Milano)
 Submitted: 87,
	Accepted: 40 (including 4 systems and 1 problem)
 Call for papers,
	  Contents,
	  BibTeX file.
- 
	RTA-3:
	Chapel Hill (NC, USA), April 3-5, 1989. LNCS 355.
 PC Chair: Nachum Dershowitz (Urbana)
 Conference Chair: David Plaisted (Chapel-Hill)
 Invited speaker:
	  - G. Birkhoff, Term Rewriting and Universal Algebra in Historical Perspective
 Submitted: 84,
	Accepted: 46 (including 12 systems)
 Call for papers,
	  Contents,
	  BibTeX file.
- 
	RTA-2:
	Bordeaux (France), May 25-27, 1987. LNCS 256.
 PC Chairs: Pierre Lescanne (Nancy)and David Plaisted
	(Chapel-Hill)
 Conference Chair: Bruno Courcelle (Bordeaux)
 Invited speakers:
	  - M. J. O'Donnell, Term-Rewriting Implementation of Equational Logic Programming
- D. Musser, Inductionless Induction
- J.-P. Jouannaud, Proof Methods for Completion Procedures
 Submitted: 70,
	Accepted: 22
 Contents,
	  BibTeX file.
- 
	RTA-1:
	Dijon (France), May 20-22, 1985. LNCS 202.
 PC Chairs: Jean-Pierre Jouannaud (Nancy) and David Musser
	(General Electric Labs)
 Conference Chairs: Jean-Jacques Chabrier and Jean-Marc Gallo
	(Dijon)
 Invited speakers:
	  - B. Buchberger, Basic Features and Development of the
 	      Critical-Pair/Completion Procedure
- R. V. Book, Thue Systems as Rewriting Systems
- N. Dershowitz, Termination
- G. Huet, Equational Systems for Category Theory and
	      Intuitionistic Logic
 Best paper: K. A. Yelick, Combining
 	  Unification Algorithms for Confined Regular Equational
 	  Theories
 Accepted: 20
 Contents,
	  BibTeX file.
- 
	RTA-0:
	Rewrite Rule Laboratory Workshop,
 	Schenectady (NY, USA), September 1983.
 PC and Conference Chairs: John Guttag (MIT), Deepak Kapur and David
	Musser (General Electric Labs)
 Preliminary program
	  (
	     gzipped postscript),
	  
	    Contents of the proceedings
	  (
	    gzipped postscript).
      - 
	CTRS-4:
 	Jerusalem (Israel), July 13-15, 1994. LNCS 968.
 PC and Conference Chairs: Nachum Dershowitz (Urbana) and Naomi
	Lindenstrauss (Jerusalem)
 Call for papers,
	  Contents,
	  BibTeX file.
- 
	CTRS-3:
 	Pont-à-Mousson (France), July 8-10, 1992. LNCS 656.
 PC and Conference Chairs: Jean-Luc Rémy and Michaél Rusinowitch
	(Nancy)
 Call for papers,
	  Contents,
	  BibTeX file.
- 
	CTRS-2:
 	Montreal (Canada), June 11-14, 1990. LNCS 516.
 PC and Conference Chair: Mitsuhiro Okada (Montreal)
 Call for papers,
	  Contents,
	  BibTeX file.
- 
	CTRS-1:
 	Orsay (France), July 8-10, 1987. LNCS 308.
 PC and Conference Chairs: Stéphane Kaplan and Jean-Pierre
	Jouannaud (Orsay)
 Contents,
	  BibTeX file.
      
      - The RTA conference is being cancelled.
	All obligations in the following paragraphs are cancelled if
	they pertain to activity after December 31st, 2015. In case of
	conflict between this paragraph and the remaining paragraphs,
	this paragraph takes precedence.
- RTA is an annual meeting.
- There will be a general assembly (GA) to be help during each RTA
      	meeting.
- There will be an steering committee (SC), whose composition and
      	function are specified in the next sections.
- There will be a program committee (PC), which is solely responsible
      	for the scientific contents of the program for each RTA.
- There will be a conference committee (CC) whose chairman is
      	responsible for the local arrangements of the meeting and solely
      	financially responsible of the conference it is organizing.
- There will be a publicity chair, who is responsible for advertising
      	and other issues concerning publicity of the conference. The publicity
      	chair will be selected by the SC from within.
- Nomination for the RTA local organization and site should be submitted 
      	to SC chair four weeks before the conference.
- The
      	
	  - Program Committee Chairperson,
- Conference Chairperson,
- site,
- tentative date,
 of the RTA to be held in the next two years, will all be nominated by
	the SC and approved (or disapproved) by a vote at the GA.
- Nomination of new SC members (with the consent of the nominees) should 
      	be submitted to SC chair four weeks before the conference.
- The GA will take up any other agenda suggested by the attendees. It
      	will be ruled by Robert's Rules of Order.
- 
	
        The PC Chair should not submit any paper.
- The composition of the PC is the responsibility of the PC chair.
- 
        
	Any modification of the bylaws should be proposed to the SC chair four
	weeks before the conference and be ratified by a majority at the GA. By
	default, votes are public.
      
Composition:
    
      - The Steering Committee consists of six elected members. The current
      	committee is:
      	
- The Steering Committee selects its own chair.
- Each Steering Committee member serves until the third subsequent
      	conference (i.e. the SC is renewed by third at each general
      	assembly).
- The General Assembly of each conference votes by secret ballot for new 
      	Steering Committee members to replace the outgoing members. The number 
      	of votes allowed to each attendee of the General Assembly equals the
      	number of the positions.
Function:
    
      - Provide support to the Program Committee and Conference Committee.
- Propose Program Committee chair, site and tentative date of conference 
      	to be held in two years.
- Choose a publicity chair from within.
- Act as liaison with other conferences and workshops.
- Call and organize the General Assembly.
- Organize the election of new Steering Committee members.
- Explore technical/organizational supports for non-local
      	resources.
- Maintain an official mailing list and records of the previous
      	meetings.
Former members:
    
      - Georg Moser (Innsbruck)
- Frédéric Blanqui (INRIA),
	Salvador Lucas (Valencia),
	Masahiko Sakai (Nagoya)
- Ian Mackie (Palaiseau),
	Joachim Niehren (Lille)
- Johannes Waldmann (Leipzig)
- Franz Baader (Dresden),
	Hitoshi Ohsaki (Osaka),
	Albert Rubio (Barcelona)
- Maribel Fernandez (London),
	Bernhard Gramlich (Vienna)
- Ashish Tiwari (Menlo Park)
- Jürgen Giesl (Aachen),
	Delia Kesner (Paris),
	Vincent van Oostrom (Utrecht)
- Robert Nieuwenhuis (Barcelona),
	Ralf Treinen (Cachan)
- Femke van Raamsdonk (Amsterdam)
- Franz Baader (Dresden),
      	Pierre Lescanne (Lyon),
	Aart Middeldorp (Innsbruck)
- Leo Bachmair (Stony Brook),
      	Hélène Kirchner (Nancy)
- Jose Meseguer (Menlo Park)
- Nachum Dershowitz (Tel Aviv),
      	Tobias Nipkow (Munich),
      	Michaël Rusinowitch (Nancy)
- Hubert Comon (Cachan),
      	Yoshihito Toyama (Tohoku)
- Harald Ganzinger (Saarbrücken),
      	Paliath Narendran (Albany)
- Jieh Hsiang (Taipei),
      	Klaus Madlener (Kaiserslautern)
- Claude Kirchner (Nancy),
      	Mitsu Okada (Keio)
- ...
    
      Laurent Vigneron
	(last modified: 2-Sep-2021).