AARNEWS - December 2002



No. 57, December 2002


From the AAR President
Results of the CADE Trustee Elections 2002
Call for Papers for Conferences

  • CADE-19
  • RTA'03
  • CAV 2003
  • LICS 2003
  • TABLEAUX 2003
  • TPHOLs 2003

  • Book Announcement
    Call for Papers for Special Journal Issues
  • Logic, Mathematics and Computer Science: Interactions
  • Modalities in Constructive Logics and Type Theories
  • Automated Reasoning and Theorem Proving in Education
  • Open Position - Research Fellow

    From the AAR President, Larry Wos...

    I encourage the newly elected CADE trustees to work hard at promoting automated reasoning; in particular, I hope that they will encourage their colleagues to use the AAR Newsletter as a forum for discussion about our field and as a mechanism for presenting challenging problems and open questions.

    Results of the CADE Trustee Elections 2002

    Maria Paola Bonacina
    (Secretary of AAR and CADE)
    E-mail: mariapaola.bonacina@univr.it

    An election was held from 19 September through 6 October 2002 to fill three positions on the board of trustees of CADE Inc. Two positions were left vacant by Harald Ganzinger and David Plaisted, whose terms expired, and a third one was created to complete the implementation of the amendment approved in the summer of 2000 to increase the number of trustees from nine to twelve (see AAR Newsletter No. 48, August 2000). Harald Ganzinger, Jean Goubault-Larrecq, Reinhold Letz, Andrei Voronkov and Toby Walsh were nominated for these positions (see AAR Newsletter No. 56, September 2002).

    Ballots were sent by electronic mail to all members of AAR as of the 19th of September, for a total of 566 ballots (up from 548 in 2001, 445 in 2000 and 396 in 1999). Of these, 149 were returned with a vote, representing a participation level of 26.3% (up from 22.5% in 2001 and 24.5% in 2000 and down from 30% in 1999). The majority is 50% of the votes plus 1, hence 75.

    The following table reports the initial distribution of preferences among the candidates:

    Candidate 1st pref. 2nd pref. 3rd pref. 4th pref. 5th pref. Total
    H. Ganzinger 49 24 30 8 38 149
    J. Goubault-Larrecq 17 16 25 17 74 149
    R. Letz 21 30 25 15 58 149
    A. Voronkov 32 56 23 7 31 149
    T. Walsh 30 18 33 14 54 149

    No candidate reaches a majority right away, and the redistribution of the votes of Jean Goubault-Larrecq yields the following new distribution:

    Candidate 1st pref. 2nd pref. 3rd pref. 4th pref. 5th pref. Total
    H. Ganzinger 54 27 24 30 14 149
    R. Letz 27 27 33 37 25 149
    A. Voronkov 36 62 17 22 12 149
    T. Walsh 31 27 34 35 22 149

    Again, no candidate reaches a majority, and by redistributing the votes of Reinhold Letz one gets the following table:

    Candidate 1st pref. 2nd pref. 3rd pref. 4th pref. 5th pref. Total
    H. Ganzinger 59 33 39 11 7 149
    A. Voronkov 49 59 25 13 3 149
    T. Walsh 39 35 44 29 2 149

    Redistribution of the votes for Toby Walsh produces the final table for the first slot:

    Candidate 1st pref. 2nd pref. 3rd pref. 4th pref. 5th pref. Total
    H. Ganzinger 69 57 17 5 1 149
    A. Voronkov 68 60 17 4 0 149

    Thus, Harald Ganzinger is elected for a second term on the board of trustees. (Since 69 votes does not suffice for the majority, the STV algorithm executes another round distributing the votes of Andrei Voronkov, but this is not reported because the outcome is obvious.) The redistribution of the votes of the winner produces the following table:

    Candidate 1st pref. 2nd pref. 3rd pref. 4th pref. 5th pref. Total
    J. Goubault-Larrecq 24 26 20 65 14 149
    R. Letz 32 36 21 49 11 149
    A. Voronkov 58 48 11 20 12 149
    T. Walsh 35 32 25 50 7 149

    None of the candidates has a majority to be elected, so that the votes of Jean Goubault-Larrecq need to be redistributed again:

    Candidate 1st pref. 2nd pref. 3rd pref. 4th pref. 5th pref. Total
    R. Letz 40 38 42 22 7 149
    A. Voronkov 68 45 17 14 5 149
    T. Walsh 40 41 40 27 1 149

    Reinhold Letz and Toby Walsh have the same number of first preferences, but because of the difference in second preferences, the next round redistributes the votes for Reinhold Letz, producing this outcome:

    Candidate 1st pref. 2nd pref. 3rd pref. 4th pref. 5th pref. Total
    A. Voronkov 89 38 16 3 3 149
    T. Walsh 53 59 33 3 1 149

    Thus, Andrei Voronkov has a majority and is elected. Returning to the table after Harald Ganzinger's votes were redistributed, and redistributing those of Andrei Voronkov also, one obtains the following matrix:

    Candidate 1st pref. 2nd pref. 3rd pref. 4th pref. 5th pref. Total
    J. Goubault-Larrecq 40 27 61 16 5 149
    R. Letz 52 35 48 10 4 149
    T. Walsh 55 31 52 9 2 149

    None of the candidates has a majority to be elected, so that the votes of Jean Goubault-Larrecq need to be redistributed again:

    Candidate 1st pref. 2nd pref. 3rd pref. 4th pref. 5th pref. Total
    R. Letz 68 48 24 6 3 149
    T. Walsh 68 50 28 3 0 149

    There is again a tie between Reinhold Letz and Toby Walsh, which is solved by comparing the second preferences. The votes for Reinhold Letz get redistributed, and Toby Walsh is elected.

    After this election, the following people are serving on the board of trustees of CADE Inc.:

    Franz Baader (CADE 2003 Program Chair)

    Maria Paola Bonacina (Secretary)

    Gilles Dowek (Elected 9/2001)

    Ulrich Furbach (President, elected 8/1997 and re-elected 10/2000)

    Harald Ganzinger (Past program chair, elected 10/1999 and re-elected 10/2002)

    John Harrison (Elected 9/2001)

    Michael Kohlhase (Elected 10/2000)

    David McAllester (Past program chair, elected 10/2000)

    Neil V. Murray (Treasurer)

    Frank Pfenning (Vice-President, elected 10/1998 and re-elected 9/2001)

    Andrei Voronkov (Past program chair, elected 10/2002)

    Toby Walsh (Elected 10/2002)

    On behalf of the AAR and CADE Inc., I thank David Plaisted, for his service as trustee during the past three years; Jean Goubault-Larrecq and Reinhold Letz, for running in the election; and all the members who voted, for their participation; and I offer the warmest congratulations to Harald Ganzinger, Andrei Voronkov, and Toby Walsh on being elected.

    Call for Papers for Conferences

    CADE 19

    The 19th International Conference on Automated Deduction (CADE-19) will be held in Miami, Florida, USA, July 28 - August 2, 2003.

    CADE-19 invites paper submissions related to all aspects of automated deduction, including foundations, implementations, and applications. Original research papers, papers on applications of automated deduction methods and systems, and descriptions of working automated deduction systems are solicited.

    In addition, CADE-19 invites the submission of proposals for workshops and tutorials, which will take place at the beginning of the conference (July 28 and 29).


    Logics of interest include propositional, first-order, equational, higher-order, classical, intuitionistic, constructive, modal, temporal, many-valued, substructural, description, and meta-logics, logical frameworks, type theory and set theory.

    Methods of interest include saturation, resolution, tableaux, sequent calculi, term rewriting, induction, unification, constraint solving, decision procedures, model generation, model checking, natural deduction, proof planning, proof presentation, proof checking, and explanation.

    Applications of interest include hardware and software development, systems analysis and verification, deductive databases, functional and logic programming, computer mathematics, natural language processing, computational linguistics, robotics, planning, knowledge representation, and other areas of AI.


    Conference submission is electronic in postscript format. Submitted papers should conform to the Springer LNCS style. In addition to papers on foundations (15 pages), CADE encourages the submission of application papers (10 pages), and of short system descriptions (5 pages). Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. In the case of doubts on this point please contact the program chair. Papers that are too long will not be considered.

    Important Dates

    December 15, 2002: Deadline for submission of workshop and tutorial proposals
    January 15, 2003: Notification of acceptance of workshops and tutorials
    January 24, 2003: Deadline for electronic submission of title
    January 31, 2003: Deadline for electronic submission of papers
    March 31, 2003: Notification of acceptance of papers
    April 30, 2003: Deadline for final version of accepted papers

    Conference Chairs: Geoff Sutcliffe (University of Miami, USA) and Jeff Pelletier (University of Alberta, Canada)

    Program Chair: Franz Baader (TU Dresden, Germany)

    More details are available on the conference Web page.


    The 14th International Conference on Rewriting Techniques and Applications (RTA'03) will take place in Valencia, Spain, 9-11 June 2003. RTA is the major conference on rewriting. Authors are encouraged to submit papers in the following or related areas:

    Deadlines are 15 January 2003 for electronic submission of title and abstract and 22 January 2003 for electronic submission of papers. For details, see the Web page.

    CAV 2003

    The 15th Computer-Aided Verification conference (CAV 2003) will be held in Boulder, Colorado, 8-12 July 2003. Topics of interest include the following:

  • Algorithms and tools (such as automated deduction and proof-checking)
  • Verification techniques (such as theorem proving and integration of algorithmic and deductive methods)
  • Applications and case studies (such as synchronous and asynchronous circuits, communication protocols)
  • Modeling and specification formalisms (such as logical, automata-based, and algebraic methods)
  • Testing-based methods built using verification technology
  • Verification in practice (integration of verification with design, specification, testing, debugging, and code generation)
  • Software verification (techniques for verifying systems expressed with widespread languages)
  • Use of computer-aided verification techniques in novel applications (e.g., use of model-checking algorithms in business software, security systems, and automobiles)
  • There are two categories of submissions: regular papers and tool presentations. Submissions of regular papers should be an extended abstract not exceeding thirt een pages; the deadline is 22 January 2003. Submissions of tool presentations should be an abstract not exceeding four pages. Authors are strongly encouraged to use the electronic submission form at the Web site.

    Please direct all inquiries about CAV 2003 to cav2003@cs.utexas.edu.

    LICS 2003

    The eighteenth IEEE Symposium on Logic in Computer Science (LICS 2003) will be held 22-25 June 2003 in Ottawa, Canada. The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic in a broad sense. Topics of interest for submissions include automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, domain theory, finite model theory, formal aspects of program analysis, formal methods, hybrid systems, lambda and combinatory calculi, linear logic, logical aspects of computational complexity, logics in artificial intelligence, logics of programs, logic programming, modal and temporal logics, model checking, programming language semantics, reasoning about security, rewriting, specifications, type systems and type theory, and verification.

    Authors are required to submit electronically a paper title and a short abstract of about 100 words by 30 December 2002; the extended abstract (10 pages) of the paper is due 6 January 2003.

    For further information, see the Web site

    LICS 2003 also will have a session of short (5-10 minutes) presentations. This session is intended for descriptions of work in progress, student projects, and relevant research being published elsewhere; other brief communications may be acceptable. Submissions for these presentations, in the form of short abstracts (1 or 2 pages long), should be entered at the LICS 2003 submission site between 17 March and 21 March 2003.

    TABLEAUX 2003

    TABLEAUX 2003, an international conference on "Automated Reasoning with Analytic Tableaux and Related Methods," will be held in Rome, Italy, 9-12 September 2003 (co-located with TPHOLs 2003 and Calculemus 2003).

    Topics of interest include

  • analytic tableaux for various logics (theory and applications)
  • related techniques and concepts (e.g., model checking and BDDs)
  • related methods (e.g., model elimination, sequent calculi, connection method)
  • new calculi and methods for theorem proving in classical and nonclassical logics (e.g., modal, description, intuitionistic, linear, temporal)
  • systems, tools, implementations and applications (e.g., verification) Submissions are invited in four categories: A -- research papers (reporting original theoretical and/or experimental research, up to 15 pages); B -- system descriptions (up to 5 pages); C -- position papers and brief reports on work in progress; and D -- tutorials in all areas of analytic. Accepted papers in A and B categories will be published in the conference procee dings. For A, B, and C, authors should submit a title and short abstract by 18 March 18 2003; full submissions are due 21 March 2003. Tutorials proposals are due 24 January 2003.

    For further information, see the Web site.

    TPHOLs 2003

    The 16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs) will take plae in Rome, Italy, 8--12 September 2003.

    The first day of the conference will be devoted to tutorials, with the remaining four days covering the main conference program. Authors are invited to submit papers on the following topics:

  • Hardware and software verification, refinement and synthesis \item Verification of security and communication protocols
  • Formal specification and requirements analysis of systems
  • Industrial applications of theorem provers
  • Advances in theorem prover technology
  • Comparisons of various approaches to theorem proving
  • Proof automation and decision procedures
  • Incorporation of theorem provers into larger systems
  • Combination of theorem provers with other provers and tools
  • Use of theorem provers in system certification
  • User interfaces for theorem provers
  • Development and extension of higher order logics
  • Submissions are invited in two categories: Mature Work Track (full research paper) or Emerging Trends Track (informal progress report). Submissions under "mature work" will be fully refereed, and accepted papers will be published as a volume of Springer-Verlag's Lecture Notes in Computer Science series; the deadline for submissions is 21 February 2003. The deadline for "emerging trends" submissions is 20 April 2003.

    For further information, see the Web site.

    Book Announcement

    The popular graduate text Modal Logic, by Patrick Blackburn (LORIA), Maarten de Rijke (University of Amsterdam), and Yde Venema (University of Amsterdam), has now been made available in paperback by Cambridge University Press.

    The book is designed for both novices and experienced readers, with two different paths through the book, signposted in each chapter. The book focuses on the use of modal languages as tools to analyze the properties of relational structures including algorithmic and algebraic aspects Completeness, computability, and complexity are also considered.

    For further information, see the Web page.

    Call for Papers for Special Journal Issues

    Logic, Mathematics and Computer Science: Interactions

    A special issue on "Logic, Mathematics and Computer Science: Interactions" is being put together to honor Professor Bruno Buchberger's many achievements, including the founding of the Journal of Symbolic Computation. The issue will include some of the papers presented at LMCS'02 on 20-22 October 2002 at RISC-Linz.

    We invite authors of the papers presented at LMCS'02, as well as others, to submit papers on topics related to Professor Buchberger's work and interests, for instance, in logic (automatic/natural deduction), mathematics (theory of Groebner bases and applications), computer science (parallel/systolic/hybrid computation for symbolic computation), and interactions (uniform framework for formalizing, proving, solving and computing).

    The suggested length of a paper is 20-30 pages. Submissions are due 15 February 2003.

    More details can be found at the Web site.

    Modalities in Constructive Logics and Type Theories

    The Journal of Logic and Computation is planning a special issue on "Modalities in Constructive Logics and Type Theories." Constructive and modal logics are of foundational and practical relevance to computer science. Constructive logics are used as type disciplines for programming languages, as metalogics for denotational semantics, in the paradigm of program extraction from proofs and for interactive proof development in automated deduction systems such as Agda, Coq, Twelf, Isabelle, HOL, NuPrl, and Plastic. Modal logics (e.g., temporal logics, dynamic logics, and process logics) are used in industrial-strength applications as concise formalisms for capturing reactive behavior. Although constructive and modal frameworks have typically been investigated separately, a growing body of published work shows that both paradigms can (and should) be fruitfully combined.

    This special issue aims to give a state-of-the-art snapshot of recent advances in the study of constructive modalities; to put equal focus on the theory-oriented as well as the application-oriented approaches; and to bring together two largely parallel communities: computer scientists with a focus on proof theory and lambda calculi, and logicians and philosphers with a focus on model theory.

    Submissions (.ps or .pdf) should be sent to michael.mendler@wiai.uni-bamberg.de (or hard copy to Michael Mendler, Informatics Theory Group, Faculty of Business and Applied Informatics, The Otto-Friedrich University of Bamberg, Feldkirchenstr. 21, D-96045 Bamberg, Germany).

    Automated Reasoning and Theorem Proving in Education (ARTE)

    As announced in the September AAR Newsletter, we plan a special issue of the Journal of Automated Reasoning on the use of theorem provers in education at all levels.

    The newly extended submission deadline is 31 January 2003.

    We welcome contributions about experiences using automated theorem provers for education at all levels: from elementary and secondary school to college and university and beyond. We are especially interested in discussion of the benefits (or problems encountered) in using automated theorem proving technology to motivate students and to enhance their ability to understand new topics.

    Please send 3 copies of your manuscript or (preferably) a postscript file to kapur@cs.unm.edu (or a hard copy to Dr. Deepak Kapur, Chairperson, Computer Science Department, University of New Mexico, Albuquerque, NM 87131). Please also send one copy to pieper@mcs.anl.gov.

    Open Position - Research Fellow

    Smart Internet Technology Cooperative Research Centre
    Smart Personal Assistant Research Program
    Research School of Information Sciences and Engineering

    The Cooperative Research Centre (CRC) has a vacant fixed-term position for a Research Fellow at the Australian National University in Canberra.

    Applicants should have expertise in one or more of the following areas of research: machine learning, intelligent agents, or computational logic. The closing date for applications is 17 December 2002.

    For further information, please see the Web site.

    Gail W. Pieper
    3 December 2002