🚀 go-pugleaf

PROLOG Digest            Tuesday, 20 May 1986      Volume 4 : Issue 14

Today's Topics:
SEQUENTIAL PARLOG MACHINE
Conference Announcement
----------------------------------------------------------------------

Date: Wed, 23 Apr 86 18:09:32 BST
From: mcvax!doc.ic.ac.uk!sg@seismo.CSS.GOV
Subject: SEQUENTIAL PARLOG MACHINE


                       SEQUENTIAL PARLOG MACHINE

We are now distributing the first release of our sequential
PARLOG system, to run on Unix machines.  This system is
based on an abstract instruction set -- the SPM (Sequential
 PARLOG Machine) -- designed for the sequential implementation
of PARLOG.  The system comprises an SPM emulator, written in
C; a PARLOG-SPM compiler, written in PARLOG; and a query
interpreter also written in PARLOG.  An environment allows
users to create, compile, edit and run programs.

The system is a fairly complete implementation of the PARLOG
language.  Unlike previous implementations of PARLOG, and of
other parallel logic programming languages, there is no "flat"
requirement for guards; guards may contain any "safe" PARLOG
conjunction.  A powerful metacall facility is provided.

The SPM instruction set was designed by Steve Gregory.  The
system has been implemented by Alastair Burt, Ian Foster, Graem
Ringwood and Ken Satoh, with contributions by Tony Kusalik.
The work has been supported by the SERC, ICL and Fujitsu.

The SPM system is currently available, in object form, for the
Sun  and Vax under Unix 4.2; it is distributed on a tar format
tape, which includes all documentation.  Anyone interested in
obtaining a copy should first contact me at the following
address, to request a copy of the licence  agreement.  The
software will then be shipped on receipt of the completed
licence and prepayment of the handling fee.

-- Steve Gregory
    Dept. of Computing
    Imperial College
    London SW7 2BZ
    England

------------------------------

Date: Wed, 23 Apr 86 15:03:23 BST
From: mcvax!doc.ic.ac.uk!csa@seismo.CSS.GOV
Subject: Conference Announcement

        THIRD INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING
                         July 14-18, 1986

                          FINAL PROGRAM


Monday, July 14

All Day Tutorial:  Logic programming and its applications by
Robert Kowalski and Frank Kriwaczek.

Half Day Tutorials:
A.M. Prolog implementation and architecture.  David Warren
or   Techniques for natural language processing in Prolog.
Michael McCord

P.M. Parallel logic programming.  Keith Clark and Steve
Gregoryor   Japanese Fifth Generation Applications Research.
Koichi Furukawa


Tuesday, July 15

KEYNOTE ADDRESS:  K. Fuchi, ICOT

1a.  Parallel implementations

An abstract machine for restricted AND-parallel execution of
logic programs.
Manuel V. Hermenegildo, University of Texas at Austin.

Efficient management of backtracking in AND-Parallelism.
Manuel V. Hermenegildo, University of Texas at Austin & Roger
I. Nasr, MCC.

An intelligent backtracking algorithm for parallel execution
of logic programs.
Vipin Kumar, University of Texas at Austin.

Delta Prolog: a distributed backtracking extension with events.
Luis Moniz Pereira, Luis Monteiro, Jose Cunha & Joaquim N.
Aparicio,  Universidade Nova de Lisboa.

1b.  Theory and complexity

OLD resolution with tabulation.
Hasao Tamaki, Ibaraki University.

Logic programs and alternation.
P. Stepanek & O. Stepankova, MFF Prague.

Intractable unifiability problems and backtracking.
D.A. Wolfram, Syracuse University.

On the complexity of unification sequences.
Heikki Mannila & Esko Ukkonen, University of Helsinki.

2a.  Implementations and architectures

How to invent a Prolog machine.
Peter Kursawe, GMD & University of Karlsruhe.

A sequential implementation of Parlog.
Ian Foster, Steve Gregory, Graem Ringwood, Imperial College &
Ken Satoh,
Fujitsu Limited.

A GHC abstract machine and instruction set.
Jacob Levy, Weizmann Institute.

A Prolog processor based on a pattern matching memory device.
Ian Robinson, Schlumberger Palo Alto Research.

2b. Inductive inference and debugging

An improved version of Shapiro's model inference system.
Matthew Huntbach, University of Sussex.

A framework for ICAI systems based on inductive inference and
logic programming.
Kazuhisa Kawai, Riichiro Mizoguchi, Osamu Kakusho & Jun'ichi
Toyoda, Osaka University.

Rational debugging in logic programming.
Luis Moniz Pereira, Universidade Nova de Lisboa.

Using definite clauses and integrity constraints as the basis
for a theory formation approach to diagnostic reasoning.
Randy Goebel, University of Waterloo, Koichi Furukawa, ICOT &
David Poole, University of Waterloo.

INVITED TALK:  Theory of logic programming.  Jean-Luis Lassez,
IBM


Wednesday, July 16

INVITED TALK:  Concurrent logic programming languages.
Akikazu Takeuchi ICOT.

3a.  Concurrent logic languages

P-Prolog: a parallel language based on exclusive relation.
Rong Yang & Hideo Aiso, Keio University.

Making exhaustive search programs deterministic.
Kazunori Ueda, ICOT.

Compiling OR-parallelism into AND-parallelism.
Michael Codish & Ehud Shapiro, Weizmann Institute.

A framework for the implementation of Or-parallel languages.
Jacob Levy, Weizmann Institute.

3b.  Theory and semantics

Logic program semantics for programming with equations.
Joxan Jaffar & Peter J. Stuckey, Monash University.

On the semantics of logic programmming languages.
Alberto Martelli & Gianfranco Rossi, Universita di Torino.

Towards a formal semantics for concurrent logic programming
languages.
Lennart Beckmann, Uppsala University.


Thursday, July 17

INVITED TALK:  Logic programming and natural language
processing.  Michael McCord, IBM.

4a.  Parallel applications and implementations

Parallel logic programming for numeric applications.
Ralph Butler, Ewing Lusk, William McCune & Ross Overbeek,
Argonne National Laboratory.

Deterministic logic grammars.
Harvey Abramson, University of British Columbia.

A parallel parsing system for natural language analysis.
Yuji Matsumoto, ICOT.

4b.  Theory and higher-order functions

Equivalence of logic programs.
Michael J. Maher, University of Melbourne.

Qualified answers and their application to transformation.
Phil Vasey, Imperial College.

Procedures in Horn-clause programming.
M.A. Nait Abdallah, University of W. Ontario.

Higher-order logic programming.
Dale A. Miller & Gopalan Nadathur, University of
Pennsylvania.

5a.  Program analysis

Abstract interpretation of Prolog programs.
C.S. Mellish, University of Sussex.

Verification of Prolog programs using an extension of
execution.
Tadashi Kanamori, Mitsubishi Electric Corporation &
Hirohisa Seki, ICOT.

Detection and optimization of functional computations in
Prolog.
Saumya K. Debray & David S. Warren, SUNY at Stony Brook.

Control of logic program execution based on the functional
relations.
Katsuhiko Nakamura, Tokyo Denki University.

5b.  Applications and teaching

Declarative graphics.
A. Richard Helm & Kim Marriott, University of Melbourne.

Test-pattern generation for VLSI circuits in a Prolog
environment.
Rajiv Gupta, SUNY at Stony Brook.

Using Prolog to represent and reason about protein structure.
C.J. Rawlings, W.R. Taylor, J. Nyakairu, J. Fox & M.J.E.
Sternberg,  Imperial Cancer Research Fund & Birkbeck College.

A New approach for introducing Prolog to naive users.
Oded Maler, Zahava Scherz & Ehud Shapiro, Weizmann Institute.

INVITED TALK:  Prolog programming environments.  Takashi
Chikayama, ICOT.


Friday, July 18

INVITED TALK:  Logic programming and databases.  Jeffery D.
Ullman, Stanford University.

6a.  Implementations and databases

A superimposed codeword indexing scheme for very large
Prolog databases.   Kotagiri Ramamohanarao & John Shepherd,
University of Melbourne.

Interfacing Prolog to a persistent data store.
D.S. Moffat & P.M.D. Gray, University of Aberdeen

General model for implementing DIF and FREEZE.
P. Boizumault, CNRS.

Cyclic tree traversal.
Martin Nilsson & Hidehiko Tanaka, University of Tokyo.

6b.  Theory and negation

Completeness of the SLDNF-resolution for a class of logic
programs.
R. Barbuti, Universita di Pisa.

Choices in, and limitations of, logic programming.
Paul J. Voda, University of British Columbia.

Negation and quantifiers in NU-Prolog.
Lee Naish, University of Melbourne.

Gracefully adding negation and disjunction to Prolog.
David L. Poole & Randy Goebel, University of Waterloo.

7a.  Compilation

Memory performance of Lisp and Prolog programs.
Evan Tick, Stanford University.

The design and implementation of a high-speed incremental
portable Prolog compiler.
Kenneth A. Bowen, Kevin A. Buettner, Ilyas Cicekli & Andrew
Turk, Syracuse University.

Compiler optimizations for the WAM.
Andrew K. Turk, Syracuse University.

Fast decompiling of compiled Prolog clauses.
Kevin A. Buettner, Syracuse University.

7b.  Models of computation and implementation

Logic continuations.
Christopher T. Haynes, Indiana University.

Cut & Paste - defining the impure primitives of Prolog.
Chris Moss, Imperial College.

Tokio: logic programming language based on temporal logic
and its compilation to Prolog.
M. Fujita, Fujitsu Labs. Ltd., S. Kono, H. Tanaka & Moto-oka,
University of Tokyo.

The OR-woods description of the execution of logic programs.
Sun Chengzheng & Tzu Yungui, Changsha Institute.

PANEL DISCUSSION:  Programming vs. uncovering parallelism.
Chair: Keith Clark, Imperial College.


---------------------------------------------------------------


            THIRD INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING
                             July 14-18, 1986

                           GENERAL INFORMATION


TIME AND VENUE

Monday 14th to Friday 18th July.  Imperial College of Science
and Technology, South Kensington.  Sherfield Building - Great
Hall, Pippard and Read Lecture Theatres.

Registration:  Tutorials from 8.00 a.m. on Monday and Full
Conference from 2.00 p.m. to 8.00 p.m. on Monday and from 8.15
p.m. on Tuesday, in the main reception area adjacent to the
Great Hall.

General information on facilities and entertainment in London
will be available from the main reception desk.

CONFERENCE SESSIONS

The main conference runs from 9.30 a.m. on Tuesday, 15th July
until 5.00 p.m. on Friday, 18th July.   Technical sessions are
divided into two parallel streams and each paper lasts for
approximately 20 minutes.  (Each day has plenary sessions
addressed by invited speakers).  Morning breaks are from 10.30-
10.50, lunch breaks from 12.30-2.00, and afternoon breaks from
3.40-4.00.

TUTORIALS

The Tutorial Programme takes place on Monday, 18th July, from
9.30 a.m.  Each tutorial session is priced separately.

COMMERCIAL EXHIBITION

There will be a commercial exhibition located in the Junior
Common Room on the same level as the main conference facilities
in the Sherfield Building from 1.00 p.m. on Monday until Thursday
lunchtime.  Companies taking part in the exhibition include sw
developers, hardware manufacturers and publishers.  A reception
will be held in the exhibition area at the end of the tutorial
sessions on Monday.  Refreshments will also be available in
the exhibition area during session breaks.  Anyone interested in
taking space at the exhibition should contact the Conference
Organizers at Imperial College Tel. 01-589 5111 ext. 5011.

SOCIAL PROGRAMME

Monday, 14th July             Reception in Exhibition Area.
Time 5.15 p.m. - 8.00 p.m.    Cost included in registration fee.

Tuesday, 15th July            A limited number of theatre and
                              concert tickets will be available
                              from the reception desk.

Wednesday, 16th July          Jazz Boat Trip on the River Thames
Time 7.00 p.m. - 11.00 p.m.   including live music, & buffet
                              supper. Cost #15 per person.
                              Numbers limited.

Thursday, 17th July           Banquet at Imperial College.
Time 7.30 p.m.                Cost included in full registration.


REFRESHMENTS/LUNCHES

Refreshments are provided during session breaks and will be
served in the reception area and exhibition area.

A seated buffet lunch will be available at #5.00 per person
per day if  ordered in advance (see registration form).
Lunches are served in the Sherfield dining hall.  Alterna-
tively, reasonably priced food can be obtained from local
restaurants and pubs within walking distance of the college.

ACCOMMODATION

Hotel Accommodation should be booked, quoting the conference
name, directly with:

     Expotel, Banda House,  Cambridge Grove, London W6 OLE
     Tel.  (01) 741 4411

Halls of Residence.  Rooms should be booked in advance on
the registration form.  They will be allocated to those who
register first.  Full payment must be made at the time of
ordering.  There will be no cancellation  refunds, but
rooms may be transferred to another name.

25 single bedded rooms are available at Imperial College
from Saturday 12th - Thursday, 17th July inclusive (six
nights) at a total cost of #100 including English breakfast.
A further 25 are available from Sunday to Thursday (5 n
ights) at a total cost of #85 including English breakfast.


-----------------------------------------------------------


        THIRD INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING
                         July 14-18, 1986

                        REGISTRATION FORM


Please complete one form per applicant.  Please keep a
photocopy of your registration form for your reference.
Please print or type.

Surname.........................Firstname...................
Organisation ...............................................
Address.....................................................
Tel. No. ......................... Telex ...................

Conference Registration                                  tic

received before 1st June                       #155     ----
received after 1st June                        #178     ----
Members of BCS, ACM, IEEE, Japanese
  Computer Soc. rec. before 1st June           #125     ----
Full time student - evidence required           #60     ----
                                            subtotal _______

Tutorial Programme        (tick)   normal delegate    student

Warren (a.m.) or                     ___   #65        ___
McCord (a.m.)                        ___   #65        ___
Clark and Gregory (p.m.) or          ___   #65        ___
Furukawa (p.m.)                      ___   #65        ___
(for two half day tutorials               #110
 or
Kowalski/Kriwaczek full day          ___  #100        ___


Lunches #5 per day (tick days & specify vegetarian meals)

Mon___  Tue___  Wed___  Thur___  Fri___  Vegetarian___

Social Programme                               tick

Banquet (price included in non student fee)     ___
#20 per student or each additional person       ___
Jazz boat trip #15 per person                   ___
limited numbers for both events


Accommodation (single)

Imperial College Sat.-Thurs. (six nights inc.) #100
Imperial College Sun.-Thurs. (five nights inc.) #85
London University Sun.-Fri. (six nights inc.)  #100

Hotel accommodation can be booked through Expotel,
London (01) 741 4411.
                                    TOTAL   _______

Cheques and bankers drafts in Pounds Sterling only should
be made payable   to Logic Programming Conference Imperial
College.  Please return this form together with your remittance
covering all items requested to:  Andrew Abelson, 3rd
International Conference on Logic Programming, Department of
Computing, Imperial College, London SW7 2BZ, England.

------------------------------

End of PROLOG Digest
********************