LPAR'99
Logic for Programming and Automated Reasoning

Tbilisi, Georgia 
September 6-10, 1999

Preliminary Program

Monday, September 6

Session 1
 14.30 - 15.30   Daniel Leivant   Intrinsic theories: a methodology for reasoning about functional
 programs and their computational complexity
 
 15.30 - 16.00   Alan Bundy, 
 Julian Richardson 
 Proofs About Lists Using Ellipsis 
 Coffee break 
Session 2
 16.30 - 17.00   Miki Hermann, 
 Laurent Juban, 
 Phokion G. Kolaitis 
 On the Complexity of Counting the Hilbert Basis 
 of a Linear Diophantine System
 
 17.00 - 17.30   Ramon Bejar 
 Felip Manya 
 Solving Combinatorial Problems with Regular Local Search Algorithms 
 17.30 - 18.00   Anatoli Degtyarev, 
 Alexander Lyaletski 
 Marina Morokhovets 
 Evidence Algorithm and sequent-style logical inference search 
 Welcoming dinner (19:00) 

Tuesday, September 7

 Georgian Session 1 
 10.00 - 10.30       
 10.30 - 11.00       
 Coffee break 
 Georgian Session 2 
 11.30 - 12.00       
 12.00 - 12.30       
 Lunch 
Session 3
 14.30 - 15.00   Serenella Cerrito, 
 Marta Cialdea Mayer, 
 Sebastien Praud 
 First Order Linear Temporal Logic over Finite Time Structures 
 15.00 - 15.30   Martin Leucker   Model Checking Games for the Alternation-Free mu-Calculus and Alternating Automata 
 15.30 - 16.00   Stephan Merz, 
 Yassine Mokhtari 
 Efficiently executable TLA 
Session 4
 16.30 - 17.00   Enno Ohlebusch   Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems 
 17.00 - 17.30   Uwe Waldmann   Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups 
 17.30 - 18.00   Pierre Rety   Regular Sets of Descendants for Constructor-based Rewrite Systems 

Wednesday, September 8

 Full-day excursion (10:00) 

Thursday, September 9

 Poster Session 
 10.00 - 11.00   Wojciech Penczek, 
 Rob Gerth, 
 Ruurd Kuiper 
 
 Domenico Cantone, 
 Alberto G. Zarba, 
 Andrea Formisano, 
 Eugenio G. Omodeo, 
 
 Emmanouil Marakakis 

 Partial Order Reductions Preserving Simulations 
 
 
 
 Folding Quantifiers into Map Composition 
 
 
 
 Correctness of Logic Programs Constructed by a Schema-Based Methods 
 Coffee break 
 Session 5 
 11.30 - 12.00   Ian Horrock, 
 Ulrike Sattler, 
 Stephan Tobies 
 Practical Reasoning for Expressive Description Logics 
 12.00 - 12.30   Carsten Lutz   Complexity of Terminological Reasoning Revisited 
 Lunch 
Session 6
 14.30 - 15.30   Yuri Gurevich   Invited talk 
 15.30 - 16.00   Georg Gottlob, 
 Christos Papadimitriou 
 On the Complexity of Single-Rule Datalog Queries 
 Coffee break 
Session 7
 16.30 - 17.00   Rene Moreno   Abstracting Properties in Concurrent Constraint Programming 
 17.00 - 17.30   Roberta Gori   A fixpoint semantics for reasoning about finite failure 
 17.30 - 18.00   Jeremy Gow, 
 Alan Bundy, 
 Ian Green 
 Extensions to the Estimation Calculus 

Friday, September 10

 Session 8 
 10.00 - 10.30   Eva Hoogland, 
 Maarten Marx, 
 Martin Otto 
 Beth definability for the guarded fragment 
 10.30 - 11.00   Michael Dierkes   Simplification of Horn Clauses that are Clausal Forms of Guarded Formulas 
 Coffee break 
 Session 9 
 11.30 - 12.00   Pablo Lopez, 
 Ernesto Pimentel 
 Resource Management in Linear Logic Proof Search Revisited 
 12.00 - 12.30   Jean-Marc Andreoli, 
 Roberto Maieli 
 Focusing and Proof-Nets in Linear and Non-Commutative Logic 
 Lunch 
Session 10
 14.30 - 15.00   Bart Demoen, 
 Konstantinos Sagonas 
 CHAT is $\Theta$(SLG-WAM) 
 15.00 - 15.30   Nikolay Pelov, 
 Maurice Bruynooghe 
 Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog 
 15.30 - 16.00   Elvira Albert, 
 Maria Alpuente, 
 Michael Hanus, 
 German Vidal 
 A Partial Evaluation Framework for Curry Programs 
 Coffee break 
Session 11
 16.30 - 17.30   Matthias Baaz   Term Induction and Herbrand's Theorem 
 Farewell dinner (19:00) 

Saturday, September 11

Only for those who registered for both LPAR and LLC.

 Travel by bus to Zestafoni and Batumi (10:00) 

Highlights of the program

Invited talks

Term Induction and Herbrand's Theorem
Matthias Baaz (Vienna University of Technology).

Yuri Gurevich (Microsoft Research).

Intrinsic theories: a methodology for reasoning about functional programs and their computational complexity
Daniel Leivant (Indiana University).

Contributed talks

On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System
Miki Hermann (LORIA, Nancy),
Laurent Juban (LORIA, Nancy),
Phokion G. Kolaitis (University of California at Santa Cruz)

Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems
Enno Ohlebusch (University of Bilefeld)

Practical Reasoning for Expressive Description Logics
Ian Horrock (University of Manchester),
Ulrike Sattler (RWTH Aachen),
Stephan Tobies (RWTH Aachen)

CHAT is $\Theta$(SLG-WAM)
Bart Demoen (KU Leuven),
Konstantinos Sagonas (Uppsala University)

On the Complexity of Single-Rule Datalog Queries
Georg Gottlob (Vienna University of Technology),
Christos Papadimitriou (Berkeley)

Resource Management in Linear Logic Proof Search Revisited
Pablo Lopez,
Ernesto Pimentel (Universidad de Malaga)

A Partial Evaluation Framework for Curry Programs
Elvira Albert (Universidad Politecnica de Valencia),
Maria Alpuente (Universidad Politecnica de Valencia),
Michael Hanus (Informatik II, RWTH Aachen),
German Vidal (Universidad Politecnica de Valencia)

Abstracting Properties in Concurrent Constraint Programming
Rene Moreno (University of Pisa)

Simplification of Horn Clauses that are Clausal Forms of Guarded Formulas
Michael Dierkes (LEIBNIZ - IMAG)

Complexity of Terminological Reasoning Revisited
Carsten Lutz (RWTH Aachen)

Regular Sets of Descendants for Constructor-based Rewrite Systems
Pierre Rety (University of Orleans, France)

Extensions to the Estimation Calculus
Jeremy Gow,
Alan Bundy,
Ian Green (Univ. of Edinburgh)

Proofs About Lists Using Ellipsis
Alan Bundy,
Julian Richardson (University of Edinburgh)

Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups
Uwe Waldmann (Max-Planck-Institut für Informatik, Saarbrücken)

A fixpoint semantics for reasoning about finite failure
Roberta Gori (University of Pisa)

First Order Linear Temporal Logic over Finite Time Structures
Serenella Cerrito (University Paris 11),
Marta Cialdea Mayer (University Roma Tre),
Sebastien Praud (University Paris 11)

Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog
Nikolay Pelov,
Maurice Bruynooghe (Katholieke Universiteit Leuven)

Efficiently executable TLA
Stephan Merz (TU Muenchen),
Yassine Mokhtari (LORIA)

Beth definability for the guarded fragment
Eva Hoogland (University of Amsterdam),
Maarten Marx (University of Amsterdam),
Martin Otto (RWTH Aachen)

Focusing and Proof-Nets in Linear and Non-Commutative Logic
Jean-Marc Andreoli (Xerox Research Centre Europe),
Roberto Maieli (Universit`a di Roma)

Evidence Algorithm and sequent-style logical inference search
A.I. Degtyarev (Uppsala University),
A.V.Lyaletski (Inst. of Cybernetics, Kiev),
M.K. Morokhovets (Inst. of Cybernetics, Kiev)

Solving Combinatorial Problems with Regular Local Search Algorithms
Ramon Bejar,
Felip Manya (Universitat de Lleida, Spain)

Model Checking Games for the Alternation-Free $\mu$-Calculus and Alternating Automata
Martin Leucker (Aachen University of Technology, Germany)

Georgian session

Talks by Georgian logicians. Abstracts will be added here.

Poster session

Partial Order Reductions Preserving Simulations
Wojciech Penczek (Institute of Computer Science, Warsaw),
Rob Gerth (INTEL),
Ruurd Kuiper (Eindhoven University of Technology)

Folding Quantifiers into Map Composition
Domenico Cantone (University of Catania),
Alberto G. Zarba (University of Catania),
Andrea Formisano (University "La Sapienza"),
Eugenio G. Omodeo (University of L'Aquila)

Correctness of Logic Programs Constructed by a Schema-Based Method
Emmanouil Marakakis (Technological Educational Institute of Heraklion)

Welcoming dinner

Dinner at the Svanetian restaurant "Ushba". Svanetia is part of Georgia situated in high mountains. The dinner will feature a variety of meals (over 10) and of course the Georgian atmosphere.

Full-day excursion

The excusion will consist of several parts: (i) excursion to Tbilisi, (ii) lunch, (iii) excursion to Mzkheta (the old capital of Georgia), (iv) excursion to the mountains, (v) open-air barbeque.

Farewell dinner

Dinner at the fish restaurant "Over Kura". Kura is the river flowing through Tbilisi. As the name suggests, the restaurant is built in a way that it "hangs" over the river.




Back to the LPAR'99 Web page