rouaix@sylvaner.inria.fr (Francois Rouaix) (04/09/91)
I'm posting this on behalf of the organizing committee (P. Deransart):
======================================================================
ICLP'91
PARIS, June 25-28 1991, Worshops June 24.
======================================================================
PROGRAMME and REGISTRATION FEES
- please do NOT apply by email.
- you will receive by the end of April the programme including the
REGISTRATION and ACCOMMODATION forms. If you need some specific
information or if you think that you may NOT be on our mailing list
(which is very long), please ask or send your address to:
symposia@cluny.inria.fr
or: INRIA Rocquencourt
Bureau des Colloques, ICLP'91
- BP 105 -
78153 LE CHESNAY Cedex - France
Tel:(33) 1 39 63 53 49- Telex: 697 033F
Fax: (33) 1 39 63 56 38
or contact WAGON-LITS Tourisme for accommodation (see below).
----------------------------------------------------------------------
PRESENTATION
The Eighth International Conference on Logic Programming, co-sponsored
by the Association for Logic Programming (ALP), has been organised in
Paris this year by the Institut National de Recherche en Informatique
et en Automatique (INRIA). Previous Conferences were held in
Marseille, Uppsala, London, Melbourne, Seattle, Lisbon and Jerusalem.
Logic Programming is one of the most promising steps towards a more
declarative approach to Programming. It covers not just Horn clauses
Programming but also any extension using some kind of domains or
Logics. Originated in the early seventies from the techniques
developed in the field of Artificial Intelligence (Proof Theory), with
which it has obviously strong but not exclusive relationships. It has
been popularised by the programming language PROLOG. Its dialects
start to be widely distributed, and used in the industry, in many
areas such as Computer aided manufacturing (CAD, Robotics, IC design
and Realization, Planning), Software Engineering (Test generation,
System prototyping, Specification), AI systems (Expert Systems,
Knowledge bases, Man Machine Interfaces) and Data Bases.
The aim of ICLP'91 is to serve as a Forum for researchers confronting
the most recent advances of the domain, engineers as well as PROLOG
users, willing to update their expertise and contribute to the
development of the field. It also provides novices to the field an
opportunity to become familiar with the important issues in the area
of Logic Programming.
The programme of the Conference includes 56 research papers and 5
posters on applications presented by leading researchers from around
the world and covering a wide range of topics in the area. To broaden
the scope of the coverage, 4 invited speakers will present
contributions at the intersection of logic programming, artificial
intelligence, linear logic, industry and software Engineering and a
panel on "the contribution of Logic Programming to software
engineering" will be organized. A special aspect of this year
Conference is one day devoted to the specialised workshops (June 24)
and one day devoted to an advanced seminar (June 25). The 5 invited
speakers of the advanced seminar are some of the most respected
workers in the Logic Programming area or related domain. In addition,
there is the possibility to attend one or two over the half day
tutorials that cover both introductory and advanced topics running
June 25. This year, ICLP'91 includes a special event : an industrial
and research exhibition (June 26-28) held in parallel.
All these events will create -we hope- a "melting pot" in which
researchers as well as developers will find their interest and some
sources of inspiration.
-----------------------------------------------------------------
ORGANISATION
CONFERENCE CHAIRMAN
Pierre Deransart INRIA-Rocquencourt, France
PROGRAMME COMMITTEE CHAIRMAN
Koichi Furukawa ICOT, Japan
SPONSORSHIPS / PATRONAGES
AFCET Association Francaise pour la Cybernetique Economique et Technique
BULL
CNRS Centre National de la Recherche Scientifique (GRECO - Programmation)
DRET Direction des Recherches, Etudes et Techniques
IBM International Business Machines
ICOT
ONREUR Office of US Naval Research in EURope
PROGRAMME COMMITTEE / COMITE DE PROGRAMME
K. CLARK Imperial College, London (UK)
P. DERANSART INRIA-Rocquencourt (F)
Y. DEVILLE Univ. de Namur (B)
M. DINCBAS ECRC, Munich (G)
K. FURUKAWA ICOT (J)
W. DRABENT ICS- Warsaw (PL)
H. GAIFMAN The Hebrew Univ.Jerusalem (IL)
S. HARIDI SICS, Kista (S)
A. HEROLD ECRC, Munich (G)
G. LEVI Univ. of Pisa (I)
J. LLOYD Univ. of Bristol (UK)
K. MARRIOTT IBM , Yorktown Heights (USA)
G. MINTS Inst.of Cybernetics, Tallinn (USSR)
S. NAQVI Bellcore, Morristown (USA)
J.F. PIQUE Univ. de Marseille (F)
D. POOLE Univ. of British Columbia, Vancouver (CND)
A. PORTO Univ. of Lisbon (P)
V. SARASWAT Xerox Park, Palo Alto (USA)
T. SATO Electro-Technical Lab. Umezono (J)
H. SONDERGAARD Univ. of Melbourne (AU)
L. STERLING Case Western Reserve Univ., Cleveland (USA)
P. SZEREDI Univ. of Bristol (UK)
K. UEDA ICOT, Tokyo (J)
D.S. WARREN SUNY, Stony Brook (USA)
LOCAL COMMITTEE / COMITE LOCAL
Conference - Poster Session - Tutorials
Pierre DERANSART, INRIA-Rocquencourt
Exhibition / Exposition
Bruno LEGEARD ENSMM - Besancon
Emmanuel FERMAUT AFNOR, Syseca Logiciel, Paris
Workshops / Seminaires
Philippe CODOGNET INRIA - Rocquencourt and GRECO Programmation
Organisation - Information- / Organisation - Renseignements
Christine GENEST INRIA - Rocquencourt
Fran
Marie-Claude SANCE INRIA - Rocquencourt
--------------------------------------------------------------------
WORKSHOPS
Monday June 24, 1991 / lundi 24 juin 1991
INRIA Workshops 9:00 - 18:00
As for the previous ICLP and NACLP Conferences, workshops are proposed
to bring together researchers and provide a only occasion to have
informal presentation and discussions, widely open to new ideas, on
specialized topics.
Participants who want to present their work should directly contact
the workshop scientific organizer, while those who only want to attend
a workshop simply fill the corresponding part of the registration form.
W1 Parallel execution of Logic Programs
T. Beaumont and G. Gupta (Department of Computer Science, University of
Bristol, Queen's building, University Walk, Bristol BS8 1TR,
Great-Britain,
e-mail : {beaumont, gupta}@compsci.bristol.ac.uk)
And-, Or-, and Stream-Parallelism, Combinations of the above,
Experience with Actual Implementations, Optimizations and Performance
Analysis, Compile Time Analysis, Scheduling and Granularity Analysis,
Garbage Collection for Parallel Implementations, Managing Speculative
Work, Architectural Issues, Application Areas.
W2 Logic Programming Semantics and Non-Classical Logics
J-P. Delahaye (Departement Informatique, Bat. M3, Universite de
Lille I, 59655 Villeneuve d'Ascq cedex, France, e-mail :
delahaye@lifl.lifl.fr) and L. Farinas Del Cerro (Universite Paul
Sabatier, Toulouse, France) Non-Monotonic Logic, Many-valued Logic,
Modal Logic, Linear Logic, Constructive Logic, and their contributions
to the semantics of Logic Programming.
W3 Constraint Logic Programming
P. Van Hentenryck (Brown University, Box 1910, Providence, RI 02912,
USA,
e-mail : pvh@cs.brown.edu)
The workshop is devoted to the theory, design, implementation, and
application of constraint logic programming languages. Its aim is to
review and compare the existing work and to identify promising future
directions.
W4 Concurrent Logic Programming
C. Palamidessi (CWI, Postbus 4079, 1009 AB Amsterdam, The Netherlands,
tel : (31) 20 5924076, e-mail : katuscia@cwi.nl)
The aim of this workshop is to discuss new proposals and developments
in the field of concurrent logic / concurrent constraint languages.
Particular emphasis will be given to the following topics:
New linguistic paradigms, foundational aspects, development and
applications of semantic tools (abstract interpretation, deadlock
analysis, refinement techniques etc...) If you are interested in
participating, please, send three copies of an extended abstract or a
draft full paper before May 15, 1991.
W5 Logic Programming Environments
M. Ducasse (ECRC, Arabellastr. 17, D 8000 Munich 81, Germany, tel.
(49) 89 926 99 142, fax : (49) 89 926 99 170, e-mail :
mireille@ecrc.de) and G. Ferrand (Universite d'Orleans, France)
This Workshop will address both practical and theoretical aspects of
Logic Programming Environments. If you are interested in participating
please submit a 3-5 page abstract. Deadline for submission : May 1st ,
1991.
W6 Semantics Based Analysis of Logic Programs
R. Barbuti, M. Falaschi, R. Giacobazzi, L. Ricci
Please, send mail to R. Giacobazzi, Dipartimento di Informatica,
Universita di Pisa, Corso Italia, 40, I-56125 Pisa, Italy,
Fax : (39) 50 510226, e-mail: giaco@dipisa.di.unipi.it)
Semantics definition for abstract interpretation, frameworks for
abstract interpretation, applications of abstract interpretation,
abstract interpretation for parallel implementations, analysis of
concurrent programs, analysis of constraint logic programs, semantics
based program transformation, code optimization, control flow
analysis.
W7 Constructing Logic Programs
J-M. Jacquet (CWI, Kruislaan, 413, 1098 SJ Amsterdam, The Netherlands,
tel: (31) 20 592 4074, fax : (31) 20 592 4199, e-mail : jmj@cwi.nl)
This workshop aims at grouping researchers interested in the
development of programs (either sequential or concurrent) or in the
proofs of their properties (termination, absence of deadlock, ...).
More precisely, the following topics will be adressed :
Constructive methods of program development, proof methods of program
properties, program transformations, semantical studies of programs.
W8 Advanced logic programming tools and formalisms for language
processing
P. Saint-Dizier, (IRIT, Universite Paul Sabatier, 118 route de
Narbonne, 31062 Toulouse, France, tel : (33) 61 55 63 44,
e-mail: stdizier@irit.irit.fr)
The aim of this workshop is to bring together and to promote exchanges
between the Logic Programming and the Language Processing communities.
Advanced Logic Programming areas of prime importance to language
processing will be highlighted, among which : Constraint logic
programming, typed and object-oriented logic programming, specialized
unification mechanisms, partial evaluation and intelligent strategies.
W9 Merging Object-Oriented and Logic Programming
J. Malenfant (Equipe mixte Rank-Xerox France - LITP, Universite
Pierre et Marie Curie, Bureau 203, Tours 45-55, 75252 Paris Cedex 05,
France, tel: (33) (1) 44 27 61 99, e-mail : malenfan@rxf.ibp.fr) and
J-M. Andreoli (ECRC, Munich, Germany)
Models and semantics for object-oriented logic programming (OOLP), OOLP
languages design and implementation, comparisons and categorization of
OOLP models and languages, concurrent OOLP, applications and
perspectives of OOLP.
Invited talk by H. Ait-Kaci who will present his view on OOLP.
Invitations to the workshop will be issued on the basis of short
position papers (3 pages)
---------------------------------------------------------------------
ADVANCED SEMINAR
Tuesday June 25, 1991 / mardi 25 juin 1991
Advanced Seminar / Seminaire avance
8h00 - 9h00 Registration / Accueil des participants
9h00 - 10h30 Parallel Programming and Large-scale Applications in the
FGCS Project
K. Taki (ICOT, Tokyo, Japan)
10h30 - 11h00 Break / Pause
11h00 - 12h30 Abstract interpretation of Logic Programs
P. Cousot (Ecole Polytechnique, Palaiseau, France)
12h30 - 14h00 Lunch / Dejeuner
14h00 - 15h30 Full First Order Logic Programming and Truth Predicates
T. Sato (Electrotechnical Laboratory, Ibaraki, Japan)
15h30 - 16h00 Break / Pause
16h00 - 17h30 On the semantics of Logic Programs
G. Levi (Universita di Pisa, Italy)
17h30 - 19h00 Parallel Logic Programming based on the Andorra
Principle
S. Haridi (SICS, Kista, Sweden)
19h00 Welcome drink / Aperitif de bienvennue
----------------------------------------------------------------------
TUTORIALS
Tuesday June 25, 1991 / mardi 25 juin 1991
Tutorials
8h00 - 9h00 Registration / Accueil des participants
T1 9h00-12h30 Basic concepts of Logic Programming and PROLOG
G. Ferrand (Universite d'Orleans, INRIA Rocquencourt, France)
The aim of this tutorial is twofold : For beginners, it is an
introduction to the Logic Programming paradigm and to programming in
PROLOG. For people teaching PROLOG, it shows a pedagogical and
methodological expression of the basic principles of Logic
Programming. PROLOG is now well known not only as a high level
programming language but also as a prototyping tool for writing
executable specifications. This tutorial is not an introduction to a
particular PROLOG dialect. The emphasis is on the features of Logic
Programming which are new and attractive with respect to conventional
programming. In particular the idea is developped that a program is
the description of the relationship between objects and that, from
this description, PROLOG derives answers to questions. This
explanation is based on a pedagogical ordering of the key notions such
as : declarative meaning of a program, proof, unification, non
determinism, strategies...
Gerard Ferrand is professor at the University of Orleans and he is
collaborating with the ChLoE project at INRIA. He has been working
since 1984 in the domain of Logic Programming. His work is focused on
semantics and the declarative diagnosis of PROLOG program.
Tuesday June 25, 1991 / mardi 25 juin 1991
T2 9h00-12h30 Logic Programming for Language Processing
P. Saint-Dizier (Universite Paul Sabatier, Toulouse, France)
This tutorial will address both traditional uses and advanced features
of Logic Programming of fundamental and practical importance to
language processing. Together with general principles and methods,
this tutorial will offer numerous applications and basic programmes.
The main topics of the tutorial will be :
- DGC, interpreters and compilers, syntactic tree construction,
semantic representation computation ;
- unification grammars, bottom-up parsing with unification grammars,
Login and lexical organization, large scale lexicons ;
- Some prominent logic-based grammars : motivations and principles ;
- Constraint Logic Programming for language processing : feature
systems, precedence and dependencies.
This tutorial is designed for engineers, students, researchers and
logic programmers willing to deepen their knowledge about this rapidly
growing research and application development field.
P. Saint-Dizier is an engineer in computer science and got his PhD in
Computational Linguistics in 1983 at the University of Rennes, France.
Since then, he is leading several projects in computational
linguistics (e.g. syntax on discontinuous consistency, generation
strategies, general semantics, and computational lexicons and feature
systems) using advanced features of logic programming. He has
published and co-edited several books in the area.
T3 9h00-12h30 Logic Programming Environments
A. Porto (Universidade Nova de Lisboa, Portugal)
This tutorial will provide insights into issues of design and use of
advanced Logic Programming Environments. It will present results of
the Esprit project ALPES, and the presentation will be made by several
researchers who were actively involved in the project. The intended
audience includes environment designers, users who want to know what
to expect of Logic Programming environments for building applications,
and logic programmers curious about extensions of the paradigm and
methodology used to build environments. The main themes will be the
contextual logic programming approach to modularity and its impact on
the design of the environment, architectural design issues of
components and their communication, state of-the-art of declarative
debugging, integration with the X-windows system, and use of the
environment to build other environments such as expert system shells.
This tutorial is aimed at a wide audience, consisting mostly of : (1)
programming environment designers, (2) general users wanting to find
out how logic programming environments can help them develop
applications, (3) logic programmers or researchers interested in the
language extensions and methodologies used in the construction of the
environment.
Antonio Porto is Associate Professor at Universidade Nova de Lisboa,
Portugal, where he got his PhD in Computer Science in 1985. He has been
active in research in the area of Logic Programming since its early
days. He participated in the Esprit project ALPES for Advanced Logic
Programming Environments, and he is currently involved in the Esprit
BRA project "Integration" for integrating, foundations of Functional,
Logic and Object- Oriented Programming.
T4 9h00-12h30 Warren's Abstract Machine: A Tutorial Reconstruction
H. Ait-Kaci (member of the Research Staff, Digital Equipment
Corporation, Paris Research Laboratory, France)
This tutorial's goal is to demystify one of the most important yet
poorly understood aspects of logic programming: the Warren Abstract
Machine, or WAM. Specified by David H. D. Warren in 1983, the WAM is
an abstract (non-physical) computer that has emerged as the de facto
standard for the compilation and implementation of Prolog. Although
the benefits of its design have been widely accepted, few have been
able to penetrate the WAM. Even the few attempts to explain it have
presented it as a fully optimized whole, thus failing to bring out its
techniques for compiling and optimizing symbolic computing that
generalize beyond Prolog. In a step-by-step construction of the WAM,
starting from elementary unification, we will add features in a
gradual manner, clarifying all complex aspects of the design. In this
systematic introduction, we will define separate abstract machines for
each conceptually separate part of the design and refine them, finally
stitching them together to make a complete WAM, leaving nothing
unjustified. Little background will be assumed. However, in order to
benefit from this tutorial, one must have a basic understanding of
Prolog's operational semantics ; in particular, of unification and
backtracking. Course outline : 1. Introduction, 2. Unification, 3.
Flat resolution, 4. Pure Prolog, 5. Optimizations (including Last Call
Optimization, Environment Trimming and Cut).
Hassan Ait-Kaci obtained his M.S. and Ph.D. in Computer and
Information Science from the University of Pennsylvania in 1982 and
1984, respectively, and his research director "habilitation" in
Computer Science from the University of Paris-VII, in 1989. In 1984,
he joined the research staff of MCC, in Austin, Texas.
Since 1988, he has been a member of the research staff of the Digital
Equipment Corporation's Paris Research Laboratory in Rueil-Malmaison,
France, conducting research in the design of programming environments
based on executable constraint specifications. The instructor is the
author of a monograph bearing the same tittle as this tutorial and to
appear at MIT Press.
12h30-14h00 Lunch / Dejeunner
T5 14h30-18h30 Negation in Logic Programming
J. C. Shepherdson (University of Bristol, UK)
The aim of the tutorial is to give an elementary introduction,
surveying results without giving proofs, of the problem of dealing
with negation in logic programming, and of the solutions which have
been proposed.
1 - The problem of negation in logic programming
2 - Negation as failure
3 - Closed world assumptions
4 - The Clark completion
5 - Completeness results for stratified and call-consistent programs
6 - Semantics based on special classes of models eg perfect,
well-founded
7 - 3-valued logic
8 - Other non-classical logics - modal, intuitionistic, linear
The tutorial is aimed at novices as at specialists who want to update
their knowledges. Little background on Logic Programming will be
assumed.
John C. Shepherdson is professor of Mathematics at the University of
Bristol.
Degrees : MA, ScD, FIMA, FBA
His field of research is : Mathematical logic and theory of
computation
T6 14h30-18h30 Industrial Applications of Constraints Logic
Programming
Languages
J-J. Chabrier (Computer Science Research centre of Dijon), C.
Pradelles-Lasserre (Dassault Aviation), B. Legeard (ENSMM,
Besancon, France)
The aim of the turorial is to demonstrate the potentiality of
Constraints Logic Programming Languages. These languages allow
declarative modelling in terms of constraints on interpreted domains
such as numerical ones. In order to deal with these constraints,
unification is supplemented by constraint solving techniques on these
domains that greatly enhance the efficiency of the Prolog-like
interpretation. We analyse two industrial applications to exemplify
two types of constraints : on one hand linear constraints on finite
domains (integrers), which enable to model combinatorial problems, and
on the other hand linear constraints on rational numbers.
So, this tutorial is divided into three lectures of one hour each :
- A comprehensive survey of the Constraints Logic Programming
Languages, over various domains (rational, booleans, finite domains),
various languages (CLP(R), PROLOG III, CHIP, CAL...) and with some
guidelines for using CLP techniques in industrial context ;
- The presentation of a CHIP program which solves a planning problem
for aircraft manufacturing at Dassault Aviation ;
- The presentation of a PROLOG III program, which solve a
cutting-stock problem for a kitchen furniture manufacture of Jura ;
Jean Jacques Chabrier is professor at the University of Dijon and
director of the Computer Science Research Center of Dijon. His
research team is mainly oriented on the development of Contraints
Logic Programming techniques. Claudine Pradelles, graduated from
ENSIMAG and PhD in CS from University Paul Sabatier in Toulouse, left
teaching activities at ENSAE in 1984 to join DASSAULT AVIATION as
responsable of AI research activities. She is now AI group manager at
DASSAULT Space Centre in Toulouse.
Her interest has always been in Logic Programming, and since 1987,
more specially on CLP applications.
Bruno Legeard is Professor at ENSMM, University of Besancon. He got
the PhD in Computer Science at INSA of Lyon in 1987. Since 1989, he
was the manager of the Artificial Intelligence activity, at CR2A, a
french software company, and developed many projects of rapid
prototyping in Prolog. He is now, currently working on a set
Constraints Logic Programming language.
T7 14h30-18h30 Logic Programming in Software Engineering
Y. Deville (University of Namur, Belgium), L. Sterling (Case Western
Reserve University, USA), P. Deransart (INRIA-Rocquencourt, France)
The tutorial will show how Prolog can be used successfully for
software engineering. The primary focus will be on a method for
systematic construction of Prolog programs, complete from initial
informal specification through logic description to final program.
Careful attention will be given to what needs to be specified and
consequences for documentation. Attention will be given to correctness
issues. Further, it will be shown how complicated Prolog programs can
be described as consisting of several 'techniques' applied to a common
control flow (or skeleton). By teaching students common skeletons and
techniques, large programs can be developed routinely and maintained
by a team of software engineers.
The final third of the tutorial will present a specification language
based on logic programming. The principles of the design of a
specification using this language, will be shown and an application
presented of the specification of standard PROLOG for the ISO project.
The tutorial is intended for software engineers, Prolog programmers,
managers of Prolog projects, teachers of Prolog - anyone interested
in the actual development of Prolog programs.
Yves Deville, University of Namur (Belgium) is the author of the book
"Logic Programming : Systematic Program Development" (Addison-Wesley).
Leon Sterling is Associate Professor in the Department of Computer
Engineering and Science at Case Western Reserve University and
Director of the Center for Automation and Intelligent Systems Research
(USA). His research focuses on applications of Prolog for software
engineering.
Pierre Deransart is research Director at INRIA-Rocquencourt (France).
His research focuses on Logic Programming methodology.
T8 14h30-18h30 Logics for Logic Programming
D. Miller (University of Edinburgh, Great-Britain, University of
Pennsylvania, USA)
Many kinds of logics have been used to enrich the logical foundation
of logic programming beyond that of Horn clauses. In this tutorial,
sequent calculus proof systems will be used to present various logics.
Using such proof systems, there is a natural and general criterion for
determining whether or not a given logic (or sublogic) supports
goal-directed proof search, the kind of search that seems to be at the
heart of logic programming. This criterion will be used to examine the
nature of logic programming in a variety of logics, including
classical, intuitionistic, minimal, first-order, higher-order, and
linear logic. This tutorial is intended to be an introduction to the
sequent calculus and to some of the declarative and operational
aspects of these logics. Examples of how all these different logics
can be used in applications will be given. Attendees should be
familiar with Prolog programming and be comfortable with proofs by
induction.
Dale Miller is an Associate Professor in the Computer Science
Department of the University of Pennsylvania. During the 1990-1
academic year, he is on sabbatical at LFCS, University of Edinburgh.
His interests include proof theory, automated deduction, and logic and
function programming.
19h00 Welcome drink
----------------------------------------------------------------------
CONFERENCE, EXHIBITION, POSTERS
Wednesday June 26, 1991
8h30-9h15 Registration / Accueil des participants
Plenary session / Session pleniere
9h15-9h30 Opening address / Discours de bienvennue
P. Deransart (INRIA Rocquencourt, France)
9h30-10h30 Keynote speech / Conference d'ouverture
Legislation as Logic Programs
R. Kowalski (Imperial College, London, Great-Britain)
Chairman / President : K. Furukawa (ICOT, Tokyo, Japan)
10h30-11h00 Break / Pause
Parallel sessions / Sessions paralleles
11h00-12h30 Session 1A : Theory 1 / Theorie 1
Negations as Hypotheses : an Abductive Foundation for Logic
Programming
P. M. Dung (Asian Institute of Technology, Bangkok, Thailand)
Explaning SLDNF Resolution with Non-Normal Defaults
M. A. Casanova, A. Hemerly, R. A. de T. Guerreiro (IBM Brasil, Rio de
Janeiro, Brasil)
Negation As Instantiation : a New Rule for the Treatment of Negation in
Logic Programming
M. Martelli (Universita di Genova, Italy), C. Palamidessi, A. Di
Pierro (Universita di Pisa, Italy)
11h00-12h30 Session 1B : Implementation 1
Extending the WAM for Intelligent Backtracking
P. Codognet (INRIA-Rocquencourt, France), T. Sola (LCR Thomson-CSF,
Orsay, France)
The Register Allocation in WAM
L. Matyska, A. Jergova, D. Toman (Masaryk University, Brno,
Czechoslovakia) Recursion vs. Iteration in Prolog
M. Meier (ECRC, Munich, Germany)
12h30-14h00 Lunch / Dejeuner
Parallel sessions / Sessions paralleles
14h00-15h30
Session 2A : Programme Analysis 1 / Analyse de Programme 1
Combined Determination of Sharing and Freeness of Program Variables
through Abstract Interpretation
K. Muthukumar (MCC and University of Texas at Austin, USA), M.
Hermenegildo (Universidad Politecnica de Madrid, Spain)
A Generic Abstract Interpretation Algorithm and its Complexity
Analysis
B. Le Charlier (University of Namur, Belgium), K. Musumbu (Universite
de Bordeaux, France)
P. Van Hentenryck (Brown University, Providence, USA)
Derivation and Safety of an Abstract Unification Algorithm for
Groundness and Aliasing Analysis
M. Codish, E. Yardeni (Weizmann Institute of Science, Rehovot,
Israel), D. Dams (University of Technology, Eindhoven, The Netherlands)
14h00-15h30 Session 2B : Applications 1
Specifications as Search Keys for Software Libraries
E. J. Rollins, J. M. Wing (Carnegie Mellon University, Pittsburgh, USA)
Real-size Compiler Writing Using Prolog with Arrows
J-F. Monin (CNET, Lannion, France)
Toward Automatic Test Data Set Selection Using Algebraic Specifications
and Logic Programming
B. Marre (Universite Paris-Sud, Orsay, France)
15h30-16h00 Break / Pause
Parallel sessions / Sessions paralleles
16h00-17h00
Session 3A : Higher Order 1 / Ordre superieur 1
A Simple Logic of Set Abstractions
W. Chen (Southern Methodist University, Dallas, USA), D. S. Warren
(SUNY at Stony Brook, USA)
{log} : A Language for Programming in Logic with Sets
A. Dovier, E. G. Omodeo, E. Pontelli, G. Rossi (Universita degli Studi
di Udine, Italy)
16h00-17h00 Session 3B : Constraints logic Programming 1
Programmation en logique avec contraintes 1
Perfect Relaxation in Constraint Logic Programming
U. Montanari, F. Rossi (Universita di Pisa, Italy)
Modeling Answer Constraints in Constraint Logic Programs
M. Gabbrielli, G. Levi (Universita di Pisa, Italy)
Plenary session / Session pleniere
17h15-18h15 Invited lecture / Conference invitee :
About Logic and Logic Programming
J-Y. Girard (CNRS, Universite Paris VII, France)
Chairman / President : D. Miller (University of Edinburgh,
Great-Britain and University of Pennsylvania, USA)
18h15-19h15 Panel / Table ronde
The Contribution of Logic Programming to Software Engineering
Moderator / Animateur : P. Deransart
whith the participation of / avec la participation de :
K. Bowen (USA), P. Wegner (USA), T. Dodd (UK), G. Khan (F), P.
Taillibert (F) ...
------------------------------------------------------------------
Thursday June 27, 1991 / Jeudi 27 juin 1991
Conference, Exhibition, Posters
Parallel sessions
9h00-10h30 Session 4A : Higher Order 2 / Ordre superieur 2
Unification of Simply Typed Lambda-Terms as Logic Programming
D. Miller (University of Edinburgh, Great-Britain)
Higher-Order Unification as a Theorem Proving Procedure
M. Hagiya (Kyoto University, Japan)
Higher Level Meta Programming in Qu-Prolog 3.0
A. S. K. Cheng, P. J. Robinson, J. Staples (University of Queensland,
Australia)
9h00-10h30 Session 4B : Implementation 2
NUA-Prolog : An Extension to the WAM for Parallel Andorra
D. Palmer, L. Naish (The University of Melbourne, Australia)
The Andorra-I Engine: A Parallel Implementation of the Basic Andorra
Model
V. Santos Costa, D. H. D. Warren, R. Yang (University of Bristol,
Great-Britain)
Compilation Techniques for Nondeterminate Flat Concurrent Logic
Programming Languages
M. Korsloot (Delft University of Technology, The Netherlands), E.
Tick, University of Oregon, Eugene, USA)
10h30-11h00 Break / Pause
Parallel sessions / Sessions paralleles
11h00-12h30 Session 5A : Programme Analysis 2 / Analyse de Programme 2
Deriving Termination Proofs for Logic Programs, using Abstract
Procedures
K. Verschaetse, D. De Schreye (K. U. of Leuven, Belgium)
An Algebraic Semantics of Prolog Program Termination
B. J. Ross, A. Smaill (University of Edinburgh, Great-Britain)
Suspension Analysis for Concurrent Logic Programs
M. Codish (Weizmann Institute of Science, Rehovot, Israel), M.
Falaschi, Universita di Pisa, Italy), K. Marriott (IBM, Yorktown
Heights, USA)
11h00-12h30 Session 5B : Abduction
Nonmonotonic Reasoning with Well Founded Semantics
L. M. Pereira, J. Nunes Aparicio, J. Alferes (AI Centre, Uninova,
Monte da Caparicia, Portugal)
Extended Logic Programs with Default Assumptions
K. Inoue (ICOT Research Center, Tokyo, Japan)
Computing Abduction by Using the TMS
K. Satoh, N. Iwayama (ICOT, Tokyo, Japan)
12h30-14h00 Lunch / Dejeuner
Parallel sessions
14h00-15h30 Session 6A : Extensions
Lexical Logic Programs
Y. Moscowitz, E. Shapiro (The Weizmann Institute of Science, Rehovot,
Israel)
AMLOG-E : A new Approach Towards Amalgamation
G. Mansfield, A. Togashi, N. Miyake, S. Noguchi (Tohoku University,
Sendaishi, Japan)
Polymorphically Typed Logic Programs
E. Yardeni, E. Shapiro (The Weizmann Institute of Science, Rehovot,
Israel),
T. Fruehwirth (Technical University of Vienna, Austria)
14h00-15h30 Session 6B : Applications 2
Restriction Site Mapping in CLP(R)
R. H. C. Yap (IBM, Yorktown Heights, USA)
A Model Generation Theorem Prover in KL1 Using a Ramified-Stack
Algorithm
H. Fujita, R. Hasegawa (ICOT, Tokyo, Japan)
A Set of Tools for VHDL Design
P. B. Reintjes (Quintus Computer Systems, Inc., Delray Beach, USA)
15h30-16h00 Break / Pause
Parallel sessions / Sessions paralleles
16h00-17h00 Session 7A: Theory 2 / Theorie 2
Extending S-Models to Logic Programs with Negation
D. Turi (Universita di Pisa, Italy)
Extended Well-Founded Model Semantics for Deductive Databases and
General Logic Programs
Y. Hu, L. Y. Yuan (University of Alberta, Canada)
16h00-17h00 Session 7B : Uncertainty / Modele probabiliste
A Semantical Framework for Supporting Subjective and Conditional
Probabilities in Deductive Databases
R. T. Ng, V. S. Subrahmanian (University of Maryland, College Park,
USA)
Towards Possibilistic Logic Programming
D. Dubois, J. Lang, H. Prade (Universite Paul Sabatier, Toulouse,
France)
Plenary session / Session pleniere
17h15-18h15 Invited lecture / Conference invitee : S. L. Graham
(Syracuse University, New-York, USA)
Chairman / President : K. Bowen (University of California, Barclay,
USA)
18h15-19h00 ALP Meeting / Reunion ALP
19h30-22h30 Reception (Eiffel Tower / Tour Eiffel)
Speech / Discours : H. Gallaire (GSI, Paris, France)
-------------------------------------------------------------------------
Conference, Exhibition, Posters
Friday June 28, 1991 / Vendredi 28 juin 1991
Parallel sessions / Sessions paralleles
9h00-10h30 Session 8A: Programme Analysis 3 / Analyse de Programme 3
Automatic Complexity Analysis of Logic Programs
S. K. Debray, N-W. Lin (The University of Arizona, Tucson, USA)
Proving Program Properties by means of SLS-Resolution
J. M. Lever (Imperial College, London, Great-Britain)
Proving Correctness of Logic Programs Using Axiomatic Semantics
L. Colussi, E. Marchiori (University of Padova, Italy)
9h00-10h30 Session 8B : Constraints logic Programming 2 /
Programmation en logique avec contraintes 2
The Cardinality Operator : A new Logical Connective for Constraint
Logic Programming
P. Van Hentenryck (Brown University, Providence, USA), Y. Deville
(University of Namur, Belgium)
Constraint Operations for CLP(FT)
D. A. Smith (Brandeis University, Waltham, USA)
Overview of the CHIP Compiler System
A. Aggoun, N. Beldiceanu (ECRC GmbH, Munich, Germany)
10h30-11h00 Break / Pause
Plenary session / Session pleniere
11h00-12h00 Invited lecture / Conference invitee :
Logic Programming at IBM : from the Lab to the Customer
B. Robinet (IBM, Paris, France)
12h00-12h30 Invited lecture / Conference invitee :
An overview of Prolog standardization - some progress, some problems,
some solutions
R. Scowen (National Physical Laboratory, Teddington, Great-Britain)
Chairman / President : L. Sterling (Case Western Reserve University,
USA)
12h30-14h00 Lunch / Dejeuner
Parallel sessions / Sessions paralleles
14h00-15h00 Session 9A : Theory 3 / Theorie 3
Perfect Model Semantics for Logic Programs with Equality
L. Bachmair (SUNY at Stony Brook, USA), H. Ganzinger (Universit
t
Dortmund, Germany)
Bottom-Up Evaluation of Hierarchical Disjunctive Deductive Databases
J. A. Fernandez, J. Minker (University of Maryland, College Park, USA)
14h00-15h00 Session 9B : Implementation 3
Performance of Aurora on NUMA machines
S. Mudambi (Brandeis University, Waltham, USA)
Scheduling Or-Parallelism in Muse
K. A. M. Ali, R. Karlsson (SICS, Kista, Sweden)
Parallel sessions / Sessions paralleles
15h00-16h00 Session 10A : Theory 4 / Theorie 4
Substitution and Refutation Revisited
H-P. Ko, M. E. Nadel (The MITRE Corporation, Bedford, USA)
Generalizing Cover Axioms While Retaining Useful Properties of SLDNF
Resolution
H. Decker (Siemens, Mnchen, Germany)
15h00-16h00 Session 10B : Implementation 4
The Andorra-I Preprocessor : Supporting Full Prolog on the Basic
Andorra Model
V. Santos Costa, D. H. D. Warren, R. Yang (University of Bristol,
Great-Britain)
CARMEL-4 : The Unify-Spawn Machine for FCP
A. Harsat, R. Ginosar (Israel Institute of Technology, Haifa, Israel)
16h00-16h30 Break / Pause
Parallel sessions / Sessions paralleles
16h30-17h30 Session 11A : Theory 5 / Theorie 5
A clausal Form for the Completion of Logic Programs
J. Harland (University of Melbourne, Parkville, Australia)
Well-Founded Completions of Logic Programs
T. C. Przymusinski (University of Texas at El Paso, USA)
16h30-17h30 Session 11B : Implementation 5
Naive Reverse can be Linear
P. Brisset, O. Ridoux (IRISA, Rennes, France)
Implementation Techniques for Scoping Constructs in Logic Programming
B. Jayaraman (State University of New York, Buffalo, USA), G. Nadathur
(Duke University, Durham, USA)
17h30 End of the Conference / Fin de la conference
---------------------------------------------------------------------
EXHIBITION
Exhibition / Exposition
The exhibition will be held in the room Topaze of the Hotel Pullman St
Jacques, right in the heart of Paris. It will assemble the
fundamentals of what Prolog offers in terms of products, software
tools, and services associated with the Prolog language, logic
programming and its development.
Vendors, service suppliers, industrial users, and research centers
will join this exibition to show the industrial emergence of this
technology in various areas of application : knowledge based systems
and software engineering tools of course, but also those of automatic
control, process control and even management.
The ICLP'91 exhibition will bring together the essential of what there
is to offer in this rapidly developing domain, where there has been a
remarkable evolution of techniques in areas such as logic programming
with constraints, or those related to implementation on parallel
machines. Participants in ICLP'91 will thus obtain demonstrations of
the principal Prolog environments, become aware of their efficiency
and interface users power, attend various industrial application
presentations and catch a glimpse of the near future from various
prototypes presented by research centers.
They already rented a booth / Ils ont deja reserve un stand :
ALS, BIM, BULL S.A./CEDIAG, COSYTEC, Dassault Electronique, DELPHIA,
ECRC GmbH, ESD, GRECO Programmation, IBM, IRISA Rennes, Le Monde en
Tique, LPA, MIT Press, PROLOGIA, Universites de Besancon, Dijon, Nice,
It is still possible to participate in the exhibition:
Exhibition organization / Organisation Exposition
SCOIR - 2ter rue de Chantilly - F.75009 PARIS
Tel : (33) 1. 42.85.17.90 - Fax : (33) 1. 42.80.59.51
-------------------------------------------------------------------------
POSTERS
Posters display / Presentation de posters
Prolog as a Host Language
B. Migault (Ecole Nationale Superieure des Arts et Industries de
Strasbourg,
France), F. Rousselot (Equipe SCOLIA, Strasbourg, France), L. Cervoni
(ITMI Informatique, Paris, France)
Updatable Relations and Transactions in the logic Programming Language
PROTOS-L
S. Boettcher (IBM Deutschland GmbH, Stuttgart, Germany)
An Intelligent CAD System
A. Fahmy (Military Technical College, Cairo, Egypt)
Co-operative Hierarchical Layout Problem Solver on Parallel Inference
Machine
T. Watanabe, K. Komatsu (Hitachi Ltd, Kanagawa, Japan)
A Rule Oriented FSM Design System with Prototyping Capabilities
M. Pushhammer, R. Schloeglhofer (Alcatel Austria AG, Wien, Austria)
==========================================================================
HOTELS
Participants who require hotel reservation should contact directly to
the following Agency no later than May 25:
WAGONS-LITS TOURISME
Service Congres
Melle Elisabeth CONVERS
40, Rue Kleber - 92307 Levallois Perret
Tel : (33) (1) 47594746 - Telex : 611 507 F.-
Fax : (33) (1) 47594773
Please respond as early as possible to secure accomodation.
Train and plane
- A 20% discount may be obtained from the SNCF for a round trip ticket
within France.
- A 35% discount may be obtained from Air Inter or Air France for
French domestic flights.
Reduced rate forms will be sent to participants requesting them on the
registration form.
Visa
Participants requiring a visa for entry into France are strongly
advised to make their application in their home countries at least
two months before the intended date of travel.
-------------------------------------------------------------------
LOCAL ARRANGEMENTS
WORKSHOPS : They will be held in INRIA on Monday June 24. A free
shuttle will leave Paris, place Charles de Gaulle - Etoile (in front
of the Parking Foch) at 8:00 am for INRIA. It will drive the
participants back to Paris, place Charles de Gaulle at 6:00 pm.
CONFERENCE : Registration: Mezzanine 3
1 - TUTORIALS AND ADVANCED SEMINAR
Registration desk will be open on Tuesday June 25 , 8:00 am
2 - CONFERENCE
Registration will be open on Wednesday June 26, 8:15 am
THE HOTEL PULLMAN SAINT-JACQUES
(on the left bank)
Close to Montparnasse and the Latin Quarter, and just five minutes
from the city's belt highway, the hotel enjoys quick and easy
connections to and from the Paris airports : Roissy-Charles de Gaulle
is a 45 minutes trip by RER subway, from the station
Denfert-Rochereau. Orly, is just 35 minutes via bus number 215,
running every 10 minutes and stopping just in front of the hotel.With
the additional advantage of close location to Paris rail stations
Lyon, Austerlitz and Montparnasse. Pullman Saint-Jacques is a
particulary convenient hotel for business and tourism.
Secretariat
The Secretariat will be available during the entire ICLP'91.
Official Languages
English - French
Proceedings
Conference proceedings will be published by the MIT Press and
distributed to the participants.
Evening Event
On Thursday June 27th at 7:30 p .m, a reception will be
organized for the participants at the Eiffel Tower
Travel Agency (Mezzanine 3)
WAGONS-LITS TOURISME Agency will have a desk at the Conference
Secretariat
Banking Facilities (Mezzanine 1)
1- An exchange bureau is open all day long at the hotel reception desk
2- A cash point service is available 24 hrs a day and accepts all
VISA cards : BNP - Agence Blanqui
101 Boulevard A. Blanqui - PARIS 13eme ( 5 mn walk from the hotel)
Telephone Messages
Telephone messages may be left for participants during the Conference
at the hotel PULLMAN,
Tel: (33) (1) 40.78.79.80
Insurance
The organizers cannot be held liable to Conference participants for
injury, damage or loss of their personal
property. It is suggested that participants make their own insurance
arrangements.
INFORMATION / SECRETARIAT
INRIA-Rocquencourt
Bureau des Colloques, ICLP'91
Domaine de Voluceau - Rocquencourt - BP 105
78153 Le Chesnay Cedex - France
Tel: (33) 1. 39. 63. 56. 00.
Fax: (33) 1. 39. 63. 56. 38
Telex: 697 033F
E-mail : symposia@cluny.inria.fr
-----------------------------------------------------------
REGISTRATION FEES (in French Francs, VAT 18,60% included)
| Before May 24 | After May 24
ICLP'91
CONFERENCE 25-28/06/91 | Participant 2,500 FF | Participant 2,850 FF
& workshop (24/06/91) | ALP Member* 2,200 FF | ALP Member* 2,550 FF
(without tutorial)
CONFERENCE 25-28/06/91 | Participant 2,900 FF | Participant 3,350 FF
& workshop (24/06/91) | ALP Member* 2,600 FF | ALP Member* 3,050 FF
+ 1 Tutorial
CONFERENCE 25-28/06/91 | Participant 3,300 FF | Participant 3,850 FF
& workshop (24/06/91) | ALP Member* 3,000 FF | ALP Member* 3,550 FF
+ 2 Tutorials
STUDENT | THE WHOLE PROGRAMME : 700 FF
less than 27 years** ( Conference, workshop, advanced seminar,
tutorials and proceedings (without meals and reception) included)
For those who cannot attend the conference, we offer two possibilities
to attend:
WORKSHOPS ONLY (JUNE 24, 1991) 300 FF
TUTORIALS OR ADVANCED SEMINAR (JUNE 25, 1991) 1,400 FF
* Indicate your ALP membership number:
**Please, enclose a photocopy of the 1990-1991 student card
These fees include :
1. For Worksops : attendance to the workshop, free shuttle between
Paris and INRIA, lunch.
2. For tutorials and advanced seminars : attendance to the sessions,
lecture notes of tutorials, breaks, lunch and drink on June 25 th.
3. For the conference : attendance to the workshops, sessions,
proceedings, breaks, lunches and reception at the Eiffel Tower on June
27th, at 7:30 pm.
-----------------------------------------------------------------------
Cancellations
Fees will be returned in full for any written cancellation received
before June 14th (date postmarked stamp). No refund will be made in
respect of cancellations received after this date.
============================end of the ICLP'91 programme==============