Rio de Janeiro, 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 Filosofia, Pontifícia Universidade Católica do Rio de Janeiro (FIL-PUC-Rio)
Departamento de Informática, Pontifícia Universidade Católica do Rio de Janeiro (DI-PUC-Rio)

Programme

Tuesday, July 30th, 2002 (Tutorial Day)

Tutorials:

10:15-10:30 Coffee/tea break

10:30-12:30 (with a 10min break) Chair: Gopalan Nadathur
  Computing with Real Numbers
  by Felipe Cucker (Department of Mathematics, City University of Hong Kong, People's Republic of China)

12:30-14:00 Lunch break

14:00-16:00 (with a 10min break) Chair: Rohit Parikh
  Model Checking Games
  by Erich Grädel (Mathematische Grundlagen der Informatik, RWTH Aachen, Germany)

16:00-16:15 Coffee/tea break

16:15-18:15 (with a 10min break) Chair: Felipe Cucker
  Automata theory and logic: Tutorial
  by Igor Walukiewicz (Bordeaux University, France)

Wednesday, July 31st, 2002

Morning: Logic and Language

08:30-10:30 (with a 10min break) (Tutorial) Chair: Erich Grädel

  States of Knowledge (Tutorial)
  by Rohit Parikh (Department of Computer and Information Science, Brooklyn College, City University of New York, USA)

10:30-10:45 Coffee/tea break

10:45-11:55 2 contributed papers (35min each) Chair: Mauricio Ayala-Rincón

10:45-11:20 A Logic for Ambiguous Description
    by Arthur Buchsbaum (Departamento de Informática e Estatística, Universidade Federal de Santa Catarina, Brazil)

11:20-11:55 Dynamic Semantics of Plurals DPL_Q^*
    by Norihiro Ogata (Faculty of Language and Culture, Osaka University, Japan)

  On sparseness and Turing reducibility over the reals
  by Felipe Cucker (Department of Mathematics, City University of Hong Kong, People's Republic of China)

13:10-14:30 Lunch break

Afternoon: Proof Theory

  The Metalanguage Lambda Prolog and its Implementation
  by Gopalan Nadathur (Department of Computer Science, University of Minnesota, USA)

16:30-16:45 Coffee/tea break

16:45-18:30 3 contributed papers (35min each) Chair: Luiz Carlos Pereira

16:45-17:20 Comparing Calculi of Explicit Substitutions with Eta-reduction
    by Mauricio Ayala-Rincón (Departamento de Matemática, Universidade de Brasília, Brazil),
    Flávio L. C. de Moura (Departamento de Matemática, Universidade de Brasília, Brazil)
    and
    Fairouz Kamareddine (School of Mathematical and Computational Sciences, Heriot-Watt University, Scotland)


17:20-17:55 Studying provability in implicational intuitionistic logic: the formula tree approach
    by Sabine Broda (Departamento de Ciência dos Computadores, Universidade do Porto, Portugal)
    and
    Luís Damas (Departamento de Ciência dos Computadores, Universidade do Porto, Portugal)

17:55-18:30 On automating the extraction of programs from proofs using product types
    by Fairouz Kamareddine (School of Mathematical and Computational Sciences, Heriot-Watt University, Scotland),
    François Monin (IRISA, France)
    and
    Mauricio Ayala-Rincón (Departamento de Matemática, Universidade de Brasília, Brazil)

Thursday, August 1st, 2002

Morning: Logic and Knowledge Representation

  States of Knowledge
  by Rohit Parikh (Department of Computer and Information Science, Brooklyn College, City University of New York, USA)

09:45-10:00 Coffee/tea break

10:00-11:10 2 contributed papers (35min each) Chair: Mario Benevides

10:00-10:35 The Logic of Risky Knowledge
    by Henry E. Kyburg, Jr. (Departaments of Philosophy and Computer Science, University of Rochester, and Institute for Human and Machine Cognition, University of West Florida, USA)
    and
    Choh Man Teng (Institute for Human and Machine Cognition, University of West Florida, USA)

10:35-11:10 A logical approach to A-Prolog
    by Mauricio Osorio (Centro de Investigación en Tecnologías de Información y Automatización, Universidad de las Américas, Puebla, México),
    Juan Antonio Navarro (Centro de Investigación en Tecnologías de Información y Automatización, Universidad de las Américas, Puebla, México)
    and
    José Arrazola (Centro de Investigación en Tecnologías de Información y Automatización, Universidad de las Américas, Puebla, México)

11:10-11:25 Coffee/tea break

11:25-12:40 (Invited talk) Chair: Erich Grädel

  The Suspension Notation for Lambda Terms and its Use in Metalanguage Implementations
  by Gopalan Nadathur (Department of Computer Science, University of Minnesota, USA)

12:40-14:30 Lunch break

Afternoon: Logic and Computation Theory

  Deciding low levels of tree-automata hierarchy
  by Igor Walukiewicz (Bordeaux University, France)

15:45-16:00 Coffee/tea break

16:00-17:10 2 contributed papers (35min each) Chair: Edward Hermann Haeusler

16:00-16:35 Rank-Based Symbolic Bisimulation (and Model Checking)
    by Agostino Dovier (Dipartimento di Matematica e Informatica, Università di Udine, Italy),
    Raffaella Gentilini (Dipartimento di Matematica e Informatica, Università di Udine, Italy),
    Carla Piazza (Dipartimento di Informatica, Università Cá Foscari di Venezia, Italy),
    and
    Alberto Policriti (Dipartimento di Matematica e Informatica, Università di Udine, Italy)

16:35-17:10 Continuous Domains and Their Information System Representation as Logical Systems
    by Benjamín René Callejas Bedregal (Departamento de Informática e Matemática Aplicada, Universidade Federal do Rio Grande do Norte, Brazil)
    and
    Ivanosca Andrade da Silva (Departamento de Informática e Matemática Aplicada, Universidade Federal do Rio Grande do Norte, Brazil)

17:25-18:35 2 contributed papers (35 min each) Chair: Ruy de Queiroz

17:25-18:00 A Branching Time Logical System for Open Distributed Systems Development
    by Carlos H. C. Duarte (BNDES, and Universidade Estácio de Sá, Brazil)
    and
    Tom Maibaum (Departament of Computer Science, King's College London, England)

18:00-18:35 Requirements, specifications, and minimal refinement
    by Nikos Gorogiannis (School of Computer Science, University of Birmingham, England)
    and
    Mark Ryan (School of Computer Science, University of Birmingham, England)

Friday, August 2nd, 2002

Morning: Logic, Model Theory, and Definability

  Model Checking Games for Fixed Point Logics
  by Erich Grädel (Mathematische Grundlagen der Informatik, RWTH Aachen, Germany)

09:15-09:30 Coffee/tea break

09:30-11:15 3 contributed papers (35min each) Chair: Fairouz Kamareddine

09:30-10:05 Computable Queries for Object Oriented Databases - The FINSET Case
    by Klaus-Dieter Schewe (Department of Information Systems, Massey University, New Zealand)
    and
    Jose-Maria Turull-Torres (Department of Information Systems, Massey University, New Zealand)

10:05-10:40 A Completeness Result for Relation Algebra with Binders
    by Renata P. de Freitas (COPPE-UFRJ, Brazil)
    and
    Jorge Petrúcio Viana (COPPE-UFRJ and IM-UFF, Brazil)


10:40-11:15 Non Truth-Functional Many-Valuedness
    by Jean-Yves Béziau (Laboratório Nacional de Computação Científica, Rio de Janeiro, Brazil)

11:30-12:45 (Invited talk) Chair: Gopalan Nadathur

  Definability in o-minimal expansions of the real numbers
  by Ricardo Bianconi (Departamento de Matemática, Instituto de Matemática e Estatística, Universidade de São Paulo, Brazil)

12:45 CLOSING

Last modified: July 29, 2002, 16:30:27 GMT-0300.