4th Workshop on
Logic, Language, Information and Computation (WoLLIC'97)
August 20-22, 1997
(Tutorial Day: August 19th)
Ponta Mar Hotel, Fortaleza (Ceará), Brazil
Sponsored by
IGPL,
FoLLI,
ASL,
SBC
Funded by CAPES, CNPq, FINEP, FUNCAP
Organised by UFC, UFPE
[next page | previous page | main page]
Programme
Tuesday August 19th, 1997: Tutorial Day
Wednesday August 20th, 1997
08:15: Opening
Morning: Logic and Language
08:30-09:45 (Invited talk) Chair: Yuri Gurevich
Using Logic to Understand What Went Wrong
by Keith Devlin
09:45-09:55 Coffee/Tea break
09:55-11:15 4 contributed papers (20 min each) Chair:tba
09:55-10:15
Formalization of Knowledge and Belief based on Kleene's Strong Logic
by M. Alvarado and G. Nuñez
10:15-10:35
On the Expressive Power of the Lambek Calculus Extended with a Structural Modality
by Ph. de Groote
10:35-10:55
Labelled Proof Nets for the Syntax and the Semantics of Natural Languages
by G. Perrier
10:55-11:15
An Analysis for Spanish Comparatives in Categorial Grammar
by P. Accuosto and D. Wonsever
11:15-11:25 Coffee/Tea break
11:25-12:40 (Invited talk) Chair: Rob van Glabbeek
Grammatical Resources: Logic, Structure, and Control
by Michael Moortgat
Afternoon: Nonmonotonic Reasoning
14:00-15:15 (Invited talk) Chair: Keith Devlin
Why Nonmonotonicity is Trivial Even Though Nonmonotonic Logic is Impossible
by Drew McDermott
15:15-15:25 Coffee/Tea break
15:25-16:25 (Invited talk) Chair:tba
(title to be announced)
by Tarcísio Pequeno
16:25-17:45 4 contributed papers (20 min each) Chair:tba
16:25-16:45
A Nonmonotonic Analytic Consequence Relation
by C. A. Oller
16:45-17:05
Jumping to Explanations vs Jumping to Conclusions
by R. Pino Pérez and C. Uzcátegui
17:05-17:25
A Little Note about the Rott Contraction
by E. L. Fermé and R. Rodriguez
17:25-17:45
On the Difference between Arbitration and Majority Merging
by S. Konieczny and R. Pino Pérez
17:45-18:00 Coffee/Tea break
18:00-19:15 (Invited talk) Chair: Roman Kossak
Stereotypical Reasoning
by Daniel Lehmann
20:30 Welcome Reception/Cocktail
Thursday August 21st, 1997
Morning: Categorical Logic and Semantics of Computation
08:30-09:45 (Invited talk) Chair: Paulo Veloso
Grothendieck Toposes as First-Order Theories
by Peter Johnstone
09:45-09:55 Coffee/Tea break
09:55-11:15 4 contributed papers (20 min each) Chair:tba
09:55-10:15
Eliminating Commuting Conversions and Constructive Necessity
by N. Ghani, V. de Paiva and E. Ritter
10:15-10:35
Proof Search and Proof Nets Construction in Linear Logic
by D. Galmiche and B. Martin
10:35-10:55
Complex Combinators and Structural Equations
by M. Finger
10:55-11:15
Generalized Lambda-Calculi (CANCELLED)
by H. Xi
11:15-11:25 Coffee/Tea break
11:25-12:40 (Invited talk) Chair: Michael Moortgat
Exact Real Number Computation Using Linear Fractional Transformations
by Abbas Edalat
Afternoon: Program Logic and Models of Concurrency
14:30-15:45 (Invited talk) Chair: Peter Johnstone
Translating Event Oriented Models of Concurrency into Petri Nets by
means of Propositional Logic
by Rob van Glabbeek
15:45-15:55 Coffee/Tea break
15:55-17:15 4 contributed papers (20 min each) Chair:tba
15:55-16:15
Distributed Semantics via Causal Transition Systems
by R. J. Coelho da Costa
16:15-16:35
True Concurrency Model for Read/Write Access Systems
by M. Korff and L. Ribeiro
16:35-16:55
Temporal Logics for Concurrent Nondeterministic Processes
by I. B. Virbitskaite and A. Votintseva
16:55-17:15
Investigating Equivalence Notions for Time Petri Nets
by I. B. Virbitskaite and I. V. Tarasyuk
17:15-17:25 Coffee/Tea break
17:25-18:45 4 contributed papers (20 min each) Chair:tba
17:25-17:45
Towards Efficient Verification of Time Petri Nets
by I. B. Virbitskaite and E. Pokozy
17:45-18:05
Modelling Parameterisation in Concurrent Object Systems
by J. K. Filipe
18:05-18:25
Pure Type Systems with Definitions and Parameters
by T. Laan, P. Severi and J. Zwanenburg
18:25-18:45
Rewriting of Types and Diagonalization in the Oyster-Clam System
by J. Pellegrini and J. Wainer
Friday August 22nd, 1997
Morning: Logic and Complexity Theory
08:30-09:45 (Invited talk) Chair: Abbas Edalat
Computational Model Theory
by Moshe Vardi
09:45-09:55 Coffee/Tea break
09:55-11:15 4 contributed papers (20 min each) Chair:tba
09:55-10:15
An Answer to the Hidden Function Question for Algebraic Specification Methods
by A. Schönegge
10:15-10:35
On Program Correctness over Finite Data Types
by A. Prokhorov
10:35-10:55
Decision Trees, Compression, and Boolean Lattices
by C. Hammond and R. Levinson
10:55-11:15
Classical Negation can be Expressed by one of its Half
by J.-Y. Béziau
11:15-11:25 Coffee/Tea break
11:25-12:40 (Invited talk) Chair: Daniel Lehmann
Choice-less Polynomial Time
by Yuri Gurevich
Afternoon: Model Theory and Algebraic Logic
14:30-15:45 (Invited talk) Chair: Drew McDermott
What is Model Theory of Arithmetic?
by Roman Kossak
15:45-15:55 Coffee/Tea break
15:55-17:15 4 contributed papers (20 min each) Chair:tba
15:55-16:15
Distinguished Sets in Theories Without Foundation
by M. V. Marshall and M. G. Schwarze
16:15-16:35
Fuzzy Logic: An Extension Problem
by J. C. Cifuentes
16:35-16:55
Schematic Systems
by J. P. Viana, S. R. M. Veloso and P. A. S. Veloso
16:55-17:15
Recognizing Classes of Logic Programs
by F. Protti and G. Zaverucha
17:15-17:25 Coffee/Tea break
17:25-18:40 (Invited talk) Chair: Moshe Vardi
Logical Specifications and Program Development
by Paulo Veloso
Closing
|