[Prev][Next][Index][Thread]
WoLLIC'2000 - Programme
[please post]
WoLLIC'2000
7th Workshop on Logic, Language, Information and Computation
August 15-18, 2000
Hotel Barreira Roxa, Natal, Brazil
SCIENTIFIC SPONSORSHIP
Interest Group in Pure and Applied Logics (IGPL)
European Association for Logic, Language and Information (FoLLI)
Association for Symbolic Logic (ASL)
Sociedade Brasileira de Computação (SBC)
Sociedade Brasileira de Lógica (SBL)
FUNDING
Organisation
Centro de Informática, Universidade Federal de Pernambuco (CIn-UFPE)
Departamento de Informática e Matemática Aplicada, Univ. Fed. do Rio Grande do Norte (DIMAP-UFRN)
Pró-Reitoria de Extensão, Univ. Fed. do Rio Grande do Norte (PROEX-UFRN)
WEB PAGE
http://www.cin.ufpe.br/~wollic/wollic2000/
PROGRAMME
Tuesday, August 15th, 2000 (Tutorial Day)
Tutorials:
08:00-10:00 (with a 10min break)
The Optimal Implementation of functional programming languages
by Andrea Asperti (Department of Computer Science, Bologna University, Italy)
10:00-10:15 Coffee/tea break
10:15-12:15 (with a 10min break)
Classes de complexité definie en termes d'élimination des quanteurs /
Complexity classes associated to quantifiers elimination
by Bruno Poizat (Institut Girard Desargues, Université Claude Bernard (Lyon-1), France)
12:15-14:00 Lunch break
14:00-16:00 (with a 10min break)
The complexity of propositional proofs and connections to bounded arithmetic and computational complexity
by Toniann Pitassi (Department of Computer Science, University of Toronto, Canada)
16:00-16:15 Coffee/tea break
16:15-18:15 (with a 10min break)
Presheaf Models for Concurrency
by Glynn Winskel (BRICS, Aarhaus University, Denmark)
18:15-18:30 Coffee/tea break
18:30-20:30 (with a 10min break)
Definability, Measure and Randomized Algorithms
by Angus MacIntyre (Department of Mathematics, Edinburgh University, Scotland)
Wednesday, August 16th, 2000
Morning: Logic and Computation Theory
08:30-09:00 OPENING
09:00-10:30 (Invited talk) Chair: Angus MacIntyre
Une tentative mmalheureuse de construction d'une structure eliminant rapidement les quanteurs /
An unfortunate attempt to build a structure with fast quantifier elimination
by Bruno Poizat (Institut Girard Desargues, Université Claude Bernard (Lyon-1), France)
10:30-10:45 Coffee/tea break
10:45-12:30 2 contributed papers (35min each) Chair: Ruy de Queiroz
10:45-11:20 A New Spectrum of Recursive Models
by Andre Nies (Department of Mathematics, The University of Chicago, USA)
11:20-11:55 A Model Theoretic Approach to Translations Between Logics
by Marcelo Coniglio and Walter Carnielli (Centro de Lógica, Epistemologia e História da Ciência,
Universidade Estadual de Campinas, Brazil)
12:30-14:00 Lunch break
Afternoon: Logic and Information
14:00-15:30 (Invited talk) Chair: Glynn Winskel
XML and the hypertextual electronic library of mathematics
by Andrea Asperti (Department of Computer Science, Bologna University, Italy)
15:30-15:45 Coffee/tea break
15:45-17:30 3 contributed papers (35min each) Chair: Ana Teresa Martins
15:45-16:20 Approximate Belief Revision: A Preliminary Report
by Samir Chopra (CUNY Graduate Center and New York University, New York, USA),
Rohit Parikh (Brooklyn College of CUNY and CUNY Graduate Center, New York, USA), and
Renata Wassermann (Department of Computer Science, University of S\~ao Paulo, Brazil)
16:20-16:55 Reasoning About Dynamic Databases: Tableaux for Single-Step-Update Models
by Christian Fermüller (Institut für Computersprachen, Technische Universität Wien, Austria)
16:55-17:30 Completeness of an Action Logic Featuring a delta-Operator for Timed Transition Systems
by Fernando Náufel do Amaral and Edward Hermann Haeusler (Departamento de Informática,
Pontifícia Universidade Católica do Rio de Janeiro, Brazil)
Thursday, August 17th, 2000
Morning: Logic, Semantics of Computation, and Concurrency Theory
09:00-10:30 (Invited talk) Chair: Andrea Asperti
Linearity in Distributed Computation
by Glynn Winskel (BRICS, Aarhaus University, Denmark)
10:30-10:45 Coffee/tea break
10:45-12:30 3 contributed papers (35min each) Chair: David Déharbe
10:45-11:20 Towards Decision of Testing Equivalence for Petri Nets with Dense Time
by Irina Virbitskaite (Institute of Informatics Systems, Siberian Division of the Russian Academy of
Sciences, Novosibirsk, Russia)
11:20-11:55 The Largest Cartesian Closed Category of Domains, Considered Constructively
by Dieter Spreen (Fachbereich Mathematik, Theoretische Informatik, Universität, Siegen, Germany)
11:55-12:30 On the structure of normal lambda-terms having a certain type
by Sabine Broda and Luis Damas (Departamento de Ciência dos Computadores, Universidade do
Porto, Portugal)
12:30-14:00 Lunch break
Afternoon: Logic, Proof Theory, and Complexity Theory
14:00-15:30 (Invited talk) Chair: Luiz Carlos Pereira
A New Proof of the Weak Pigeonhole Principle
by Toniann Pitassi (Department of Computer Science, University of Toronto, Canada)
15:30-15:45 Coffee/tea break
15:45-17:30 3 contributed papers (35min each) Chair: Marcelo Coniglio
15:45-16:20 Infinite SLaKE Tableaux
by Marcelo Finger (Departamento de Ciência da Computação, Instituto de Matemática e Estatística,
Universidade de São Paulo, Brazil)
16:20-16:55 Intuitionistic Finitely Many-Valued Sequent Calculi
by Eugénia Reznik (Institut Supérieur d'Electronique de Paris, France), and
Philippe Curmin (Groupe Cyber Informatique, Paris, France)
16:55-17:30 Elementary number theory in weak fragments of arithmetic
by Paola D'Aquino (Dipartimento di Matematica, Seconda Università degli Studi di Napoli, Italy)
17:30-17:45 Coffee/tea break
17:45-19:15 (Invited talk) Chair: Toniann Pitassi
Translations and Normalization Procedures
by Luiz Carlos Pereira (Departamento de Filosofia, Pontifícia Universidade Católica do Rio de Janeiro,
Brazil)
Friday, August 18th, 2000
Morning: Logic, Language, and Computational Learning Theory
09:00-10:30 (Invited talk) Chair: Bruno Poizat
Definability, Measure and Randomized Algorithm
by Angus Macintyre (Department of Mathematics, University of Edinburgh, Scotland)
10:30-10:45 Coffee/tea break
10:45-11:55 2 contributed papers (35min each) Chair: Marcelo Finger
10:45-11:20 A Gradient-Based Boosting Algorithm for Regression Problems
by Richard Zemel and Toniann Pitassi (Department of Computer Science, University of Toronto,
Canada)
11:20-11:55 Lambek Grammars as Combinatory Categorial Grammars
by Gerhard Jäger (Zentrum für Allgemeine Sprachwissenschaft, Berlin, Germany)
11:55-12:10 Coffee/tea break
12:10-13:55 3 contributed papers (35min each) Chair: Renata Wassermann
12:10-12:45 A Fibring Semantics for the Semantic-Morphological Interface in Natural Language
by Ralf Naumann and Anja Latrouite (Seminar für Allgemeine Sprachwissenschaft, Universität
Düsseldorf, Germany)
12:45-13:20 Judging Unresolved Utterances in Context
by Peter Krause (Institut für Maschinelle Sprachverarbeitung, Universität Stuttgart, Germany)
13:20-13:55 Towards the Mechanical Verification of Textbook Proofs
by Claus Zinn (Division of Informatics, University of Edinburgh, Scotland)
13:55 CLOSING