steve@hubcap.clemson.edu ("Steve" Stevenson) (06/21/89)
The request for bibliographic information that I made last spring has
resulted in a 6050 line refer bibliography with 796 titles.
I'd like to acknowledge some very major contributors (in alphabetical
order)
Jean-Louis Lasssez
Ehud Shapiro
Allan Van Gelder
I have saved the names of all the contributors so that the community
can see who's about. These are stored under %Z tags. Most such tags
are in the front of the file. Using %Z follows the refer convention of
ignoring said tag.
Please nominate your TOP TEN must read of these papers.
Thanks
Steve
===================================================================
%Z harald@mulga.oz (Harald Sondergaard)
%Z From: Bjorn Ellertsson <bje@math.ucla.edu>
%Z Barry Kort bwk@mbunix
%Z Pekka Kilpelainen kilpelainen@cs.helsinki.FI
%Z <PARKERJ%BCVMS.BITNET@MITVMA.MIT.EDU> (Jeff Parker)
%Z Jamie Andrews <jha%lfcs.edinburgh.ac.uk@NSS.Cs.Ucl.AC.UK>
%Z Mark Nagel <nagel@PARIS.ICS.UCI.EDU>
%Z Tim Duncan <timd%aiai.edinburgh.ac.uk@NSS.Cs.Ucl.AC.UK>
%Z Allan Van Gelder part nca.bib
%Z From: gumb@hawk.ulowell.edu (Ray Gumb)
%Z From: Allen Van Gelder <avg@spica.ucsc.edu> - part nega.bib
%Z Allen Van Gelder <avg@spica.ucsc.edu> ncb.bib
%Z Allen Van Gelder <avg@spica.ucsc.edu>ncc.bib
%Z Allen Van Gelder <avg@spica.ucsc.edu> mpa.bib
%Z Allen Van Gelder <avg@spica.ucsc.edu> negb.bib
%Z {wkshop = "Workshop on Foundations of Deductive Databases and Logic Programming"}
%Z {mbook = "Foundations of Deductive Databases and Logic Programming"}
%From: Allen Van Gelder <avg@spica.ucsc.edu> negbbk.bib
%Z@STRING{wkshop = "Workshop on Foundations of Deductive Databases and Logic Programming"}
%Z@STRING{minkbk = "Foundations of Deductive Databases and Logic Programming"}
%Z From: ken@aiai.ed.ac.uk (Ken Johnson)
%Z From: Allen Van Gelder <avg@spica.ucsc.edu> wellf.bib
@STRING{wkshop = "Workshop on Foundations of Deductive Databases and Logic Programming"}
%Z From: mcvax!crin.crin.fr!napoli@uunet.UU.NET
%Z Jorge Lobo <gatech!unmvax!brillig.umd.edu!jorge@hubcap.clemson.edu>
%Z Vaughan Pratt <coraki!pratt@Sun.COM>
%Z From: mcvax!crin.crin.fr!napoli@uunet.UU.NET
%Z From: unido!bbchd!borchers@uunet.UU.NET (Hans W.Borchers)
%Z Sam Rebelsky <samr%tartarus@gargoyle.uchicago.edu>
%Z mcvax!majestix.ida.liu.se!U-NILSSON%LISBET.IDA.LiU.SE@uunet.UU.NET
%Z Ulf Nillson
%Z send
%Z Journal of Logic Programming
%Z The Royal Institute of Technology
%Z Dept. of Telecommunication Systems - Computer Systems
%Z S-100 44 Stockholm, Sweden
%Z David Harel (harel@wisdom.bitnet)
%Z Ashok K. Chandra ASHOK%YKTVMV.BITNET@CUNYVM.CUNY.EDU
%Z Ehud Shapiro Weizmann Institute
%Z Michael Maher <MJM@ibm.com>
%Z Suzanne Sluizer <slzr%gte.com@RELAY.CS.NET>
%Z munnari!goanna.oz.au!isaac@uunet.UU.NET (Isaac Balbin)
%Z Marianne Baudinet <mb@procope.stanford.edu>
%Z Newsgroups: comp.ai,comp.lang.misc,comp.theory
%Z kar@polya.Stanford.EDU
%Z Anthony L Kimball : alk @ ux.acss.umn.edu
%Z Gopal Gupta <gupta@cs.unc.edu>
%Z Allen Renear <ALLEN%BROWNVM.BITNET@MITVMA.MIT.EDU>
%Z Dave Clark clark@crdecf.csc.ti.com
%Z H. L U D W I G H A U S E N hausen@kmx.gmd.dbp.de :
%Z Paul Broome <broome@BRL.MIL>
%Z josh@aramis.rutgers.edu
%Z Chuck Noren ncar!dinl!noren
%Z Suzanne Sluizer slzr%gte.com@RELAY.CS.NET
%Z Jean-Louis Lassez <JLL@ibm.com>
%Z Allen Van Gelder <avg@saturn.ucsc.edu>
%Z Marco Valtorta <mgv%cs.scarolina.edu@RELAY.CS.NET>
%Z mcvax!cs.Helsinki.FI!kilpelai@uunet.UU.NET (Pekka Kilpelainen)
%Z Ralf Treinen <yxoc%fb10vax.informatik.uni-saarland.dbp.de@RELAY.CS.NET>
%T Abstract Interpretation of Declarative Languages
%E S. Abramsky
%E C. Hankin
%I Ellis Horwood
%D 1987
%E D. Harel
%T Algorithmics: The Spirit of Computing
%I Addison-Wesley
%D 1987
%E E. Shapiro
%T Concurrent Prolog: Collected Papers
%V 1 and 2
%I MIT Press
%D 1987
%T Foundations of Deductive Databases and Logic Programming
%E J. Minker
%I Morgan Kaufmann
%C Los Altos, CA
%D 1988
%E Jack Minker
%T Foundations of Deductive Databases and Logic Programming
%I Morgan Kaufmann
%C Los Altos, CA
%D 1988
%T From standard logic to logic programming : introducing a logic based
approach to artificial intelligence
%E Andre Thayse
%C New York
%I John Wiley
%D 1988
%E J.A. Campbell
%T Implementations of Prolog
%I Ellis Horwood
%S Series in Artificial Intelligence
%D 1984
%T International Conference on Logic Programming
%E E. Shapiro
%I Springer-Verlag
%X
3rd : 1986 : Imperial College of Science and Technology
1st : 1984 : Atlantic City, N.J.
%E K.L. Clark
%E S.A. Tarnlund
%D 1982
%T Logic Programming
%S APIC Studies in Data processing
%N 16
%I Academic Press
%E J-L. Lassez
%T Logic Programming
%B Proceedings of the Fourth International Conference on Logic Programming
%I MIT Press
%D 1987.
%E D. DeGroot
%E G. Lindstrom
%T Logic Programming, Functions, Relations and Equations
%I Prentice-Hall
%D 1986
%T Logic programming : proceedings of the [nth] international conference and
symposium
%C Cambridge,MA
%I MIT Press
n = 5 - 1988%E Robert A. Kowalski%E Kenneth A. Bowen
n = 4 - 1987%E Jean-Louis Lassez
%T Logic Programming Conference
%I Springer-Verlag
%E Eiiti Wada
%E K. Furukawa
%E H. Tanaka
%E T. Fujisaki
%S LNCS
%X
title(published date)[LNCS number]
Proceedings of the 4th conference Tokyo, Japan, July 1-3, 1985 (1986)[221]
Proceedings of the 5th Conference, Tokyo, Japan, June 23-26, 1986(1987)[264]
Proceedings of the 6th conference, Tokyo, Japan, June 22-24, 1987(1988)[315]
%E V. Dahl
%E P. Saint-Dizier
%D 1985
%T Natural Language understanding and Logic Programming: Proceedings of the first International workshop, Rennes, France, Sept'84
%I Elsevier, North Holland
%T Symposium on Logic Programming
%I IEEE
%X
2nd : 1985 : July 15-18, 1985, Sheraton Boston
3rd : 1986 : September 22-25, 1986, Westin Hotel Utah, Salt Lake City, Utah.
4th : 1987 : August 31-September 4, 1987, Hyatt on Union square, San Francisco, California
%A Martin Abadi
%A Zohar Manna
%T Temporal Logic Programming
%P 4-16
%B International Symposium on Logic Programming
%I IEEE
%C San Francisco, CA
%D Sep, 1987
%X
An extended version will appear in the Journal of Symbolic Computation
%A S. Abiteboul
%A V. Vianu
%T Procedural and declarative database update languages
%B ACM Symposium on Principles of Database Systems
%Y 1988
%P 240--250
%A W. B. Ackerman
%T Data flow languages
%J IEEE Computer
%V 15
%N 2
%D 1982
%P 15-25
%A P. Aczel
%E J. Barwise
%T An introduction to inductive definitions
%B Handbook of Mathematical Logic
%I North-Holland
%C New York
%P 739--782
%Y 1977
%A F. Afrati
%A C. H. Papadimitriou
%T The parallel complexity of simple chain queries
%B 6th ACM Symposium on Principles of Database Systems
%D 1987
%P 210--213
%A K. A. M. Ali
%A L. Fahlen
%A R. Karlsson
%I ICS
%T BC-Machine: A Multiprocessor for Fast OR-Parallel Execution of Logic Programs
%D 1986
%A K. A. M. Ali
%T A Method for Implementing Cut in Parallel Execution of Prolog
%T ECRC Workshop on Parallel Logic Programming Systems
%D 1987
%A K. A. M. Ali
%T A Method for Implementing Cut in Parallel Execution of Prolog
%T Proceedings - 1987 Symposium on Logic Programming
%I The IEEE Computer Society Press
%P 449-456
%Z Month September
%D 1987
%A K. A. M. Ali
%T Or-parallel execution of Horn clause programs based on the WAM and shared control information
%R SICS Technical Report
%D 1986
%A K. A. M. Ali
%T Or-parallel execution of Prolog on a multi-sequential machine
%R SICS Technical Report
%D 1986.
%A K. A. M. Ali
%T OR-Parallel Execution of Prolog on a Multi-Sequential Machine
%D 1987
%J IJPP
%A Khayri A.M. Ali
%T A Method for Implementing Cut in Parallel Execution of Prolog
%I ICS
%Z Month February
%D 1987
%A L. Alkalaj
%A E. Shapiro
%T An architectural model for a Flat Concurrent Prolog processor
%E K. Bowen
%E R. A. Kowalski
%B Proc.\ 5\/$^{th}$ International Conference Symposium on Logic Programming
%P 1277--1297
%I MIT Press
%D 1988
%A K. Apt
%T Introduction to Logic Programming
%I Dept. of Computer Science, The University of Texas at Austin
%R TR-87-35
%D 1987
%X
[Revised and Extended Version in 1988] Report CS-R8741,
Centre for Math. and Comp.Sci., Amsterdam 1987
%A K. R. Apt
%A M. H. Van Emden
%T Contributions to the theory of logic programming
%J JACM
%V 29
%N 3
%D 1982
%P 841--862
%A K. R. Apt
%A H. Blair
%A A. Walker
%T Towards a Theory of Declarative Knowledge
%Z Oct.
%D 1985
%X
(available from A.~Walker, IBM Watson Research Center, Yorktown Heights
NY 10598)
%A K. R. Apt
%A H. Blair
%A A. Walker
%T Towards a theory of declarative knowledge
%B mbook
%E J. Minker
%C Los Altos, CA
%I Morgan Kaufmann
%D 1988
%P 89--148
%A Mikhail J. Atallah
%A Susanne E. Hambrusch
%T Solving tree problems on a mesh-connected processor array
%B 26th FOCS
%D 1985
%P 222--231
%A G. Attardi
%A M. Simi
%T Metalanguage and Reasoning Across Viewpoints
%B Advances in Artificial Intelligence
%E T. O'Shea
%I North Holland
%C ny
%Y 1985
%A G. Bage
%A G. Lindstrom
%T Comitted choice functional programming
%B Proc.\ International Conference on Fifth Generation Computer Systems
%P 666--674
%I ICOT
%C Tokyo
%D 1988
%A J. W. de Bakker
%A J. N. Kok
%T Uniform abstraction, atomicity and contractions in the comparative semantics of Concurrent Prolog
%B Proc.\ International Conference on Fifth Generation Computer Systems
%P 347--355
%I ICOT
%C Tokyo
%D 1988
%A Ph. Balbiani
%A L. {Fari}as del Cerro}
%A A. Herzig
%T Declarative Semantics for Modal Logic Programs
%B International Conference on Fifth Generation Computer Systems 1988
%C Tokyo, Japan
%D Dec, 1988
%A Isaac Balbin
%A Koenraad Lecot
%T Logic Programming: a classified bibliography
%I ??
%D ??
%A Marianne Baudinet
%T Proving Termination Properties of Prolog Programs: A Semantic Approach
%B Proceedings of the Third Annual Symposium on Logic in Computer Science
%I Edinburgh, Scotland
%Z July
%D 1988
%P 336-347
%A Marianne Baudinet
%T Proving Termination Properties of prolog Programs: A Semantic
Approach
%B Logic In Computer Science, Edinburgh, 1988
%P 336-347
%I IEEE
%D Jul, 1988
%X
Also Technical Report STAN-CS-88-1202, Computer Science Department
Stanford University, April 1988
%A Marianne Baudinet
%T Temporal Logic Programming is Complete and Expressive
%B Proc Principle of Prog Lang89, Austin, Texas
%D Jan, 1989
%X
note (Also Technical Report STAN-CS-88-1232, Computer
Science Department, Stanford University, October
1988
%A J. Beer
%A W.K. Giloi
%T POPE - a Parallel-Operating Prolog Engine
%D 86
%J New Generation Computing
%D Unknown
%A C. Beeri
%A R. Fagin
%A D. Maier
%A A. Mendelzon
%A J. D. Ullman
%A M. Yannakakis
%T Properties of acyclic database schemas
%B 13th STOC
%D 1981
%P 355--362
%A Marco Bellia
%A Giorgio Levi
%T The Relation between Logic and Functional Languages: A Survey
%P 217--236
%J jlp
%V 3
%N 3
%D Oct, 1986
%A W. Bibel
%A K. Kurfess
%A J. Schumann
%A K. Aspetsberger
%A P. Hintenaus
%T Parallel inference machines
%I Muenchen
%N ATP-68-II-87
%Z Month February
%D 1987
%A W. Bibel
%A B. Buchberger
%T Toward a Connection Machine for Logical Inference
%J Future Generations Computer Systems
%V 1
%N 3
%P 177 - 188
%Z Month February
%D 1985
%A Lubomir Bic
%T A data driven model for parallel interpretation of logic programs
%C Irvine
%D 1984
%Z Month January
%I University of California
%K languages
%A G. Birkhoff
%T Lattice Theory
%I American Mathematical Society Colloquium Publications
%D 1967
%A Prasenjit Biswas
%A Shyh-Chang Su
%T An Abstract Machine Model to Support Limited-OR(LOR)/Restricted-AND Parallelism(RAP) in Logic Programs
%I Southern Methodist University, Dallas, Texas
%N 87-CSE-5
%Z Month July
%D 1987
%A C. Bloch
%D 1984
%T Source-to-source transformations of Logic programs
%I Department of Applied Mathematics, Weizmann Institute, Israel
%R TR-84-22
%A H. Boley
%A RELFUN: A Relational/Functional Integration with Valued Clauses
%T SIGPLAN Notices
%V 21
%N 12
%D Dec. 1986
%P pp. 87-98
%A G. Boolos
%A R. Jeffrey
%T Computability and Logic
%I Cambridge University Press
%D 1980
%A P. Borgwardt
%A D. Rea
%T Distributed Semi-Intelligent backtracking for a Stack-based AND-parallel Prolog
%B Proc. 1986 Symposium on Logic Programming
%C Salt Lake City, Utah
%P 211-222
%Z Month September
%D 1986
%A Peter Borgwardt
%T Parallel prolog using stack segments on shared memory multiprocessors
%P 2-11
%D 1984
%Z Month February
%I IEEE
%T 84 Int. Symposium on Logic Programming
%K annotations, architecture, modes,stream
%A D. L. Bowen
%A L. Byrd
%A L. M. Pereira
%A F. C. N. Pereira
%A D. H. D. Warren
%T PROLOG on the DECSystem-10 User's Manual
%R Technical Report
%I Department of Artificial Intelligence, University of Edinburgh
%D 1981
%A A.W. Bowles
%A P.F. Wilk
%D 1988
%T Some design principles for Prolog support environments
%R AIAI-TR-35
%A J. Boyle
%A R. Butler
%A B. Glickfeld
%A T. Disz
%A E. Lusk
%A R. Overbeek
%A J. Patterson
%A R. Stevens
%T Portable Programs for Parallel Processors
%D 1987
%A P. Brna
%A A. Bundy
%A H. Pain
%A L. Lynch
%D 1987
%T Programming Tools for Prolog Environments
%R Edinburgh DAI-RP-302 (AISB-87)
%A Krysia Broda
%A Steve Gregory
%T Parlog for discrete event simulation
%C London
%D 1983
%Z Month December
%I Department of Computing, Imperial College
%K simulation
%A D. R. Brough
%A A. Walker
%T Some practical properties of logic programming interpreters
%B International Conference on Fifth Generation Computer Systems
%I Institute for New Generation Computing
%C Tokyo, Japan
%D 1984
%P 149-156
%A C.A. Brown
%D 1984
%T A self-modifying theorem prover
%S AAAI'84
%P 38-41
%A M. Bruynooghe
%A et al.
%T Abstract Interpretation: Towards the Global Optimization of Prolog Programs
%B Proc. of 4th International Symposium on Logic Programming, San Francisco
%D 1987
%A M. Bruynooghe
%A D. De Schreye
%T Abstract Interpretation in Logic Programming
%X
Tutorial notes
%B 5th International Conf/Symp. on Logic Programming, Seattle
%D 1988
%I MIT Press
%A M. Bruynooghe
%A G. Janssens
%T An Instance of Abstract Interpretation: Integrating Type and Mode
Inferencing
%B 5th International Conf/Symp. on Logic Programming, Seattle
%D 1988
%I MIT Press
%A M. Bruynooghe
%T The memory management of Prolog implementations
%J the book Logic Programming by Clark and Tarnlund
%D 1982
%O l.r. 12/5
%A M. Bruynooghe
%T A Practical Framework for the Abstract Interpretation of Logic Programs
%D 1987
%X
Unpublished manuscript
%A A. Bundey
%T Proving properties of logic programs : a progress report
%I University of Edinburgh, Dept. of Artificial Intelligence
%D 1988
%R D.A.I. research paper ; no. 361.
%A A. Bundy
%A H. Pain
%A P. Brna
%A L. Lynch
%D 1986
%T A proposed Prolog story
%R RP-283
%I Department of AI, University of Edinburgh
%A A. Bundy
%A L. Byrd
%A G. Luger
%A C. Mellish
%A M. Palmer
%D 1979
%T Solving mechanics problems using meta-level inference
%S IJCAI'79
%A H.J. Burckert
%D 1985
%T Extending the Warren abstract machine to many-sorted Prolog
%R SEKI-85-VII-KL
%I Universitat Kaiserlautern, West Germany
%A R. Butler
%A E. Lusk
%A W. McCune
%A R. Overbeek
%T Parallel logic programming for numeric applications
%B Third International Conference on Logic Programming
%E Ehud Shapiro
%C London
%P 375-388
%Z Month July
%D 1986
%X
in the proceedings volume
%A M. Carlsson
%T indexing, and other implementation issues in the WAM
%E J.-L. Lassez
%B Proc. 4th International Conference on Logic Programming
%P 40--58
%I MIT Press
%D 1987
%D 1987
%A M. Carlsson
%A E. L. Lusk
%A R. Overbeek
%A D.H.D. Warren
%T Maintaining Multiple Binding Environments to Support OR-Parallelism
%A R. Carnap
%T Introduction to Symbolic Logic and its Applications
%I Dover Publications, Inc.
%C ny
%Y 1958
%A Michel Castan
%T A distributed interpreting model for parallel execution of prolog programs
%C Toulouse CEDEX
%D 1984
%Z Month January
%I Laboratoire 'Langages et Systemes Informatiques'
%K Prolog,unification
%A Luis {Fari{~n}as del Cerro
%T Molog: A System that Extends Prolog with Modal Logic
%P 35-50
%J New Generation Computing
%V 4
%D 1986
%A D. Chan
%A M. Wallace
%D 1989
%T An experiment with programming using pure negation
%S AISB-89
%A A. Chandra
%A D. Harel
%T Horn Clause Queries and Generalizations
%J Journal of Logic Programming
%V 2
%N 1
%Y 1985
%P 1-15
%A Ashok Chandra
%A David Harel
%T Structure and complexity of relational queries
%J JCSS
%V 25
%N 1
%D 1982
%P 99--128
%A K. M. Chandy
%A J. Misra
%T A paradigm for detecting quiescent properties in distributed computations
%E K. R. Apt
%J Logics and Models of Concurrent Systems
%P 325--342
%I Springer-Verlag
%D 1985
%A K. M. Chandy
%A J. Misra
%T Parallel Program Design
%I Addison-Wesley
%D 1988
%A M. Chandy
%A L. Lamport
%T Distributed snapshots: determining global states of distributed systems
%J Transactions on Computer Systems
%V 3
%N 1
%P 63--75
%D 1985
%A C.L. Chang
%A R.C.T. Lee
%T Symbolic Logic and Mechanical Theorem Proving
%I Academic Press
%C ny
%Y 1973
%A C. L. Chang
%A R. C. T. Lee
%T Symbolic Logic and Mechanical Theorem Proving
%I Academic Press
%C New York
%D 1973
%A J.H. Chang
%A A.M. Despain
%T Semi intelligent backtracking of Prolog based on static data dependency analysis
%T 1985 Symposium on Logic Programming
%I IEEE
%P 10-21
%Z Month July
%D 1985
%K aquarius, PLM1, plm, berkeley
%A T.Y. Chen
%A J-L. Lassez
%A G.S. Port
%T Maximal Unifiable Subsets and Minimal Non Unifiable Subsets
%J New Generation Computing
%V 4
%N 2
%%P 131-152
%D 1986
%A Sun Chenzheng
%A Tzu Yungui
%T The sharing of environments in AND/OR parallel execution of logic programs
%D 1987
%A C. Cherniak
%T Prototypicality and Deductive Reasoning
%J Journal of VerbalLearning and Behaviour
%Y 1984
%V 23
%P 625-642
%A T. Chikayama
%A Y. Kimura
%T Multiple reference management in Flat GHC
%E J.-L. Lassez
%B Proc.\ 4\/$^{th}$ International Conference on Logic Programming
%P 276--293
%I MIT Press
%D 1987
%A T. Chikayama
%A H. Sato
%A T. Miyazaki
%T Overview of the parallel inference machine operating system (PIMOS)
%B Proc.\ International Conference on Fifth Generation Computer Systems
%P 230--251
%I ICOT
%C Tokyo
%D 1988
%A T. Chikayama
%T Parallel Inference System Research in the FGCS Project
%T Proceedings - 1987 Symposium on Logic Programming
%I The IEEE Computer Society Press
%P 274-276
%Z Month September
%D 1987
%A P. Cholak
%T Post Correspondence Problem and Prolog Programs
%I Univ. of Wisc.
%C Madison
%Z (manuscript)
%Y 1988
%A E. Chouraqui
%T Le raisonnement analogique~: sa problematique
ses applications
%B Journees Nationales sur l'Intelligence Artificielle
%I Cepadues, Toulouse
%C Aix-les-Bains
%Y 1986
%P 107-117
%A Y. Chu
%A K. Itano
%T Organization of a parallel prolog machine
%P 13
%C LA
%D 1984
%Z Month May
%T Intl workshop on HLCA 84
%K architecture,parallelism
%A Wen-Kai Chung
%A William B. Day
%T A Study of Control Constructs in Parallel Logic Languages
%I Auburn University, Alabama
%Z Month March
%D 1987
%A A. Ciepielewski
%A S. Haridi
%T Control of activities in the or-parallel token machine
%P 49-57
%D 1984
%Z Month February
%T 84 IEEE logic programming conf
%K or parallel, pruning
%A A. Ciepielewski
%A B. Hausman
%A S. Haridi
%T Or-parallel Prolog Made Efficient on Shared Memory Multiprocessors
Organization=SICS
%T Symposium on Logic Programming
%C San Francisco
%I IEEE
%Z Month August
%D 1987
%A A. Ciepielewski
%T Parallel SICStus Prolog - Preliminary Definition
%I ICS, Sweden
%Z Month November
%D 1986
%A A. Ciepielewski
%A B. Hausmann
%T Performance Evaluation of a Storage Model for OR-parallel Execution of Logic Programs
%T Proc. 1986 Symposium on Logic Programming
%C Salt Lake City, Utah
%P 246-257
%Z Month September
%D 1986
%A Andrzej Ciepielewski
%A S. Haridi
%T A formal model for or-parallel execution of logic programs
%J IFIP 83
%P 299-305
%D 1983
%Z Month October
%I North Holland
%K parallel_or,inference,logic
%A Andrzej Ciepielewski
%T Towards a Computer Architecture for Or-Parallel Execution of Logic Programs
%I Royal Institute of Technology, Stockholm
%Z Month May
%D 1984
%K or-parallelism, and-parallelism, storage structures, multiprocessor, control flow, distributed abortion mechanism
in Klaus Estenfeld's library
%A Wayne Citrin
%T Extracting Parallelism from Sequential Prolog: Experiences with the Berkeley PLM
Organization=University of California, Berkeley
%T BBC Workshop on Knowledge Based Systems in Industry
%Z Month June
%D 1986
%A K. Clark
%T Negation as Failure
%B Logic and Databases
%E H. Gallaire
%E J. Minker
%I Plenum Press
%P New York
%D 1978
%A K. Clark
%A S. Gregory
%T Notes on systems programming in PARLOG
%B Proc.\ International Conference on Fifth Generation Computer Systems
%P 299--306
%I ICOT
%C Tokyo
%D 1984
%A K. Clark
%A S. Gregory
%T Notes on the implementation of PARLOG
%R Research Report DOC84/16, 1984
%O Also in J.\ Logic Programming
%V 2
%N 1
%P 17--42
%D 1985
%A K. Clark
%A S. Gregory
%T PARLOG: Parallel Programming in Logic
%B Concurrent Prolog, Collected Papers (Volume 1)
%E E. Shapiro
%I MIT Press
%C cm
%Y 1987
%A K. Clark
%A S. Gregory
%T Parlog: parallel programming in logic
%D 1984
%Z Month April
%I Imperial College London
%N DOC 84/4
%K parallelism, or, and, stream, synchro
%A K. Clark
%A S. Gregory
%T PARLOG: Parallel Programming in Logic
%J acm Transactions on Programming Languages and Systems
%V 8
%N 1
%P 1-49
%Z Month January
%D 1986
%A K. Clark
%A S. Gregory
%T PARLOG and PROLOG united
%E J.-L. Lassez
%B Proc.\ 4\/$^{th}$ International Conference on Logic Programming
%P 927--961
%I MIT Press
%D 1987
%A K. Clark
%T Predicate Logic as a Computational Formalism
%R DOC 79/59
%I Dept. of Computing, Imperial College
%D 1979
%A K. Clark
%A S. Gregory
%T A relational language for parallel programming
%B Proc.\ ACM Conference on Functional Languages and Computer Architecture
%P 171--178
%D 1981
%A K. L. Clark
%A S.-A T\"{a}rnlund
%T A first-order theory of data and programs
%E B. Gilchrist
%B Information Processing 77
%P 939--944
%I North-Holland
%D 1977
%A K. L. Clark
%A F. G. McCabe
%A S. Gregory
%T IC-PROLOG --- language features
%E K. L. Clark
%E S.-A. T\"arnlund
%B Logic Programming
%P 253--266
%I Academic Press
%C London
%D 1982
%A K.L. Clark
%T Logic Programming Schemes
%B fgcs88v1
%C t
%Y 1988
%P 120-139
%A K. L. Clark
%T Negation as failure
%B Logic and Databases
%E H. Gallaire
%E J. Minker
%I Plenum Press
%C New York
%D 1978
%P 293--322
%A Keith L. Clark
%A Steve Gregory
%T Parlog: A parallel logic programming language
%C London
%D 1983
%Z Month May
%I Department of Computing, Imperial College
%K parlog,languages
%A John G. Cleary
%T Implementation of concurrent prolog using message passing
%D 1984
%Z Month August
%I Department of Computer Science, University of Calgary
%K languages
%A W. R. Clocksin
%A H. Alshawi
%T A method for efficiently executing Horn clause programs using multiple processors
%R Technical Report
%I Department of Computer Science Cambridge University
%C Cambridge
%D 1986
%A M. Codish
%A E. Shapiro
%T Compiling Or-parallelism into And-parallelism
%B New Generation Computing
%V 5
%N 1
%P 45--61
%D 1987
%A M. Codish
%A E. Shapiro
%T Compiling OR-parallelism into AND-parallelism
%T Third International Conference on Logic Programming
%E Ehud Shapiro
%C London
%P 283-297
%Z Month July
%D 1986
%K in the proceedings volume
%A H. Coelho
%A J.C. Cotta
%A L.M. Pereira
%D 1985
%T How to solve it with Prolog (4th Edition)
%I Ministerio do Equipamento Social, Laboratorio Nacional de Engenharia Civil, Lisbon
%A Evan R. Cohn
%A Ramsey W. Haddad
%T Beta Operations: Efficient Implementation of a Primitive Parallel Operation
%D AUG 1986
%R STAN-CS-86-1129
%I Stanford University Computer Science
%X The Beta Operation can be performed in O(log N + log **2 M) time
on a hypercube where N is the size of the input and M is the size
of the output.
%A A. Colmerauer
%D 1977
%T An interesting natural language subset
%I Universite d'Aix-Marseille
%A A. Colmerauer
%A H. Kanoui
%A M. Van Caneghem
%T PROLOG, bases th\'eoriques et d\'eveloppements actuels
%J Techniques et Sciences de L'Informatique
%Y 1983
%V 2
%N 4
%A A. Colmerauer
%T PROLOG and infinite trees
%J Logic Programming by Clark and Tarnlund
%D 1982
%O l.r. 12/5
%A Alain Colmerauer
%T Prolog in 10 Figures
%P 1296-1310
%J CACM
%V 28
%N 12
%D Dec, 1985
%A Hubert Common
%A Pierre Lescanne
%T Equational Problems and Disunification
%I INRIA CRIN
%D 1988
%R 904
%C Nancy, France
%A J.S. Conery
%A D.F. Kibler
%T AND Parallelism and Nondeterminism in Logic Programs
%J New Generation Computing
%N 3
%P 43-70
%D 1985
%K nondeterminism, process model, and parallelism, or
parallelism, intelligent backtracking
%A J.S. Conery
%T Binding Environments for Parallel Logic Programs in Non-Shared Memory Multiprocessors
%T Proceedings - 1987 Symposium on Logic Programming
%I The IEEE Computer Society Press
%P 457-467
%Z Month September
%D 1987
%A J.S. Conery
%T Implementing backward execution in non-deterministic AND-parallel systems
%I The International Conference on Logic Programming
%T Proceedings, Melbourne, Australia
%P 633-653
%Z Month May
%D 1987
%A J. S. Conery
%A D.F. Kibler
%T Parallel interpretation of logic programs
%P 163-170
%D 1981
%Z Month October
%I ACM
%T Proc. conf. on functional programming languages and computer architecture
%K or, and, parallelism
%A T. Conlon
%T Programming in Parlog
%I Addison-Wesley
%D 1989
%A Stephen A. Cook
%T An observation on time-storage trade-off
%J JCSS
%V 9
%N 3
%D 1974
%P 308--316
%A Stephen A. Cook
%T A taxonomy of problems with fast parallel algorithms
%N 164/83
%I Dept. of Computer Science, University of Toronto
%Z Oct., YEAR = 1984
%A Stephen A. Cook
%T A taxonomy of problems with fast parallel algorithms
%J Information and Control
%V 64
%N 1
%D 1985
%P 2--22
%A M.J. Coombs
%A R.T. Hartley
%A J.G. Stell
%D 1986
%T Debugging User Conceptions of Interpretation Processes
%S AAAI'86
%A M.J. Coombs
%A J.G. Stell
%D 1985
%T A Model for debugging PROLOG by symbolic execution: The separation of specification and procedure
%R LOP-126-L
%A Stavros S. Cosmadakis
%A Paris C. Kanellakis
%T Parallel evaluation of recursive rule queries
%B 5th ACM Symposium on Principles of Database Systems
%D 1986
%P 280--293
%A G. Costa
%A C. Stirling
%T Weak and strong fairness in CCS
%B Information and Computation
%Z 73
%P 207--244
%D 1987
%A P. Cousot
%A R. Cousot
%T Abstract Interpretation: A Unified Lattice Model for Static Analysis
of Programs By Construction or Approximation of Fixpoints
%B Proc. of POPL, Los Angeles
%D 1977
%A S. Debray
%T Efficient Dataflow Analysis of Logic Programs
%B Proc. of POPL, San Diego
%D 1988
%A P. Cousot
%T Semantic Foundations of Program Analysis
%B Program Flow Analysis
%E S. Muchnick
%E N. D. Jones
%I Prentice Hall
%D 1981
%A P. Cox
%A T. Pietrzykowski
%T Deduction plans: a basis for intelligent backtracking
%J IEEE Transs. on Pattern Anal. and Machine Intelligence, PAMI-3,1
%D 1981
%O l.r. 12/5
%A J. Crammond
%T A Comparative Study of Unification Algorithms for OR-Parallel Execution of Logic Languages
%I IEEE
%T Int. Conf. on Parallel Processing
%I D. DeGroot
%C St. Charles, Ill.
%P 131-138
%Z Month August
%D 1985
%A J. A. Crammond
%A C. D. F. Miller
%T An architecture for parallel logic languages
%P 183-195
%C Uppsala, Sweden
%D 1984
%Z Month August
%T 2nd Int. Logic Programming Conf.
%K parlog,language,unification
%A J. A. Crammond
%T Implementation of committed choice logic languages on shared memory multiprocessors
%R Ph.D.\ Thesis, Department of Computer Science
%I Heriot-Watt University
%D May 1988
%O Also Imperial College Technical Report PAR 88/4
%A J.C. Cunha
%A J.N. Aparicio
%T Delta-Prolog Implementation - Progress Report No. 1
%I Universidade Nova de Lisboa
%N UNL-6/84
%Z Progress Report
%Z Month December
%D 84
%A V. Dahl
%D 1985
%T Hiding complexity from the casual writer of parsers
%E Dahl & Saint-Dizier
%B Natural Language understanding and Logic Programming
%A V. Dahl
%T Logic Programming as a Representation of Knowledge
%J computer
%Y 1983
%V 16
%N 10
%A V. Dahl
%D 1979
%T Quantification in a three-valued logic for natural language question-answering systems
%S IJCAI'79
%A V. Dahl
%D 1981
%T Translating Spanish into logic through logic
%J American J. Computational Linguistics
%V 7
%N 3
%P 149-164
%A V. Dahl
%A M.C. McCord
%D 1983
%T Treating coordination in logic grammars
%J American J. Computational Linguistics
%V 9
%N 2
%P 69-91
%A D. Van Dalen
%T Logic and Structure
%I Springer-Verlag
%D 1983
%A J. Darlington
%T Alice and the parallel evaluation of logic programs
%P 21
%C Imperial College London
%D 1983
%Z Month June
%I ACM
%T 10th Symp. on Comp. Architecture
%K alice,logic,architecture,parlog
%A A. Davison
%T POOL: A PARLOG object oriented language
%I Imperial College
%A Saumya K. Debray
%A Prateek Mishra
%T Denotational and Operational Semantics for Prolog
%P 61-91
%J Journal of Logic Programming
%V 5
%N 1
%D 1988
%A Saumya K. Debray
%A Prateek Mishra
%T Denotational and Operational Semantics for Prolog
%P 61-91
%J Journal of Logic Programming
%V 5
%N 1
%D 1988
%A D. DeGroot
%A J.H. Chang
%T A comparison of two AND-parallel execution models
%J Congres AFCET Informatique
%Z Month March
%D 1985
%X Note=in english
%A D. DeGroot
%T Restricted And-Parallelism and Side Effects
%T Proceedings - 1987 Symposium on Logic Programming
%I The IEEE Computer Society Press
%P 80-89
%Z Month September
%D 1987
%A Doug DeGroot
%T Restricted And-parallelism
%P 471-478
%D 1984
%Z Month November
%I ICOT
%T Proc. of FGCS84
%K logic prolog
%A Jean-Paul Delahaye
%T S{'e}mantique Logique et D{'e}notationnelle des Interpr{'e}teurs Prolog
%P 3-42
%J Informatique Thorique et Applications
%V 22
%N 1
%D 1988
%A P. Dembinski
%T AND-parallelism with intelligent backtracking for annotated logic programs
%T 1985 Symposium on Logic Programming
%I IEEE
%P 29-38
%Z Month July
%D 1985
%A R. Demolombe
%T Syntactical Characterization of a Subset of Domain Independent Formulas
%I ONERA-CERT
%D 1982
%A P. Deransart
%A J. {Ma\l uszy\'{n}ski}
%T A Grammatical View of Logic Programming
%B Proc. of PLILP '88, Orleans, France
%S LNCS
%N 348
%I Springer-Verlag
%D 1989
%A H. Diel
%T A computer architecture supporting and/or parallelism
%P 14
%D 1984
%Z Month October
%T draft proc. afcet85
%Z Note=IBM Germany)
%K parallel programming, logic programming, AND-parallelism, OR-parallelism
remark=general overview of parallelism, application to special data base machine
%A H. Diel
%T Types of Parallelism in Machine Architectures Supporting Logic Programming
%T IFIP TC-10 Working Conf. on Fifth Generation Computer Architecture
%I UMIST
%C Manchester
%Z Month July 15-18
%D 1985
%K Organization=IBM Boeblingen, Germany,
%A E. W. Dijkstra
%T A Discipline of Programming
%I Prentice-Hall
%C New Jersey
%D 1976
%A E. W. Dijkstra
%T Guarded commands, nondeterminacy, and formal derivation of programs
%B CACM
%V 18
%N 8
%P 453--457
%D 1975
%A E. W. Dijkstra
%A C. S. Scholten
%T Termination detection for diffusing computations
%B Information Processing Letters
%V 11
%N 1
%P 1--4
%D 1980
%A T. Disz
%A E. Lusk
%A R. Overbeek
%T Experiments with OR-parallel logic programs
%I The International Conference on Logic Programming
%T Proceedings, Melbourne, Australia
%P 576=599
%Z Month May
%D 1987
%A W. Drabent
%A J. {Ma\l uszy\'{n}ski}
%T Proving Runtime Properties of Logic Programs
%J Theoretical Computer Science
%V 59
%D 1988
%X
NOTE = "Also in Proc. of TAPSOFT '87, LNCS 250, Springer-Verlag, 1987"
%A M. Ducasse
%D 1988
%T Opium+, a Meta-debugger for Prolog
%S ECAI-88, Munich
%P 272-277
%A Elmar Eder
%T Properties of Substitutions and Unifications
%P 31-46
%J Journal of Symbolic Computation
%V 1
%N 1
%D Mar, 1985
%A M. Eisenstadt
%A M. Brayshaw
%D 1988
%T Adding data and procedure abstraction to the Transparent Prolog Machine (TPM)
%R OU-HCRL-TR31
%A M. Eisenstadt
%A M. Brayshaw
%D 1988
%T A fine-grained account of Prolog execution for teaching and debugging
%R (Draft)
%A M. Eisenstadt
%A M. Brayshaw
%D 1987
%T An integrated textbook, video, and software environment for novice and expert Prolog programmers
%R OU-HCRL-TR23
%A M. Eisenstadt
%D 1985
%T Tracing and debugging Prolog programs by retrospective zooming
%I HCRL, Open University
%R TR-17
%A M. Eisenstadt
%A M. Brayshaw
%D 1987
%T The Transparent Prolog Machine (TPM): An execution model and graphical debugger for logic programming (Revised Edition)
%R OU-HCRL-TR21a
%I HCRL, Open University
%A Norbert Eisinger
%T Logic programming: A parallel approach
%C Maryland
%D 1981
%Z Month December
%I University of Maryland
%N TR-1124
%K ZMOB,architecture
%A M. H. Van Emden
%A J. W. Lloyd
%T A logical reconstruction of Prolog II
%J Journal of Logic Programming
%V 1
%D 1984
%P 143--149
%A M. H. van Emden
%T McDermott on Prolog: A Rejoinder
%J SIGART Newsletter
%V 73
%P 19-20
%D 1980
%O l.r. 12/1
%A M. H. van Emden
%A G. J. de Lucena
%T Predicate logic as a language for parallel programming
%E K. L. Clark
%E S.-A. T\" arnlund
%B Logic Programming
%P 189--198
%I Academic Press
%C London
%D 1982
%A M. H. Van Emden
%A R. A. Kowalski
%T The semantics of predicate logic as a programming language
%J JACM
%V 23
%N 4
%D 1976
%P 733--742
%A D.W. Etherington
%T Relating Default Logic and Circumscription
%B ijcai87
%C mi
%Y 1987
%A D.W. Etherington
%T A Semantics for Default Logic
%B ijcai87
%C mi
%Y 1987
%P 495-498
%A Barry S. Fagin
%A Alvin M. Despain
%T Performance studies of a parallel Prolog architecture
%T The 14th Annual International Symposium on Computer Architecture
%I The IEEE Computer Society Press
%P 108 - 116
%Z Month June
%D 1987
%A R. Fagin
%T Horn clauses and database dependencies
%B 12th Ann. ACM Symp. on Theory of Computing
%D 1980
%D 123-134
%A M. Falaschi
%A G. Levi
%T Finite failures and partial computations in concurrent logic languages
%B Proc.\ International Conference on Fifth Generation Computer Systems
%P 364--373
%I ICOT
%C Tokyo
%D 1988
%A M. Falaschi
%A G. Levi
%A M. Martelli
%A G. Palamidessi
%T A new declarative semantics for logic languages
%E K. Bowen
%E R. A. Kowalski
%B Proc.\ 5\/$^{th}$ International Conference Symposium on Logic Programming
%P 993--1005
%I MIT Press
%D 1988
%A M. Fitting
%T Computability Theory, Semantics, and Logic Programming
%I Oxford University Press
%C New York
%D 1987
%A M. Fitting
%A M. Ben-Jacob
%T Stratified and three-valued logic programming semantics
%B Fifth Int'l Conf.\ Symp. on Logic Programming
%C Seattle
%P 1054--1069
%Y 1988
%A Melvin Fitting
%T A Deterministic Prolog Fixpoint Semantics
%P 111-118
%J Journal of Logic Programming
%V 2
%N 2
%D 1985
%A Melvin Fitting
%T A Deterministic Prolog Fixpoint Semantics
%P 111-118
%J Journal of Logic Programming
%V 2
%N 2
%D 1985
%A Melvin Fitting
%T A Kripke-Kleene Semantics for Logic Programs
%J Journal of Logic Programming
%V 4
%D 1985
%P 295-312
%A Tim Flannagan
%T The Consistency of Negation as Failure
%J Journal of Logic Programming
%V 2
%D 1986
%P 93-114
%A S. Fleisig
%A D. W. Loveland
%A A. K. Smiley
%A D. L. Yarmush
%T An implementation of the model elimination proof procedure
%J JACM
%V 21 %N 1
%D 1974
%P 124--139
%A I. Foster
%T Efficient metacontrol in parallel logic programming
%R Research Report PAR 87/18
%I Department of Computing Imperial College of Science and Technology
%C London
%D 1987
%A I. Foster
%A S. Taylor
%T Flat Parlog: A basis for comparison
%B International J.\ of Parallel Programming
%V 16
%N 2
%D 1987
%A I. Foster
%T Parallel implementation of PARLOG
%B To appear in Proc.\ International Conference of Parallel Processing
%D 1988
%A I. Foster
%T PARLOG as a Systems Programming Language
%R Ph.D.\ Thesis
%I Department of Computing, Imperial College of Science and Technology
%C London
%D 1988
%A Ian Foster
%Z Imperial College, London
%T Parallel Implementation of Parlog
%J Proceedings of the 1988 International Conference on Parallel Processing
%V II, Software
%I Penn State
%C University Park, Penn
%D August 1988
%P 9-17
%K Logic Programming, logical variable, control call, distributed unification,
read, ns_read, unify algorithms, distributed control, termination, deadlock,
%A N. Francez
%A M. Rodeh
%T Achieving distributed termination without freezing
%B IEEE Transactions on Software Engineering
%V SE-8
%N 3
%P 359--385
%D 1982
%A N. Francez
%T Fairness
%I Springer-Verlag
%D 1987
%A N. Francez
%A O. Grumberg
%A S. Katz
%A A. Pnueli
%T Proving Termination of Prolog Programs
%P 89-105
%E Rohit Parikh
%B Logics of Programs
%S LNCS
%N 193
%I Springer-Verlag
%C Brooklyn
%D 1985
%A N. Francez
%A O. Grumberg
%A S. Katz
%A A. Pnueli
%T Proving Termination of Prolog Programs
%P 89-105
%E Rohit Parikh
%B Logics of Programs
%S LNCS
%N 193
%I Springer-Verlag
%C Brooklyn
%D 1985
%A D. P. Friedman
%A D. S. Wise
%T An approach to fair applicative multiprogramming
%E G. Kahn
%B Semantics of Concurrent Computation
%Z LNCS
%V 70
%P 203--226
%I Springer-Verlag
%D 1979
%A D. P. Friedman
%A D. S. Wise
%T Aspects of applicative programming for parallel processing
%B IEEE Trans.\ on Computers
%V C-27
%N 4
%P 289--296
%D 1978
%A D. P. Friedman
%A D. S. Wise
%T An indeterminate constructor for applicative programming
%B Conference Record 7\/$^{th}$ ACM Symposium on Principles of Programming Languages
%P 245--250
%D 1980
%A D.P. Frost
%D November 1986
%T A practical Prolog chart parser for GPSG
%I ICRF
%O (submitted 3rd Conf European Chapter of ACL
%A K. Fuchi
%A K. Furukawa
%T The role of logic programming in the Fifth Generation Computer Project
%B New Generation Computing
%V 5
%N 1
%P 3--28
%D 1987
%A H. Fujita
%D 1986
%T Abstract interpretation and partial evaluation of Prolog programs
%R ICOT TM-0484
%A H. Fujita
%A K. Furukawa
%D 1988
%T A self-applicable partial evaluator and its use in incremental compilation
%J New Generation Computing
%V 6
%N 2-3
%P 91-118
%A P. Fung
%A B. du\0Boulay
%A M. Elsom-Cook
%D 1987
%T An initial taxonomy of novices misconceptions of the Prolog interpreter
%R OU CITE Report No.27
%A P. Fung
%D 1987
%T Novice Prolog programmers
%R OU CITE Report No.26
%A K. Furukawa
%A K. Ueda
%T GHC process fusion by program transformation
%B Proc.\ 2\/$^{nd}$ Conference on Japan Society of Software Science and Technology
%P 89--92
%D 1985
%A K. Furukawa
%A A. Okumura
%A M. Murakami
%T Unfolding rules for GHC programs
%E D. Bjorner
%B Proc.\ Workshop on Partial and Mixed Computation
%Z Gl.\ Avernaes
%D 1987
%A Koichi Furukawa
%A Akikazu Takeuchi
%A Susumu Kunifuji
%T Mandala: A Concurrent Prolog Based Knowledge Programming Language/System
%D 1983
%Z Month November
%I ICOT
%N TR-029
%A Y. Futamura
%T Partial evaluation of computation process --- an approach to a compiler-compiler
%B Systems, Computers, Controls
%V 2
%N 5
%P 721--728
%D 1971
%A G.Giandonato
%A G. Sofi
%T Parallelizing Logic Programming Based Inference Engines
Note=ESPRIT pilot project no. 26, Report Apr.86 - Sept.86, Draft
%Z Month September
%D 1987
%A H. Gaifman
%A E. Shapiro
%T Fully abstract compositional semantics for logic programs
%B Proc.\ ACM Symposium on Principles of Programming Languages
%D 1989
%A J. Gaifman
%A E. Shapiro
%T Proof Theory and Semantics of Logic Programs
%R Detailed Abstract
%D October 1988
%A J. Gallagher
%T An Approach to the Control of Logic Programs
%R Ph.D.\ Thesis
%I Department of Computer Science Trinity College
%C Dublin
%D 1983
%A J. Gallagher
%T Transforming logic programs by specialising interpreters
%B Proc.\ 7\/$^{th}$ European Conference on Artificial Intelligence
%P 109--122
%C Brighton
%D 1986
%A J. Gallagher
%A E. Shapiro
%T Using safe approximations of fixed points for analysis of logic programs
%I Proc.\ META88, Workshop on Meta-Programming in Logic Programming
%C Bristol
%D 1988
%A H. Gallaire
%T Merging Objects and Logic Programming: Relational Semantics
Performance and Standardization
%B aaai86
%Y 1986
%C ph
%P 754-758
%A H. Gallaire
%A C. Lasserre
%D 1982
%T Metalevel control for logic programs
%E Clark & Tarnlund
%B Logic Programming
%A J.H. Gallier
%T Logic for Computer Science
%I hr
%C ny
%Y 1986
%A J. H. Gallier
%A Stan Raatz
%T Refutation Methods for Horn Clauses with Equality Based on Unification
%I University of Pennsylvania
%R MS-CIS-86-59
%K AI10
%Q Van Gelder, Allen
%T The Alternating Fixpoint of Logic Programs with Negation
%Z Available from UC Santa Cruz as UCSC-CRL-88-17
%B Eighth ACM Symposium on Principles of Database Systems
%Y 1989
%Q Van Gelder, Allen
%T Efficient loop detection in Prolog using the
tortoise and hare technique
%J Journal of Logic Programming
%V 4
%N 1
%D 1987
%P
%Q Van Gelder, Allen
%T The Expressive Power of Wellfounded Fixpoint Logic
%I Univ. of Calif.
%C Santa Cruz
%N UCSC-CRL-88-37
%Y 1988
%Q Van Gelder, Allen
%T A message passing framework for logical query evaluation
%B 1986 ACM-SIGMOD Conf.\ on Management of Data
%D 1986
%P 155--165
%Q Van Gelder, Allen
%T Modeling simultaneous events with
default reasoning and tight derivations
%J Journal of Logic Programming
%Z (to appear)
%Y 1988
%Q Van Gelder, Allen
%T Negation as Failure Using Tight Derivation for General Logic Programs
%B Foundations of Deductive Databases and Logic Programming
%E J. Minker
%I Morgan Kaufmann
%C Los Altos, CA
%D 1988
%Q Van Gelder, Allen
%T Negation as failure using tight derivations for
general logic programs
%B Proc.\ Third IEEE Symposium on Logic Programming
%I Springer-Verlag
%Z September, YEAR = 1986
%X (Preliminary version also appears in
Foundations of Deductive Databases and Logic Programming
(J.\ Minker, Ed.), Morgan Kaufmann Publishers, Inc.
Los Altos, CA, 1988.
%C Salt Lake City, Utah
%Q Van Gelder, Allen
%T On the Equivalent Expressive Power of
Several Fixpoint Logics
%I Univ. of Calif.
%C Santa Cruz
%Z (manuscript)
%Y 1988
%Q Van Gelder, Allen
%A R. W. Topor
%T Safety and correct translation of
relational calculus formulas
%B 6th ACM Symp.\ on Principles of Database Systems
%D 1987
%P
%Q Van Gelder, Allen
%A R. W. Topor
%T Safety and correct translation of relational calculus formulas
%B 6th ACM Symp.\ on Principles of Database Systems
%D 1987
%D
%Q Van Gelder, Allen
%A K. A. Ross
%A J. S. Schlipf
%T Unfounded Sets and Well-Founded Semantics
for General Logic Programs
%B ACM Symposium on Principles of Database Systems
%P 221--230
%Y 1988
%Q Van Gelder, Allen
%A K. A. Ross
%A J. S. Schlipf
%T The Well-Founded Semantics for General Logic Programs
%Z Preliminary abstract appeared in Seventh
%ZACM Symposium on Principles of Database Systems
March 1988, pp.\ 221--230.
%N UCSC-CRL-88-16
%I Univ.\ of Calif.
%C Santa Cruz, CA 95064
%Y 1988
%A M. Gelfond
%T On stratified autoepistemic theories
%B Proc.\ AAAI
%Y 1987
%A M. Gelfond
%A V. Lifschitz
%T The Stable Model Semantics for Logic Programming
%B Fifth Int'l Conf.\ Symp. on Logic Programming
%C Seattle
%P 1070--1080
%Y 1988
%A M.R. Genesereth
%A N.J. Nilsson
%T Logical Foundations of Artificial Intelligence
%I mk
%C los
%Y 1987
%A M.R. Genesereth
%A M.L. Ginsberg
%D Sept. 1985
%T Logic programming
%J Communications of the ACM
%V 28
%N 9
%P 933-941
%A R. Gerth
%A M. Codish
%A Y. Lichtenstein
%A E. Shapiro
%T Fully abstract denotational semantics for Flat Concurrent Prolog
%B Proc.\ IEEE Symposium on Logic in Computer Science
%P 320--333
%D 1988
%A Wolfgang Giloi
%A Joachim Beer
%T The German Parallel Prolog Machine Development
%B IFIP TC-10 Working Conf. on Fifth Generation Computer Architecture
%I UMIST
%C Manchester
%Z Month July 15-18
%D 1985
%Z Note=(abstract)
%K Organization=GMD-FIRST, TU Berlin,
%A S. Ginsburg
%A E. H. Spanier
%T Finite turn pushdown automata
%J SIAM J. Control
%V 4
%N 3
%D 1966
%P 429--453
%A Mark E. Giuliano
%A Madhur Kohli
%A Jack Minker
%A Deepak Sherlekar
%A Arcot Rajasekar
%T Experiments with Parallel Logic Programming in PRISM
%I niversity of Maryland
%R UMIACS-TR-87-36, CS-TR-1887
%Z Month July
%D 1987
%A L. Goldschlager
%T The monotone and planar circuit value problem is
complete for P
%J SIGACT News
%D 1977
%P 25--27
%A A. Goto
%A H. Tanaka
%A T Moto-Oka
%T Highly parallel inference engine PIE: goal-rewriting model...
%J New generation Computing
%P 37-58
%D 1984
%Z Month March
%V 2
%I OHMSHA
%K prolog,or,and,pipeline,unification,simulation
%A S. Gregory
%A I. T. Foster
%A A. D. Burt
%A G. A. Ringwood
%T An abstract machine for the implementation of PARLOG on uniprocessors
%B New Generation Computing
%Z in press
%D 1986
%A S. Gregory
%T Parallel Logic Programming in PARLOG
%I Addison-Wesley
%D 1987
%A S. Gregory
%T Parallel Logic Programming in PARLOG
%I Addison-Wesley
%D 1987
%A S. Gregory
%A R. Neely
%A G. A. Ringwood
%T PARLOG for specification, verification and simulation
%E C. J. Koomen
%E T. Moto-Oka
%B Proc.\ 7\/$^{th}$ International Symposium on Computer Hardware Description Languages and their Applications
%P 139--148
%I Elsevier/North-Holland
%C Amsterdam
%D 1985
%A Sheila A. Greibach
%T The hardest context-free language
%J SIAM J. Computing
%V 2
%N 4
%D 1973
%P 304--310
%A Sheila A. Greibach
%T A note on undecidable properties of formal languages
%J Math Systems Theory
%V 2
%N 1
%D 1968
%P 1--6
%A Gigalips Group
%T Workshop on Logic Programming and Parallelism
%I ICS
%Z Month July
%D 1987
%A R. Gumb
%T Programming Logics: An Introduction to Verification and Semantics
%I John Wiley
%D 1989 (?)
%A Y. Gurevich
%A S. Shelah
%T Fixed-Point extensions of first order logic
%J Annals of Pure and Applied Logic
%V 32
%Y 1986
%P 265--280
%A Max Hailperin
%A Harald Westphal
%T A Computational Model for PEPSy
%I CRC
%N CA-16
%D 1986
%A Z. Halim
%T A Data-Driven machine for OR-Parallel Evaluation of Logic Programs
%J New Generation Computing
%V 4
%N 1
%P 5-33
%D 1986
%A Z. Halim
%A I. Watson
%T An or parallel data driven model for logic programs
%P 11
%C LA
%D 1984
%Z Month May
%T Intl workshop on HLCA 84
%K data flow, architecture
%A R. H. Halstead
%T MultiLisp --- A language for concurrent symbolic computation
%B ACM Trans.\ on Programming Languages and Systems
%V 7
%N 4
%P 501--538
%D 1985
%A S. Hanks
%A D. McDermott
%T Default reasoning, nonmonotonic logics, and the frame problem
%B AAAI Conference
%D 1986
%P 328--333
%A S. Hanks
%A D. McDermott
%T Temporal reasoning and default logics
%N 430
%I Yale University
%D 1985
%A S. Hanks
%A D. McDermott
%T Temporal reasoning and default logics
%N 430
%I Yale University
%D 1985
%A Hansson
%A Haridi
%A Tarnlund
%T Properties of a Logic Programming Language
%A Aake Hansson
%A Seif Haridi
%A Sten-Aake Taernlund
%T Language Features of LPL, A Logic Programming Language.
%R CSALAB TTDS/KTH Stockholm 1981 TRITA-CS-8103
%A D. Harel
%A A. Pnueli
%T On the development of reactive systems
%E K. R. Apt
%B Logics and Models of Concurrent Systems
%I Springer Verlag
%D 1985
%A S. Haridi
%A P. Brand
%T ANDORRA Prolog --- an integration if Prolog and committed choice languages
%B Proc.\ International Conference on Fifth Generation Computer Systems
%P 745--754
%I ICOT
%C Tokyo
%D 1988
%A Seif Haridi
%A Dan Sahlin
%T An Abstract Machine for LPL0.
%R CSALAB TTDS/KTH Stockholm 1984
%A Seif Haridi
%A Per Brand
%T ANDORRA Prolog - An Integration of Prolog and Committed Choice Languages.
%B Proc. Int. Conf. on 5th gen. Computer Systems 1988
%A Seif Haridi
%T Logic Programming Based on A Natural Deduction System.
%X
Ph.D. thesis
%R CSALAB TTDS/KTH Stockholm 1981 TRITA-CS-8104
%A Seif Haridi
%A Andrzej Ciepielewski
%T An Or-parallel Token Machine
%P 536 - 552
%C Stockholm Sweden
%D 1983
%Z Month June
%I Nucleo de Inteligencia Artificial, Universidade Nova de Lisboa
%B Proc. 1983 Logic Programming Workshop
%K architecture
%A J.A. Harland
%A J. Jaffar
%T On Parallel Unification for PROLOG
%J New Generation Computing
%V 6
%N 1
%D 1988
%A R. Harper
%A D. MacQueen
%A R. Milner
%T Standard ML
%R Technical Report ECS-LFCS-86-2
%I University of Edinburgh
%D 1986
%A A. Harsat
%A R. Ginosar
%T CARMEL -- a VLSI architecture for Flat Concurrent Prolog
%R EE PUB.\ Technical Report
%I Department of Computer Science Technion
%C Haifa
%D 1987
%A A. Harsat
%A R. Ginosar
%T CARMEL-2: a second generation VLSI architecture for Flat Concurrent Prolog
%B Proc.\ International Conference on Fifth Generation Computer Systems
%P 962--969
%I ICOT
%C Tokyo
%D 1988
%A Ryozu Hasegawa
%A Makoto Amamiya
%T Parallel execution of logic programs based on Dataflow Concept
%P 507-516
%D 1984
%Z Month November
%T ICOT Conf. 84
%K DFM,parallel,or,and,lazy,eager
%A Bogumil Hausmann
%A Seif Haridi
%A Andrzej Ciepielewski
%T Parallel Prolog Made Efficient, Versions Vector WAM
%B ECRC Workshop on Parallel Logic Programming Systems
%D 1987
%A P. Hayes
%T The Logic of Frames
%B Frame Conception and Text Understanding
%E D. Metzing
%I de Gruyter
%C be
%P 46-61
%Y 1979
%A Christopher T. Haynes
%T Logic Continuations
%R TR 183
%D NOV 1985
%I Indiana University Computer Science Department
%A L. Hellerstein
%A E. Shapiro
%T Implementing parallel algorithms in Concurrent Prolog: The MAXFLOW experience
%J J.\ Logic Programming
%V 3
%N 2
%P 157--184
%D 1984
%A P. Henderson
%T Purely functional operating systems
%E J. Darlington
%E P. Henderson
%E D. Turner
%B Functional Programming and Its Applications
%I Cambridge University Press
%D 1982
%A L. J. Henschen
%A H-S Park
%T Compiling the GCWA in indefinite deductive databases
%B minkbk
%E J. Minker
%P Los Altos, CA
%I Morgan Kaufmann
%D 395-438
%D 1988
%A L. J. Henschen
%A S. A. Naqvi
%T On compiling queries in first-order databases
%J JACM
%V 31 %N 1
%D 1984
%P 47--85
%A M. Hermenegildo
%T Relating goel scheduling, precedence and memory management in AND parallel execution of logic programs
%B The International Conference on Logic Programming Proceedings, Melbourne, Australia
%P 556-575
%Z Month May
%D 1987
%A M. de Hermenegildo
%A R.I. Nasr
%T Efficient management of backtracking in AND-parallelism
%B Third International Conference on Logic Programming
%E Ehud Shapiro
%C London
%P 40-54
%Z Month July
%D 1986
%K in the proceedings volume
%A Manuel V. Hermenegildo
%T An Abstract Machine Based Execution Model for Computer Architecture Design and Efficient Implementation of Logic Programs in Parallel
%I Dept. of Computer Sciences, The University of Texas at Austin
%Z Month August
%D 1986
%R TR-86-20
%A C. Hewitt
%A G. Agha
%T Guarded horn clause languages: are they deductive and logical
%J Proc. of fifth gen. comp. syst. conf., ICOT
%C Tokyo
%D Dec. 1988
%A C. Hewitt
%T A universal, modular Actor formalism for artificial intelligence
%B Proc.\ International Joint Conference on Artificial Intelligence
%D 1973
%A C.E. Hewitt
%T The Challenge of Open Systems
%J byte
%Y 1985
%V 10
%N 4
%P 223-242
%A R. Hill
%T LUSH-resolution and its Completeness
%I Dept. of Artificial Intelligence, University of Edinburgh
%R DCL Memo 78
%D 1974
%A R. Hill
%T LUSH-resolution and its completeness
%R DCL Memo 78
%I Department of Artificial Intelligence University of Edinburgh
%D 1974
%A Hideki Hirakawa
%T Eager and lazy enumerations in concurrent prolog
%C Tokyo
%D 1984
%Z Month August
%I Institute for New Generation Computer Technology, ICOT
%A M. Hirata
%T Letter to the editor
%J SIGPLAN Notices
%P 16--17
%D May 1986
%A M. Hirata
%T Parallel list processing language Oc and its self-description
%J Computer Software
%V 4
%N 3
%P 41--64
%D 1987
%O (in Japanese)
%A M. Hirata
%T Programming language Doc and its self-description, or, X=X is considered harmful
%B Proc.\ 3\/$^{rd}$ Conference of Japan Society of Software Science and Technology
%P 69--72
%D 1986
%A M. Hirsch
%A W. Silverman
%A E. Shapiro
%T Computation control and protection in the Logix system
%A C. A. R. Hoare
%T Communicating sequential processes
%J Comm.\ ACM
%V 21
%N 8
%P 666-677
%D 1978
%A C. A. R. Hoare
%T Communicating Sequential Processes
%I Prentice-Hall
%C New Jersey
%D 1985
%A C. A. R. Hoare
%T Monitors: an operating systems structuring concept
%J Comm.\ ACM
%V 17
%N 10
%P 549-557
%D 1974
%A C.J. Hogger
%D 1988
%T Programming environments (Invited talk)
%S ECAI-88, Munich
%P 698-706
%A Christopher John Hogger
%T Introduction to logic programming
%C London
%I Academic Press
%D 1984
%A John E. Hopcroft
%A Jeffery D. Ullman
%T Introduction to automata theory, languages, and computation
%I Addison-Wesley
%C Reading, MA
%D 1979
%A K. Horiuchi
%A T. Kanamori
%T Polymorphic Type Inference in Prolog by Abstract Interpretation
%B Logic Programming '87, Tokyo
%S LNCS
%N 315
%I Springer-Verlag
%D 1988
%A A. Houri
%A E. Shapiro
%T A sequential abstract machine for Flat Concurrent Prolog
%A X. Huang
%D 1985
%T Machine translation in the Semantic Definite Clause Grammars formalism
%R MCCS-85-7
%I New Mexico State University
%A R. Hull
%A J. Su
%T On the Expressive Power of Database Queries
with Intermediate Types
%B ACM Symposium on Principles of Database Systems
%Y 1988
%P 39--51
%A M. Huntbach
%D 1986
%T Program synthesis by inductive inference
%I University of Sussex
%R CSRP-59
%A N. Ichiyoshi
%A T. Miyazaki
%A K. Taki
%T A distributed implementation of Flat GHC on the Multi-PSI
%E J.-L. Lassez
%B Proc.\ 4\/$^{th}$ International Conference of Logic Programming
%P 257--275
%I MIT Press
%D 1987
%A N. Ichiyoshi
%A T. Miyazaki
%A K. Taki
%T A distributed implementation of Flat GHC on the Multi-PSI
%B The International Conference on Logic Programming
%B Proceedings, Melbourne, Australia
%P 257-274
%Z Month May
%D 1987
%A H. Iline
%A H. Kanoui
%T Extending Logic Programming to Object Programming:
The System LAP
%B ijcai87
%C mi
%Y 1987
%P 34-39
%A N. Immerman
%T Relational Queries Computable in Polynomial Time
%J Information and Control
%V 68, NUMBER = 1
%Y 1986
%P 86--104
%Q INMOS Ltd.
%T OCCAM Programming Manual
%I Prentice-Hall
%C New Jersey
%D 1984
%A D.J. Israel
%T The Role of Logic in Knowledge Representation
%J computer
%Y 1983
%V 16
%N 10
%P 37-41
%A N. Ito
%A H. Shimizu
%A M. Kishi
%A E. Kuno
%A K. Rokusawa
%T Data-flow Based Execution Mechanisms of Parallel and Concurrent Prolog
%J New Generation Computing
%N 3
%P 15-41
%D 1985
%K parallel processing, data flow model, logic programming
language, unification, nondeterminism
%A Noriyoshi Ito
%A Hajime Shimizu
%T Execution mechanism for pure and concurrent prolog on a data flow based
parallel inference engine
%D 1984
%Z Month August
%I Institute for New Generation Computer Technology, Oki Electric Co.
%K data_flow,Prolog
%A Noriyoshi Ito
%A Kanae Masuda
%T Parallel Inference Machine Based on the Data Flow Model
%I ICOT
%N TR-033
%Z Month December
%D 1983
%A Noriyoshi Ito
%A Kanae Masuda
%T Parallel inference machine based on the dataflow model
%P 10
%C LA
%D 1984
%Z Month May
%B Intl Workshop on High level Computer Architecture 84
%K pim,fgcs,ICOT, data flow,architecture
%A J.Misra
%T Distributed discrete-event simulation
%J Computing Surveys
%V 18
%N 1
%P 39--65
%D 1986
%A J.Sebel\'ik
%A P. Stvep\'anek
%T Horn Clause Programs for Recursive Functions
%B Logic Programming
%E K. Clarke
%E S-AA. T\"arnlund
%I Academic Press
%D 1982
%A J.W.Lloyd
%T Foundations of Logic Programming
%I Second Edition, Springer-Verlag
%D 1987
%A J. Jaffar
%A P.J. Stuckey
%T Canonical Logic Programs
%J Journal of Logic Programming
%V 3
%N 2
%D 1986
%A J. Jaffar
%A Peter J. Stuckey
%T Canonical Logic Programs
%P 143-155
%J Journal of Logic Programming
%V 3
%N 2
%D 1986
%A J. Jaffar
%A J-L. Lassez
%A M.J. Maher
%T Comments on the General Failure of Logic Programs
%J Journal of Logic Programming
%V 3
%N 2
%D 1986
%A J. Jaffar
%A J.-L. Lassez
%A M. J. Maher
%T Comments on ``General failure of logic programs''
%J Journal of Logic Programming
%V 3
%N 2
%D 1986
%P 115--118
%A J. Jaffar
%A J-L Lassez
%A J. Lloyd
%T Completeness of the Negation as Failure Rule
%B Proc. of IJCAI-83
%P 500-506
%C Karlruhe
%D 1983
%P 500--506
%A J. Jaffar
%A J.L. Lassez
%T Constraint Logic Programming
%B popl87
%C ??
%Y 1987
%P 111-119
%A J. Jaffar
%A J.-L Lassez
%T Constraint logic programming
%B Symposium on Principles of Programming Languages
%C Munich
%D 1987
%A J. Jaffar
%T A Decision Procedure for Theorems about Arrays
%B Proc. Logic and Computation Conf
%E J.N. Crossley
%E J. Jaffar
%I Monash University
%D January 1984.
%A J. Jaffar
%T Efficient Unification over Infinite Terms
%J New Generation Computing
%V 2
%N 3
%D 1984
%A J. Jaffar
%A J-L. Lassez
%T From Unification to Constraints
%B Japan Logic Programming Conf
%D August 87
%X (To appear, LNCS)
%A J. Jaffar
%A J-L. Lassez
%A M.J. Maher
%T A Logic Programming Language Scheme
%B Logic Programming: Relations, Functions and Equations
%E D. DeGroot
%E G. Lindstrom
%I Prentice-Hall
%D 1986
%A J. Jaffar
%A P.J. Stuckey
%T Logic Program Semantics for Programming with Equations
%B Proc. 3rd Int. Conf. on Logic Programming, London
%D July 86
%A J. Jaffar
%A S. Michaylov
%T Methodology and Implementation of a CLP System
%B Proc. 4th Int. Conf. on Logic Programming
%I MIT Press
%D May 1987.
%A J. Jaffar
%A S. Michaylov
%T Methodology and Implementation of a CLP System
%B Proc. 4th Int. Conf. on Logic Programming
%I MIT Press
%D May 1987
%A J. Jaffar
%T Minimal and Complete Word Unification
%I IBM Research Report RC 58213, T.J. Watson Research Center
%D July 1987
%A J. Jaffar
%A J-L. Lassez
%A M.J. Maher
%T PROLOG-II as an instance of the Logic Programming Language Scheme
%B Formal Description of Programming Concepts III
%E M. Wirsing
%I North-Holland
%D August 1987
%A J. Jaffar
%A P.J. Stuckey
%T Semantics of Infinite Tree Logic Programming
%J Theoretical Computer Science
%V 46
%D 1986
%A J. Jaffar
%A J-L Lassez
%A Michael J. Maher
%T Some Issues and Trends in the Semantics of Logic Programming
%P 223-241
%B Third International Conference on Logic Programming
%S LNCS
%N 225
%I Springer-Verlag
%D 1986
%A J. Jaffar
%A J-L. Lassez
%A Michael J. Maher
%T Some Issues and Trends in the Semantics of Logic Programming
%P 223-241
%B Third International Conference on Logic Programming
%S LNCS
%N 225
%I Springer-Verlag
%D 1986
%A J. Jaffar
%A J-L. Lassez
%A M.J. Maher
%T A Theory of Complete Logic Programs with Equality
%J Journal of Logic Programming
%V 1
%N 3
%D 1985
%A J. Jaffar
%A J-L. Lassez
%A M.J. Maher
%T Trends in the Semantics of Logic Programming
%B Proc. 3rd Int. Conf. on Logic Programming,London
%D July 1986.
%A V. K. Janakiram
RA D. P. Agrawal
%A R. Mehrota
%T Randomized Parallel Algorithms for Prolog Programs and
Backtracking Applications
%I The Pennsylvania State University
%B Proceedings of the 1987 International Conference on Parallel Processing
%E Sartaj K. Sahni
%P 278-281
%Z Month August
%D 1987
%A S. D. Johnson
%T Circuits and systems: Implementing communications with streams
%R Technical Report 116
%I Computer Science Department Indiana University
%D 1981
%A J. Jones
%A M. Millington
%A P. Ross
%D 1986
%T A Blackboard shell in Prolog
%R TR-277
%I Department of AI, University of Edinburgh
%A J. Jones
%A M. Millington
%D 1986
%T An Edinburgh Prolog Blackboard shell
%I Department of AI, University of Edinburgh
%R TR-281
%A N. D. Jones
%A H. Sndergaard
%T A Semantics-Based Framework for the Abstract Interpretation of Prolog
%B Abstract Interpretation of Declarative Languages
%E S. Abramsky
%E C. Hankin
%I Ellis Horwood
%D 1987
%A Neil D. Jones
%A William T. Laaser
%T Complete problems for deterministic polynomial time
%J Theoretical Computer Science
%V 3
%N 1
%Z Oct., YEAR = 1976
%P 105--117
%A Neil D. Jones
%A Harald Sondergaard
%T A Semantics-Based Framework for the Abstract Interpretation of Prolog
%E S. Abramsky
%E C. Hankin
%B to appear in Abstract Interpretation of Declarative Languages
%I Ellis Horwood
%D 1986
%A Neil D. Jones
%A Alan Mycroft
%T Stepwise Development of Operational and Denotational Semantics for Prolog
%P 281-288
%B International Symposium on Logic Programming
%I IEEE
%C Atlantic City, NJ
%D 1984
%A Neil D. Jones
%A Alan Mycroft
%T Stepwise Development of Operational and Denotational Semantics for Prolog
%P 281-288
%E Mart\'n Abadi
%E Zohar Manna
%B Temporal Logic Programming
%P 4-16
%B International Symposium on Logic Programming
%I IEEE
%C San Francisco, CA
%D Sep, 1987
%X
An extended version will appear in the Journal of Symbolic Computation
%A Jie-Yong Juang
%A Ting-Lu Huang
%A Ed Freeman
%T Parallelism in Connection-Graph-Based Logic Inference
%J Proceedings of the 1988 International Conference on Parallel Processing
%V II, Software
%I Penn State
%C University Park, Penn
%D August 1988
%P 1-8
%K Logic Programming, predicate connection graph, resolution,
logical inconsistency, Bernstein condition, search, pruning,
lock-and-withdraw synchronization, snowball propagation, partitioning,
%A Peter Kacsuk
%T A highly parallel prolog based on the generalised DF model
%P 195-205
%C Uppsala, Sweden
%D 1984
%Z Month July
%B 2nd Int. Logic Programming Conference
%K or, and, tree
%A G. Kahn
%A D. MacQueen
%T Coroutines and networks of parallel processes
%E B. Gilchrist
%B Information Processing 77
%Z Proc.\ IFIP Congress
%P 993--998
%I North-Holland
%D 1977
%A K. Kahn
%A E. D. Tribble
%A M. Miller
%A D. G. Bobrow
%T Vulcan: Logical concurrent objects
%E B. Shriver
%E P. Wegner
%B Research Directions in Object-Oriented Programming
%I MIT Press
%D 1987
%A Kenneth M. Kahn
%T A Primitive for the Control of Logic Programs
%Z UPMAIL, Uppsala
%T 1984 Int. Symp. on Logic Programming
%I IEEE
%P 242-251
%Z Month February
%D 1984
%K or-parallelism, control predicate, all solutions
%A L.V. Kale
%T Completeness and full parallelism of parallel logic programming schemes
%D 1987
%I Univ of Ill
%A L.V. Kale
%T The REDUCE-OR Process Model for parallel evaluation of logic programs
%I The International Conference on Logic Programming
%B Proceedings, Melbourne, Australia
%P 616-632
%Z Month May
%D 1987
%A S. Kasif
%A J. Minker
%T The intelligent channel: a scheme for result sharing in parallel logic programs
%D 1985
%Z Month January
%I Univ. of Maryland
%R Type=Internal Report
%K parallelism, or, and, prism
%A M. Kay
%D 1985
%T Unification in grammar
%E Dahl & Saint-Dizier
%B Natural Language understanding and Logic Programming
%A R.M. Keller
%A G. Lindstrom
%A S. Patil
%T An Architecture for a Loosely-coupled Parallel Processor
%I University of Utah
%N UUCS-78-105
%Z Month October
%D 1978
%K applicative progra parallelelism, reduction machine, tagged architecture
%A J. Chassin de Kergommeaux
%A P. Robert
%A H. Westphal
%T An Abstract Machine for the Implementation of the PEPSys Model
%I CRC
%R CA-26
%Z Month February
%D 1987
%K NOT in the data base
%A Jacques Chassin de Kergommeaux
%A Donald Peterson
%T A Compilation System for PEPSys
%I CRC
%R 16
%Z Month April
%D 1987
%A Tom Khabaza
%T Reconciliation for AND/OR-parallelism
%X HowPublished=Handout at Megalips@+[+] workshop, Manchester
%Z Month July
%D 1986
%A M. Kharoune
%A A. Aggoune
%T Deux Approches du Parallelisme ET en Prolog.
%I CNET Lannion
%C Tregastel
%B Seminaire de Programmation en Logique
%P 586-607
%D 1986
%A P. Kilpelainen
%A H. Mannila
%A J. Riivari
%A E. Ukkonen
%T Design principles of Helsinki Prolog programming environment
%B Finnish Artificial Intelligence Symposium
%V 2
%E M. Karjalainen
%E J. Seppanen
%E M. Tamminen
%D 1986
%P 24-31.
%A Y. Kimura
%A T. Chikayama
%T An Abstract KL1 Machine and its Instruction Set
%B Proceedings - 1987 Symposium on Logic Programming
%I The IEEE Computer Society Press
%P 468-477
%D Sep, 1987
%A M. Kishimoto
%A et al.
%T An evaluation of the FGHC via practical application programs
%I ICOT
%R Technical Report TR-232
%I Institute for New Generation Computer Technology
%C Tokyo
%D 1987
%A S. C. Kleene
%T Introduction to Metamathematics
%I ??
%A S. Kliger
%A E. Shapiro
%T A decision tree compilation algorithm for FCP($\mid$,:,?)
%E K. Bowen
%E R. A. Kowalski
%B Proc.\ 5\/$^{th}$ International Conference Symposium on Logic Programming
%P 1315--1336
%C MIT Press
%D 1988
%A S. Kliger
%A E. Yardeni
%A K. Kahn
%A E. Shapiro
%T The language FCP(:,?)
%B Proc.\ International Conference on Fifth Generation Computer Systems
%P 763--773
%I ICOT
%C Tokyo
%D 1988
%A Y. Kohda
%A J. Tanaka
%T Deriving a compilation method for parallel logic languages
%B Logic Programming
%S LNCS
%N 315
%P 80--94
%I Springer-Verlag
%D 1988
%A Madhur Kohli
%A Mark E. Giuliano
%A Jack Minker
%T An Overview of the PRISM Project
%J Computer Architecture News
%V 15
%N 1
%P 35-42
%Z Month March
%D 1987
%A P. G. Kolaitis
%T The Expressive Power of Stratified Programs
%C Stanford University
%Z (manuscript)
%Y 1987
%A P. G. Kolaitis
%A C. H. Papadimitriou
%T Why not negation by fixpoint?
%B ACM Symposium on Principles of Database Systems
%Y 1988
%P 231--239
%A Phokion Kolaitis
%T The Expressive Power of Stratified Logic Programs
%R Manuscript, Submitted for Publication
%D 1988
%A R. Kowalski
%A F. Kriwaczek
%T Logic Programming. Prolog and its Applications
%I aw
%C rm
%Y 1986
%A R. A. Kowalski
%T Algorithm= Logic + Control
%J Comm. of the ACM
%V 22
%P 424-431
%D 1979
%O have
%A R. A. Kowalski
%A D. G. Kuehner
%T Linear resolution with selection function
%J Artificial Intelligence
%V 2
%D 1971
%P 227--260
%A Robert Kowalski
%A D. Kuehner
%T Linear Resolution with Selection Function
%P 227-260
%J Artificial Intelligence
%V 2
%D 1971
%A Robert Kowalski
%T Logic for Problem Solving
%I North Holland
%C New York
%S Artificial Intelligence Series
%D 1979
%A Robert Kowalski
%T Predicate Logic as Programming Language
%P 569-574
%E Jack L. Rosenfeld
%B Information Processing 74, Proceedings of IFIP congress 74
%I North-Holland
%C Stockholm, Sweden
%D 1974
%A K. Kumon
%A H. Masuzawa
%A A. Itashiki
%T Kabu-Wake: A new parallel inference method and its evaluation
%T Proc. IEEE COMPCON 86
%C San Francisco
%P 168-172
%Z Month March
%D 1986
%A K. Kunen
%T Negation in logic programming
%J Journal of Logic Programming
%V 4, NUMBER = 4
%Y 1987
%P 289--308
%A K. Kunen
%T Some Remarks on the Completed Database
%N 775
%I Univ.\ of Wisconsin
%C Madison, WI 53706
%Z (Abstract to appear in 5th Int'l Conf.\ Symp.\ on Logic Programming
Seattle, Aug.\ 1988)
%Y 1988
%A H. T. Kung
%T Why systolic architectures?
%J IEEE Computer
%V 15
%N 1
%P 37--46
%D 1982
%A G. M. Kuper
%T On the Expressive Power of Logic Programming Languages
with Sets
%B ACM Symposium on Principles of Database Systems
%Y 1988
%P 10--14
%A A. J. Kusalik
%T Bounded-wait merge in Shapiro's Concurrent Prolog
%B New Generation Computing
%V 1
%N 12
%P 157--169
%D 1984
%A L.V.Kale
%T 'Completeness' and 'Full Parallelism' of Parallel Logic Programming Schemes
%B Proceedings - 1987 Symposium on Logic Programming
%I The IEEE Computer Society Press
%P 125-133
%Z Month September
%D 1987
%A T. H. Lai
%T Termination detection for dynamically distributed systems with non-first-in-first-out communication
%J J.\ Parallel and Distributed Computing
%V 3
%P 577--599
%D 1986
%A A. Lakhotia
%A L. Sterling
%D 1988
%T Composing recursive logic programs with Clausal Join
%J New Generation Computing
%V 6
%N 2-3
%P 211-226
%A A. Lakhotia
%A L. Sterling
%A D. Bojantchev
%D 1988
%T Development of a Prolog tracer by stepwise enhancement
%R Case Western Reserve University
%A A. Lakhotia
%A L. Sterling
%D 1988 May
%T How to control unfolding when specialising interpreters
%R Case Western Reserve University CES-88-08
%A M. Lam
%A S. Gregory
%T PARLOG and ALICE: a marriage of convenience
%E J.-L. Lassez
%B Proc.\ 4\/$^{th}$ International Conference on Logic Programming
%P 294--310
%I MIT Press
%D 1987
%A L. Lamport
%T Time, Clocks, and the ordering of events in a distributed system
%B Communications of the ACM
%D July 1978
%A J-L Lassez
%A M. Maher
%T Closures and Fairness in the Semantics of Programming Logic
%J Theoretical Computer Science
%V 29
%D 1984
%A J-L Lassez
%A M. Maher
%T Optimal Fixedpoints of Logic Programs
%J Theoretical Computer Science
%V 39
$D 1985
%A J-L Lassez
%A M. Maher
%A K. Marriot
%T Unification Revisited
%B Foundations of Deductive Databases and Logic Programming
%E J. Minker
%I Morgan Kaufmann
%C Los Altos,CA
%D 1986
%A J-L. Lassez
%A M.J. Maher
%T The Denotational Semantics of Horn Clauses as a Production System
%B AAAI-83, Washington, USA
%D August 1983
%P 229-231
%A J-L. Lassez
%A K.G. Marriott
%T Explicit representations of terms defined by counter examples
%J Journal of Automated Reasoning
%V 3
%P 301-317
%D 1987
%A J-L. Lassez
%A V.L. Nguyen
%A E.A. Sonenberg
%T Fixed Point Theorems and Semantics: a Folk Tale
%J Information Processing Letters
%V 14
%N 3
%P 112-116
%D 1982
%A J. L. Lassez
%A K. Marriot
%T Explicit representation of terms defined by counter examples
%B wkshop
%E J. Minker
%C Washington, DC
%Z aug
%D 1986
%P 659--677
%A J.L. Lauriere
%T Intelligence Artificielle.
Tome 1 : resolution de problemes par l'Homme et la machine
%I Eyrolles
%C Paris
%Y 1987
%A J.L. Lauriere
%T Intelligence Artificielle.
Tome 2 : Representation des connaissances
%I Eyrolles
%C Paris
%Y 1988
%A J.L. Lauriere
%T Representation et utilisation des connaissances
%X
HOWPUBLISHED = \it Techniques et Sciences Informatiques
1(1):25-42 et 1(2):115-144
%Y 1982
%A V. T. Le
%T General failure of logic programs
%J Journal of Logic Programming
%V 2
%N 2
%D 1985
%P 157--165
%A V. T. Le
%T Negation-as-failure rule for general logic programs with equality
%J Journal of Logic Programming
%V 2
%N 4
%D 1985
%P 285--294
%A R. Lee
%A R. Goebel
%T Concurrent Prolog in a multi process environment
%B 1985 Symposium on Logic programming
%I IEEE
%P 100-109
%Z Month July
%D 1985
%A R. K. Lee
%T Concurrent Prolog in a multi-process environment
%I Faculty of Mathematics University of Waterloo, Ontario, Canada
%N CS-84-46
%Z Month November
%D 1984
%A S. Lee
%T On Executable Models for Rule-Based Prototyping
%B Proceedings of the 8th International Conference on Software Engineering
London, UK
%D August 1985
%P 210-215
%A Jacek Leszczylowski
%A Jan Maluszynski
%T Logic Programming with External Procedures: Introducing S-Unification
%I Iowa State University Computer Science Department
%R TR #86-21
%D DEC 1986
%A H.J. Levesque
%T Knowledge Representation and Reasoning
%J arcs
%Y 1986
%V 1
%P 255-287
%A H.J. Levesque
%T The Logic of Incomplete Knowledge Bases
%B On Conceptual Modelling
%E M.L. Brodie
%E J. Mylopoulos
%E J. Schmidt
%I sv
%C be
%Y 1984
%P 165-169
%T Readings in Knowledge Representation
%E R.J. Brachman
%A H.J. Levesque
%I Morgan Kaufmann
%C Los Altos
%X
and most others papers of Brachman and Levesque
%A G. Levi
%A C. Palamidessi
%T An approach to the declarative semantics of synchronization in logic languages
%E J.-L. Lassez
%B Proc.\ 4\/$^{th}$ International Conference on Logic Programming
%P 877--893
%I MIT Press
%D 1987
%A G. Levi
%T Models, unfolding rules and fixpoint semantics
%E K. Bowen
%E R. A. Kowalski
%B Proc.\ 5\/$^{th}$ International Conference Symposium on Logic Programming
%P 1649--1665
%I MIT Press
%D 1988
%A G. Levi
%A G. Sardu
%T Partial evaluation of meta-programs in a multiple world's logic language
%E D. Bjorner
%E A. P. Ershov
%E N. D. Jones
%B Workshop on Partial Evaluation and Mixed Computation
%C Gl.\ Avernaes
%D 1987
%A J. Levy
%A E. Shapiro
%T CFL --- A concurrent functional
language embedded in a concurrent logic programming environment
%Z Ehud Shapiro - Part 2.
%A J. Levy
%T Concurrent Prolog and Related Languages
%R Ph.D.\ Thesis
%I Department of Computer Science, The Weizmann Institute of Science
%C Rehovot
%D 1988
%A J. Levy
%A N. Friedman
%T Concurrent Prolog implementations --- two new schemes
%R Technical Report CS86-13
%I Department of Computer Science, The Weizmann Institute of Science
%C Rehovot
%D 1986
%A J. Levy
%T A GHC Abstract Machine and Instruction Set
%I Weizmann Institute of Science
%N CS-85-11
Type=Internal Report
%Z Month December
%D 1985
%A J. Levy
%T A GHC abstract machine and instruction set
%E E. Shapiro
%B Proc.\ 3\/$^{rd}$ International Conference on Logic Programming
%S LNCS
%N 225
%P 157--171
%I Springer-Verlag
%D 1986
%A J. Levy
%T Shared memory execution of committed-choice languages
%T Third International Conference on Logic Programming
%E Ehud Shapiro
%C London
%P 298-312
%Z Month July
%D 1986
%K in the proceedings volume
%A J. Levy
%A E. Shapiro
%T Translation of Safe GHC and Safe Concurrent Prolog to FCP
%A J. Levy
%T A unification algorithm for Concurrent Prolog
%E S.-A. T\"{a}rnlund
%B Proc.\ 2\/$^{nd}$ International Conference on Logic Programming
%P 333--341
%C Uppsala
%D 1984
%A P.P. Li
%A A.J. Martin
%T The Sync Model: A Parallel Execution Method for Logic Programming
%T Proc. 1986 Symposium on Logic Programming
%C Salt Lake City, Utah
%P 223-234
%Z Month September
%D 1986
%A Y. Lichtenstein
%A E. Shapiro
%T Abstract algorithmic debugging
%E K. Bowen
%E R. A. Kowalski
%B 5\/$^{th}$ International Conference and Symposium on Logic Programming
%P 1315--1336
%I MIT Press
%D 1988
%A Y. Lichtenstein
%A E. Shapiro
%T Concurrent algorithmic debugging
%J Proc ACM Workshop on Parallel Debugging. Also
%J Technical Report CS87-20,
%I Department of Computer Science, The Weizmann Institute of Science
%C Rehovot
%D 1987
%A V. Lifschitz
%T On the declarative semantics of logic programs with negation
%B mbook
%E J. Minker
%C Los Altos, CA
%I Morgan Kaufmann
%D 1988
%P 177--192
%A Y.-J. Lin
%A V. Kumar
%A C. Leung
%T An intelligent backtracking algorithm for parallel execution of logic programs
%B Third International Conference on Logic Programming
%E Ehud Shapiro
%C London
%P 55-68
%Z Month July
%D 1986
%K in the proceedings volume
%A G. Lindstrom
%A P. Panangaden
%T Stream-based execution of logic programs
%P 168-175
%D 1984
%Z Month February
%B 84 IEEE intl symp on logic programming
%K parallelism,substitution
%A Gary Lindstrom
%T Or-parallelism on applicative architectures
%X Draft
%D 1984
%Z Month January
%I Laboratory for Computer Science MIT
%K unification,architecture
%A J. Lloyd
%A R. Topor
%T A Basis for Deductive Database Systems
%J J. Logic Programming
%V 2
%N 2
%D 1985
%A J. Lloyd
%A R. Topor
%T A Basis for Deductive Database Systems II
%J J. Logic Programming
%V 3
%N 1
%D 1986
%A J. W. Lloyd
%T Foundations of Logic Programming
%I Springer-Verlag
%C New York
%D 1984
%A J. W. Lloyd
%T Foundations of Logic Programming.
%C N.Y
%I Springer-Verlag
%D 1987
%X
Second edition 1987
%A J. W . Lloyd
%A R. W. Topor
%T Making Prolog more expressive
%J Journal of Logic Programming
%V 1, NUMBER = 3
%Y 1984
%P 225--240
%A C-K Looi
%A P. Ross
%D 1987
%T Automatic Program Debugging for a Prolog Intelligent Tutoring System
%R Edinburgh DAI-RP-307 (3rd AI & Educ. Conf. Pittsburgh)
%A D. W. Loveland
%T Automated Theorem Proving: A Logical Basis
%I North-Holland
%C Amsterdam
%D 1978
%A D. W. Loveland
%T A simplified format for the model elimination theorem-proving
procedure
%J JACM
%V 16 %N 3
%D 1969
%P 349--363
%A E. L. Lozinskii
%T Evaluating queries in deductive databases by generating
%B Proc. 9th Int. Joint Conf. on Artificial Intelligence
%D 1985
%P 173--177
%A E. L. Lozinskii
, E. L.
%T Inference by generating and structuring of deductive databases
%N 84-11
%I Dept. Computer Science, Hebrew University
%C Jerusalem, Israel
%Z June
%D 1984
%A M.J. Maher
%T Complete Axiomatizations of Finite, Rational and Infinite Trees
%B Proc. 3rd Logic in Computer Science Conference,Edinburgh, UK
%D June, 1988
%A M.J. Maher
%T Correctness of a Logic Program Transformation System
%I IBM Research Report RC 13496, T.J. Watson Research Center
%T 1988.
%A M.J. Maher
%T Equivalences of logic programs
%E J. Minker
%J Foundations of Deductive Databases and Logic Programming
%P 627--658
%I Morgan Kaufmann Publishers
%C Los Altos
%D 1987
%A M. J. Maher
%T Equivalences of logic programs
%B mbook
%E J. Minker
%C Los Altos, CA
%I Morgan Kaufmann
%D 1988
%P 388--402
%A M.J. Maher
%T Equivalences of Logic Programs
%B Foundations of Deductive Databases and Logic Programming
%E J. Minker
%I Morgan Kaufmann
%P 627-658
%D 1988.
%A M.J. Maher
%T Logic semantics for a class of committed-choice programs
%E J.-L. Lassez
%B Proc.\ 4\/$^{th}$ International Conference on Logic Programming
%P 858--876
%I MIT Press
%D 1987
%A M.J. Maher
%T Single Rules form Canonical Logic Programs
%I IBM Research Report RC 13528, T.J. Watson Research Center
%D 1988
%A Michael J. Maher
%T Complete Axiomatisations of the Algebra of Finite,
Rational and Infinite Trees
%B Third Anual Symposium on Logic in Computer Science
%D July, 1988
%P 348-357
%I IEEE
%C Edinburgh, Scotland
%X
IBM-T.J.Watson Research Center Tech report is earlier verison.
%A Udi Manber
%T Using Mathematical Induction to Design Computer Algorithms
%I University of Wisconsin-Madison, Computer Sciences Department
%R TR660
%D AUG 1986
%A A. Marek
%A M. Truszczynski
%T Autoepistemic Logic
%I University of Kentucky
%Z (manuscript)
%Y 1988
%A W. Marek
%T Stable Theories in Autoepistemic Logic
%I University of Kentucky
%Z (manuscript)
%Y 1986
%A K. Marriott
%A H. Sndergaard
%T Bottom-up Abstract Interpretation of Logic Programs
%B Proc. of 5th International Conf/Symp. on Logic Programming, Seattle
%T MIT Press
%D 1988
%A K. Marriott
%A H. Sondergaard
%T On Prolog and the Occur Check Problem
%R Draft note
%I Dept. of Computer Science, University Melbourne
%D 1988
%A K. Marriott
%A H. Sondergaard
%D 1988
%T Prolog program transformation by introduction of difference lists
%I Deptartment of Computer Science, University of Melbourne
%R TR-88-14
%A A. Martelli
%A U. Montanari
%T An Efficient Unification Algorithm
%J TOPLAS
$V 4
%N 2
%D 1982
%P 258-282
%A H. Masuzawa
%Q et al.
%T Kabu Wake parallel inference mechanism and its evaluation
%I IEEE
%B 1986 FJCC
%P 955-962
%Z Month November
%D 1986
%K Note=or parallel performance queens
%A F. Mattern
%T Algorithms for distributed termination detection
%J Distributed Computing
%V 2
%P 161--175
%D 1987
%A F.G. McCabe
%T The Sigma Machine
%I Imperial College, London
%Z Month March
%D 1986
%A J. McCarthy
%T Applications of circumscription to formalizing
common sense knowledge
%B AAAI Workshop on Non-Monotonic Reasoning
%Y 1984
%P 295--323
%A J. McCarthy
%T Circumscription -- a form of non-monotonic reasoning
%J Artificial Intelligence
%V 13, NUMBER = 1
%Y 1980
%P 27--39
%A M.C. McCord
%D 1986
%T Design of a Prolog-based machine translation system
%E Goos & Hartmanis
%B Third International Conference Logic Programming
%A M.C. McCord
%D July 1985
%T Modular logic grammars
%S Proc 23rd Annual Meeting ACL, July 1985, Chicago.
%A M.C. McCord
%D 1982
%T Using slots and modifiers in logic grammars for natural language
%J AI
%V 18
%P 327-367
%A D.V. McDermott
%A J. Doyle
%T Non Monotonic Logic I
%J ai
%Y 1980
%V 13
%P 41-70
%A D.V. McDermott
%T Non Monotonic Logic II - Non Monotonic Modal Theories
%J jacm
%Y 1982
%V 29
%N 1
%P 33-57
%A D. McKay
%A S. Shapiro
%T Using active connection graphs for reasoning with recursive
rules
%B Proc. 7th Int. Joint Conf. on Artificial Intelligence
%D 1981
%P 368--374
%A C. Mellish
%T Abstract Interpretation of Prolog Programs
%B Abstract Interpretation of Declarative Languages
%E S. Abramsky
%E C. Hankin
%I Ellis Horwood
%D 1987
%A C. Mellish
%A S. Hardy
%D 1983
%T Integrating Prolog into the Poplog environment
%S IJCAI'83
%A C. Mierowsky
%A S. Taylor
%A E. Shapiro
%A J. Levy
%A S. Safra
%T The design and implementation of Flat Concurrent Prolog
%J Technical Report CS85-09
%I Department of Computer Science, The Weizmann Institute of Science
%C Rehovot
%D 1985
%A Dale Miller
%T A Theory of Modules for Logic Programming
%I University of Pennsylvania
%R MS-CIS-86-53
%K AI10
%A Dale A. Miller
%A Gopalan Nadathur
%T Higher-Order Logic Programming
%I University of Pennsylvania
%R MS-CIS-86-17
%K AI10 T02
%A G. L. Miller
%A V. Ramachandran
%A E. Kaltofen
%T Efficient parallel evaluation of straight-line code
and arithmetic circuits
%B VLSI Algorithms and Architectures
%Z July
%D 1986
%I Springer-Verlag
%P 236--245
%A Gary L. Miller
%A John H. Reif
%T Parallel tree contraction and its applications
%B 26th FOCS
%D 1985
%P 478--489
%A R. Milner
%T A Calculus of Communicating Systems
%J LNCS
%V 92
%I Springer-Verlag
%D 1980
%A J. Minker
%A A. Rajasekar
%T A Fixpoint Semantics for Disjunctive Logic Programs
%D ??
%J Journal of Logic Programming
%A T. Miyazaki
%A A. Takeuchi
%A T. Chikayama
%T A sequential implementation of Concurrent Prolog based on the shallow binding scheme
%B 1985 Symposium on Logic Programming
%I IEEE
%P 110-126
%Z Month July
%D 1985
%A T. Miyazaki
%A A. Takeuchi
%A T. Chikayama
%T A sequential implementation of Concurrent Prolog based on
the shallow binding scheme
%J IEEE Symposium on Logic Programming
%P 110-118
%D 1985.
%A L. Monteiro
%T A small interpreter for distributed logic
%J Logic Programming Newsletter
%V 3
%D 1982
%O l.r. 12/1
%A R. C. Moore
%T Semantical Considerations on Non-Monotonic Logic
%J Artificial Intelligence
%V 28
%Y 1985
%P 75--94
%A K. Morris
%A J. D. Ullman
%Q Van Gelder, Allen
%T Design overview of the Nail! system
%B Third Int'l Conf.\ on Logic Programming
%P 554--568
%D 1986
%A K. Morrisa
%Z Talk at Workshop XP8.3i, Oregon Graduate Center
MONTH = July
%Y 1987
%A Y. N. Moschovakis
%T Elementary Induction on Abstract Structures
%I North-Holland
%C New York
%Y 1974
%A Y. N. Moschovakis
%T On Nonmonotonone Inductive Definability
%J Fundamenta Mathematica
%V 82, NUMBER = 1
%Y 1974
%P 39--83
%A Ben Moszkowski
%T Executing Temporal Logic Programs
%I Cambridge University Press
%C Cambridge
%D 1986
%A T. Moto-Oka
%A H. Tanaka
%A H. Aida
%A K. Hirata
%A T. Maruyama
%T The architecture of a parallel inference engine - PIE -
%P 479-488
%D 1984
%Z Month November
%I ICOT
%B Proc. FGCS 84
%K prolog,or,and,pipeline,unification,simulation
%A K. Murakami
%A T. Kakuta
%A R. Onai
%T Architectures and hardware systems: PIM and KB machine
%P 18-36
%D 1984
%Z Month November
%I ICOT
%B Proc. FGCS 84
%K overview, parallel, prolog, architecture
%A K. Murakami
%A T. Kakuta
%A R. Onai
%A N. Ito
%T Research on Parallel Machine Architecture for Fifth-Generation Computer Systems
%J Computer
%P 76 - 92
%Z Month June
%D 1985
%K ICOT,Delta,PIM-R,PIM-D
%A M. Murakami
%T A declarative semantics of parallel logic programs with perpetual processes
%J Proc.\ International Conference on Fifth Generation Computer Systems
%P 374--381
%C ICOT, Tokyo
%D 1988
%A A. Mycroft
%A N. D. Jones
%T A Relational Framework for Abstract Interpretation
%B Proc. of Programs as Data Objects, Copenhagen, Denmark
%S LNCS
%N 217
%I Springer-Verlag
%D 1985
%A L. Naish
%T All Solutions Predicates in Prolog
%I Department of Computer Science, University of Melbourne
%N 84/4
%D 1984
%A L. Naish
%T All solutions predicates in Prolog
%B 1985 Symposium on Logic programming
%I IEEE
%P 73-77
%Z Month July
%D 1985
%A L. Naish
%T Automatic generation of control for logic programs
%N 83/6
%I Dept. of Computer Science, University of Melbourne
%C Melbourne, Australia
%D 1983
%A L. Naish
%T MU-Prolog 3.1db Reference Manual
%I Internal Memorandum, Department of Computer Science, University of Melbourne
%D 1984
%A L. Naish
%T Negation and Control in Prolog
%I University of Melbourne
%D 1985
%A L. Naish
%T Negation and Control in Prolog
%S LNCS
%N 225
%I Springer-Verlag
%D 1986
%A L. Naish
%D 1986
%T Negation and quantifiers in NU-Prolog
%S Third International Conference on Logic Programming, London.
%P 624-634
%A Katsuhiko Nakamura
%T Associative concurrent evaluation of logic programs
%C Tokyo
%D 1984
%Z Month August
%I School of Science and Engineering Tokyo Denki University
%K garbage-collection,architecture
%A S. A. Naqvi
%T A logic for negation in database systems
%B wkshop
%E J. Minker
%C Washington, DC
%Z aug
%D 1986
%P 378--387
%A Sanjai Narain
%T LOG(F) : an optimal combination of logic programming, rewriting, and lazy
evaluation
%C Santa Monica, CA
%I Rand
%D 1988
%R The Rand paper series ; P-7437
%A Linda Ness
%T Reducing Linear Recursion to Transitive Closure
%I University of Texas at Austin, Department of Computer Sciences
%R TR-86-25
%K AA09 AI10
%D NOV 1986
%X shows how to deal with a recursively expressed logic program that
is designed to query a database
%A M. Newton
%A J. Watkins
%T The Combination of Logic and Objects for Knowledge
Representation
%J joop
%Y 1988
%V 1
%N 4
%P 7-10
%A V-L Nguyen
%A J-L Lassez
%T A Dual Problem to Least Fixed Points
%J Theoretical Computer Science
%V
%P 211-221
%I North-Holland
%D 1981
%A M. Nilsson
%A H. Tanaka
%T The art of building a parallel
logic programming system or from zero to full GHC in ten pages
%E E. Wada
%B Proc. Japanese Logic Programming Conference
%P 155--163
%C ICOT, Tokyo
%D 1987
%X Proceedings also to appear as Springer LNCS
%A M. Nilsson
%A H. Tanaka
%T A Flat GHC implementation for supercomputers
%E K. Bowen
%E R. A. Kowalski
%B 5\/$^{th}$ International Conference Symposium on Logic Programming
%P 1337--1350
%I MIT Press
%D 1988
%A M. Nilsson
%A H. Tanaka
%T Fleng Prolog --- The language which turns supercomputers into Prolog machines
%E E. Wada
%B Proc. Japanese Logic Programming Conference
%P 209--216
%C ICOT, Tokyo
%D 1986.
%X Proceedings also published as Springer LNCS 264
%A M. Nilsson
%A H. Tanaka
%T Massively parallel implementation
of Flat GHC on the connection machine
%J Proc.\ International Conference on Fifth Generation Computer Systems
%P 1031--1040
%C ICOT, Tokyo
%D 1988
%A N. Nilsson
%T Principles of Artificial Intelligence
%I Tioga
%D 1980
%A N. Nilsson
%T Problem Solving Techniques in Artificial Intelligence
%I McGraw Hill?
%D 1973?
%A U. Nilsson
%T Towards a Framework for the Abstract Interpretation of Logic Programs
%B Proc. of PLILP '88, Orleans, France
%S LNCS
%N 348
%I Springer-Verlag
%D 1989
%A N.D. North
%T A Denotational Definition of Prolog
%N NPL Report DITC 106/88
%I National Physical Laboratory
%C Teddington, Middlesex, U.K.
%D 1988
%A Michael J. O'Donnell
%T Equational Logic as a Programming Language
%I The MIT Press
%A M. Ohki
%A et al.
%T An object-oriented programming language
based on a parallel logic programming language KL1
%J ICOT Technical Report TR-222, Institute for New Generation
%J Computer Technology
%C Tokyo
%D 1987
%A Y. Okabe
%A S. Yajima
%T Parallel computational complexity of
logic programs and alternating turing machines
%J Proc.\ International Conference on Fifth Generation Computer Systems
%P 356--363
%C ICOT, Tokyo
%D 1988
%A D. Sz\" oke
%T Distributed Flat Concurrent Prolog on a Network Architecture
%R M.Sc.\ Thesis, Department of Computer Science,
%R The Weizmann Institute of Sciencei, Rehovot
%D 1987
%A A. Okumura
%A Y. Matsumoto
%T Parallel programming with layered streams
%J Proc.\ IEEE Symposium on Logic Programming
%P 224--231
%C San Francisco
%D 1987
%A R. Onai
%A M. Aso
%A H. Shimizu
%A K. Masuda
%A A. Matsumoto
%T Architecture of a Reduction-Based parallel Inference Machine: PIM-R
%J New Generation Computing
%V 3
%N 2
%P 197-228
%D 1985
%K parallel inference machine, reduction, prolog, concurrent prolog, or-parallel, and-parallel
%A Rikio Onai
%A Hajime Shimizu
%A Kanae Masuda
%A Moritoshi Aso
%T Analysis of Sequential Prolog Programs
%J Journal of Logic Programming
%V 3
%N 2
%P 119 - 141
%Z Month july
%D 1986
%A Rikio Onai
%T An approach to a parallel inference machine based .......
%C Tokyo
%D 1984
%Z Month August
%I Institute for New Generation Computer Technology ICOT
%K architecture,prolog,data-flow,PIM-F
%A Rikio Onai
%T The proposal for a prolog machine based on reduction
%D 1982
%Z Month December
%I ICOT
%N TM004
%K prolog,reduction,architecture
%A Ross Overbeek
%T ANL-WAM Synchronization Issues: An Overview
%T ECRC Workshop on Parallel Logic Programming Systems
%D 1987
%A R.A. O\'Keefe
%D 1985
%T On the treatment of cuts in Prolog source-level tools
%S IEEE Symposium on Logic Programming, Boston
%A Peter Padawitz
%T Computing in Horn clause theories
%I Springer-Verlag
%D 1988
%S EATCS monographs on theoretical computer science ; v. 16.
%A M. S. Paterson
%A M. N. Wegman
%T Linear unification
%J J. of Computer and System Sciences
%V 16
%D 1978
%P 158-167
%A E. Paz
%D 1986
%T Parsing Prolog traces using a DCG grammer
%I University of Sussex
%R CSRP-55
%A E. Paz
%D 1985
%T A System for generating explanations of Prolog program results
%I University of Sussex
%R CSRP-48
%A F. Pereira
%D 1981
%T Extraposition grammars
%J American J. Computational Linguistics
%V 7
%N 4
%P 243-256
%A F.C. Pereira
%A D.H. Warren
%D 1980
%T Definite Clause Grammars for language analysis - a survey of the formalism and a comparison with augmented transition networks
%J AI
%V 13
%P 231-278
%A F.C. N. Pereira
%A D.H. D. Warren
%D June 1983
%T Parsing as deduction
%S Proc 21st Annual Meeting ACL, June 1983, MIT.
%A L.M. Pereira
%A R. Nasr
%T Delta-Prolog: a distributed logic programming language
%J Proc.\ International Conference on Fifth Generation Computer Systems
%P 283--291
%C ICOT, Tokyo
%D 1984
%A L.M. Pereira
%A L. Monteiro
%A J. Cunha
%A J.N. Aparicio
%T Delta Prolog: a distributed backtracking extension with events
%B Third International Conference on Logic Programming
%E Ehud Shapiro
%C London
%P 69-83
%Z Month July
%D 1986
%K in the proceedings volume
%A L.M. Pereira
%D 1985
%T Rational debugging in logic programming
%R Departamento de Informatica, Universidade Nova de Lisboa
%A L. M. Pereira
%A A. Porto
%T Selective backtracking for logic programs
%J 5th conference on Automated Deduction, Les Arcs, France
%D 1980
%O l.r. 12/1
%A Luis Moniz Pereira
%A Roger Nasr
%T Delta-Prolog: a distributed logic programming language
%P 283-291
%D 1984
%Z Month November
%T Proc. Int. Conf. on Fifth Gen. Comp. Sys., ICOT84
%K parallel,concurrent,synchro,event
%A R. Picca
%A J. Bellone
%A J. Levy
%T Or-parallel And-interleaving execution of Concurrent Prolog
%I Technical Report CS87-07, Department of Computer Science,
%I The Weizmann Institute of Science
%C Rehovot
%D 1987
%A D. Plaisted
%T The Occur-Check Problem in Prolog
%B Proc. of 1984 Int'l. Symp. on Logic Programming, Atlantic City
%D 1984
%A D. A. Plaisted
%T The Occur-Check Problem in Prolog
%P 309-322
%J New Generation Computing
%V 2
%N 4
%D 1984
%A A. Pnueli
%T Applications of temporal logic to the
specification and verification of reactive systems: A survey of current
trends
%E J.W. de Bakker
%E W.P. de Roever
%E G. Rozenberg
%B Current Trends in Concurrency, Overviews and Tutorials
%S LNCS
%V 224
%P 510--584
%I Springer-Verlag
%D 1986
%A George H. Pollard
%T Parallel Execution of Horn Clause Programs
%I University of London, Imperial College
%D 1981
%I published by British Telecommunications
%A H. H. Porter, III
%T Earley Deduction
%N CS/E 86-002
%I Oregon Graduate Center
%C Beaverton, OR
%D 1985
%A Vaughn R. Pratt
%T The Competence/Performance Dichotomy in Programming
%B Proceedings of the 4th Annual ACM Symposium on Principles of Programming
Languages
%D 1976
%P 194-200
%A D. Prawitz
%T An Improved Proof Procedure
%J Theoria
%V 26
%D 1960
%A A.E. Prieditis
%A J. Mostow
%D 1987
%T PROLEARN: Towards a Prolog interpreter that learns
%R Rutgers ML-TR-13
%A H. Przymusinska
%A T. C. Przymusinski, T. C.
%T Weakly perfect model semantics for logic programs
%B Fifth Int'l Conf.\ Symp. on Logic Programming
%C Seattle
%P 1106--1120
%Y 1988
%A Przymusinski, T.
%T On the declarative semantics of deductive databases and logic programs
%B minkbk
%E J. Minker
%P Los Altos, CA
%I Morgan Kaufmann
%D 1988
%A T. Przymusinski
%T On the Declarative and Procedural Semantics of Logic Programs
%I Univ.\ of Texas at El Paso
%D 1987
%A T. C. Przymusinski
%T Every logic program has a natural stratification
and an iterated fixed point model
%B Eighth ACM Symposium on Principles of Database Systems
%Y 1989
%A T. C. Przymusinski
%T On the declarative semantics of deductive databases
and logic programs
%B mbook
%E J. Minker
%C Los Altos, CA
%I Morgan Kaufmann
%D 1988
%P 193--216
%A R. Ramakrishnan
%A A. Silberschatz
%T Annotations for distributed programming in logic
%J Conference Record 13\/$^{en}$ ACM
%J Symposium on Principles of Programming Languages
%P 255--262
%D 1986
%A R. Ramanujam
%A R. K. Shyamasunder
%T Implementation of logic programs as distributed processes
%C Bombay
%D 1984
%Z Month August
%I National Centre for Software Development and Computing Techniques
%K logic-programming
%A M. J. Ratcliffe
%A P. Robert
%T PEPSy: A Prolog for Parallel Processing
%I CRC
%N CA-17
%Z Month March
%D 1986
%A E. Reches
%A E. Gudes
%A E. Shapiro
%T Parallel access to a distributed database
and its implementation in Flat Concurrent Prolog
%R Technical Report CS88-11, Department of Computer Science,
%R The Weizmann Institute of Science
%C Rehovot
%D 1988
%A Reiter, R.
%T Deductive question answering in relational databases
%B Logic and Databases
%E Gallaire
%E Minker
%I Plenum Press
%C New York
%D 1978
%P 149--177
%A Reiter, R.
%T On closed world databases
%B Logic and Databases
%E Gallaire
%E Minker
%I Plenum Press
%C New York
%D 1978
%P 55--76
%A R. Reiter
%T Foundations for Knowledge-Based Systems
%Y 1986
%P 663-668
%B IFIP86??
%C ??
%A R. Reiter
%T Non-Monotonic Reasoning
%J arcs
%Y 1987
%V 2
%P 147-186
%A U. Reyle
%A W. Frey
%D 1983
%T A prolog implementation of Lexical functional grammar
%S IJCAI'83
%A Howard Rheingold
%T Tools for Thought
%I Prentice Hall
%D 1985
%A W. Richter
%A P. Aczel
%E J. E. Fenstad
%E P. G. Hinman
%T Generalized Recursion Theory
%B Generalized Recursion Theory, I
%I North-Holland
%C New York
%P 301--381
%Y 1974
%A G.A. Ringwood
%T PARLOG86 and the dining logicians
%J CACM
%V 31
%N 1
%P 10--25
%D 1988
%A G.A. Ringwood
%T Pattern-directed, Markovian, linear, guardedi
definite clause resolution
%I Department of Computing, Imperial College
%C London
%A Philippe Robert
%T An Emulator for the PEPSys Abstract Machine
%I CRC
%R 17
%Z Month April
%D 1987
%A J. A. Robinson
%T Fast Unification
%J Proc. of a Conference on Mechanincal Theorem Proving
%D 1976
%O l.r. 12/5
%A J.A. Robinson
%T Logic, Form and Function
%I eup
%Y 1979
%A J. A. Robinson
%T Logic: form and function
%I Edinburgh University Press.
%D 1979
%O l.r. 12/1
%A J.A. Robinson
%T Logic programming - Past, Present and Future
%P 107-124
%J New Generation Computing
%V 1
%D 1983
%A J.A. Robinson
%A E.E. Sibert
%T LOGLISP, an Alternative to PROLOG
%J mi
%V 10
%N ??
%P 399-419
%Y 1982
%A J.A. Robinson
%T A Machine-Oriented Logic Based on the Resolution Principle
%J jacm
%Y 1965
%V 12
%N 1
%P 23-41
%A J.A. Robinson
%T A Machine-Oriented Logic Based on the Resolution Principle
%P 23-41
%J JACM
%V 12
%N 1
%D 1965
%A K. Ross
%A R. W. Topor
%T Inferring Negative Information from Disjunctive Databases
%N 87/1
%I University of Melbourne
%Y 1987
%A K. A. Ross
%T A Procedural Semantics for Well-Founded Negation
in Logic Programs
%B Eighth ACM Symposium on Principles of Database Systems
%Y 1989
%A Walter L. Ruzzo
%T Tree-size bounded alternation
%J JCSS
%V 21
%N 2
%D 1980
%Z Oct., YEAR = 1980
%P 218--235
%A Boyer, R. S.
%A Moore, J. S.
%T A Sharing of Structure in Theorem Proving Programs
%J Machine Intelligence
%V 7
%P 101-116
%I Edinburgh University Press
%D 1972
%O l.r. 12/6
%A Conery, John S.
%T Parallel execution of logic programs
%C Boston
%I Kluwer Academic Publishers
%D 1987
%A Mellish, C. S.
%T An alternative to structure sharing in the implementation of a Prolog
interpreter
%J Logic Programming by Clark and Tarnlund
%D 1982
%O l.r. 12/5
%A G. Sabah
%T L'intelligence artificielle et le langage
%I Hermes
%C paris (France)
%Y 1988
%A S. Safra
%A E. Shapiro
%T Meta-interpreters for real
%J Information Processing 86
%P 271--278
%I North-Holland
%D 1986
%A S. Safra
%T Partial Evaluation of Concurrent Prolog and Its Implications
%R M.Sc.\ Thesis, Technical Report CS84-26,
%R Department of Computer Science, The Weizmann Institute of Science
%C Rehovot
%D 1986
%A Sagiv, Y.
%T A characterization of globally consistent databases and their
correct access paths
%J ACM Trans.\ on Database Systems
%V 8
%N 2
%Z June
%D YEAR = 1983
%P 266--286
%A P. Saint-Dizier
%D 1985
%T Handling quantifier scoping ambiguities in a semantic representation
of natural language sentences
%E Dahl & Saint-Dizier
%B Natural Language understanding and Logic Programming
%A V.A. Saraswat
%T A compiler of CP($\dnr$,$\mid$,\&) on top of Prolog
%R Technical Report CS-87-174, Carnegie-Mellon University
%D 1987
%A V.A. Saraswat
%T Concurrent Constraint Programming Languages
%R Ph.D.\ Thesis
%I Dept of Computer Science, Carnegie-Mellon University
%D 1988
%A V.A. Saraswat
%T The concurrent logic programming language CP:
Definition and operational semantics
%J Proc.\ ACM Symposium on Principles of Programming Languages
%P 49--63
%D 1987
%A V.A. Saraswat
%A D. Weinbaum
%A K. Kahn
%A E. Shapiro
%T Detecting stable properties of networks in concurrent logic programming
languages
%J Proc.\ ACM Conference on Principles of Distributed Computing
%D 1988
%A V.A. Saraswat
%T The language GHC: Operational semantics,
%T problems and relationship with CP\($\dnr$,$\mid$\)
%R Proc.\ IEEE Symposium on Logic Programming
%P 347--358
%C San Francisco
%D 1987
%A V.A. Saraswat
%T Partial correctness semantics for CP\($\dnr$,$ \mid$,\&\)
%J Proc.\ 5\/$^{th}$ Conference on Foundations of Software
%J Technology and Theoretical Computer Science
%S LNCS
%N 206
%P 347--368
%C New Delhi
%D 1985
%A V. A. Saraswat
%T Problems with Concurrent Prolog
%I Carnegie-Mellon University
%N CMU-CS-86-100
%Z Month January
%D 1986
%A V.A. Saraswat
%T A somewhat logical formulation of CLP
synchronization primitives
%E K. Bowen
%E R. A. Kowalski
%J Proc.\ 5\/$^{th}$ International Conference Symposium on Logic Programming
%P 1298--1314
%I MIT Press
%D 1988
%A M. Sato
%A et al.
%T KL1 Execution model for PIM Cluster with Shared Memory
%I The International Conference on Logic Programming
%B Proceedings, Melbourne, Australia
%P 339-355
%Z Month May
%D 1987
%A T. Sato
%A H. Tamaki
%D 1984
%T Transformational logic program synthesis
%S International Conference on Fifth Generation Computer Systems
%A J. D. Schlipf
%T Negation by Securable Failure in Logic Programming
%C Univ.\ of Cincinnati
%Z (manuscript)
%Y 1987
%A J. S. Schlipf
%T Choosing Inference Rules for Logic Programming
%I Univ.\ of Cincinnati
%Z (manuscript)
%Y 1988
%A David A. Schmidt
%A Jacek Leszczylowski
%T On Developing a Logic for Program Derivation and Verification
%I Iowa State University Computer Science Department
%R TR#86-16
%D NOV 1986
%A D. De Schreye
%A M. Bruynooghe
%T An Application of Abstract Interpretation in Source Level Program
Transformation
%B Proc. of PLILP '88, Orleans, France
%S LNCS
%N 348
%I Springer-Verlag
%D 1989
%A D. S. Scott
%T Data Types as Lattices
%J SIAM J. Comput.
%V 5
%N 3
%D 1976
%A H. Seki
%A H. Itoh
%T An Evaluation Method for Stratified Programs
under the Extended Closed World Assumption
%N TR--337
%I Institute for New Generation Computer Technology(ICOT)
%C Tokyo 108, Japan
%D 1988
%A H. Seki
%A K. Furukawa
%D 1986
%T Notes on transformation techniques for generate-and-test logic programs
%I ICOT
%R TM-0240
%A Shapiro, E.
%T Alternation and the Computational Complexity
of Logic Programs
%J Journal of Logic Programming
%V 1
%N 1
%D 1984
%P 19--23
%A E. Shapiro
%T Algorithmic Program Debugging
%I MIT Press,
%D 1983
%A E. Shapiro
%T Alternation and the computational complexity of logic programs
%J J.\ Logic Programming
%V 1
%N 1
%P 19--33
%D 1984
%A E. Shapiro
%T Concurrent Prolog: a Progress report
%I Weizmann Institute
%N CS-86-10
%Z Type=internal report
%Z Month April
%D 1986
%A E. Shapiro
%T Concurrent Prolog: A progress report
%J IEEE Computer
%V 19
%N 8
%P 44--58
%D 1986
%A E. Shapiro
%A C. Mierowsky
%T Fair, biased, and self-balancing merge operators:
Their specification and implementation in Concurrent Prolog
%J New Generation Computing
%V 2
%N 3
%P 221--240
%D 1984
%A E. Shapiro
%A W. Silverman
%A A. Houri
%A M. Hirsch
%T Logix, User Manual for Release 1.1
%I TheWeizmann Institute of Science
%D 1985
%A E. Shapiro
%S. Safra
%T Multiway merge with constant delay in Concurrent Prolog
%J New Generation Computing
%V 4
%N 2
%P 211--216
%D 986
%A E. Shapiro
%A A. Takeuchi
%T Object-oriented programming in Concurrent Prolog
%J New Generation Computing
%N 1
%V 1
%P 25--49
%D 1983
%A E. Shapiro
%T Or-parallel Prolog in Flat Concurrent Prolog,
%J ??
%A E. Shapiro
%T A subset of Concurrent Prolog and its interpreter
%R ICOT Technical Report TR-003, Institute for New Generation Computer
%R Technology
%C Tokyo
%D 1983
%A E. Shapiro
%T Systolic programming: A paradigm of parallel processing
%J Proc.\ International Conference on Fifth Generation Computer Systems
%P 458--471
%D 1984
%A Ehud Shapiro
%T The Bagel: A systolic concurrent prolog machine
%C Rehovot
%D 1983
%Z Month November
%I The Weizmann Institute of Science
%K Prolog,architecture,data_flow
%A K. Shen
%A D.H.D. Warren
%T A Simulation Study of the Argonne Model for OR-Parallel Execution of Prolog
%B Proceedings - 1987 Symposium on Logic Programming
%I The IEEE Computer Society Press
%P 54-68
%Z Month September
%D 1987
%A Kim Shen
%T An Investigation of the Argonne Model of OR-Parallel Prolog
%I University of Manchester
%Z Month November
%D 1986
%A Kish Shen
%T An Investigation of the Argonne Model of OR-Parallel Prolog
%I Dept of Comp. Science U. of Manchester
%R UMCS-87-1-1
%Z Month February
%D 1987
%A J. Shepherdson
%T Negation as Failure
%J J. Logic Programming
%V 1
%N 1
%D 1984
%A J. Shepherdson
%T Negation in Logic Programming
%B Foundations of Deductive Databases and Logic Programming
%E J. Minker
%I Morgan Kaufmann
%C Los Altos, CA
%P 19--88
%D 1988
%A J. C. Shepherdson
%T Negation as failure, II
%J Journal of Logic Programming
%V 2
%N 3
%D 1985
%P 185--202
%A Shigeki Shibayama
%A Kazuhide Iwata
%A Hiroshi Sakai
%T A Knowledge Base Architecture and its Experimental Hardware
%B IFIP TC-10 Working Conf. on Fifth Generation Computer Architecture
%I UMIST
%C Manchester
%Z Month July 15-18
%D 1985
%K Organization=Toshiba, Japan,
%A Noriyoshi Ito, K. Masuda, H. Shimizu
%T Parallel prolog machine based on the data flow model
%D 1983
%Z Month August
%N TR-035
%I ICOT
%K and,or
%A J. Shoenfield
%T Mathematical Logic
%I Addison-Wesley
%D 1967
%A R. E. Shostak
%T A Graph-Theoretic View of Resolution Theorem-Proving
%I Center for Research in Computing Technology, Harvard University
%D 1974
%X NOTE = Also available from CSL, SRI International, Menlo Park, CA
%A R. E. Shostak
%T Refutation Graphs
%J Artificial Intelligence
%V 7
%D 1976
%P 51--64
%A J. Siekmann
%A G. Wrightson
%T Automation of Reasoning I and II
%I Springer-Verlag
%D 1983
%A W. Silverman
%A M. Hirsch
%A A. Houri
%A E. Shapiro
%T The Logix system user manual, Version 1.21
%A Bruce Smith
%T Logic programming on an FFP machine
%P 11
%D 1984
%Z Month February
%B 84 Symp on logic programming
%K fp,ffp,reduction,functional
%A G. Smolka
%T Making Control and Data Flow in Logic Programs Explicit
%B Proc. of ACM Symp. on Lisp and Functional Programming, Austin, Texas
%D 1984
%A H. Sndergaard
%T An Application of Abstract Interpretation of Logic Programs: Occur
Check Reduction:
%B Proc. of ESOP '86, Saarbrcken
%S LNCS
%N 213
%I Springer-Verlag
%D 1986
%T From logic design to logic programming : theorem proving techniques and
P-functions
%A Dominique Snyers
%A Andre Thayse
%I Springer-Verlag
%D 1987.
%S LNCS
%N 271
%A Yukio Sohma
%A Ken Satoh
%A Koichi Kumon
%A Hideo Masuzawa
%A Akihiro Itashiki
%T A New Parallel Inference Mechanism Based on Sequential Processing
%B IFIP TC-10 Working Conf. on Fifth Generation Computer Architecture
%I UMIST
%C Manchester
%Z Month July 15-18
%D 1985
%K OR-parallelism, KABU WAKE method,PIM
Organization=Fujitsu,
%A L. Sombe
%T Inf\'erences non-classiques en Intelligence Artificielle
%B PRC-IA-88
%C Toulouse (France)
%Y 1988
%P 137-230
%A H. Sondergaard
%T An application of abstract interpretation of logic programs:
occur check reduction
%B Proc. ESOP 86
%E B. Robinet
%E R. Wilhelm
%I Springer
%S LNCS
%N 213
%D 1986
%P 327-338.
%A Ivo Spigel
%T PENPAL - A Programming Environment for Parallel Logic Programs
%I Dept. for the Study of Intelligent Systems, Zagreb
%Z Month august
%D 1987
%A E.P. Stabler
%D 1983
%T Deterministic and bottom-up parsing in Prolog
%S AAAI'83
%A R. J. Stanley
%T Finite state representations of context-free languages
%B Quarterly Prog. Rept. No. 76
%I MIT Res. Lab Elect.
%C Cambridge, MA
%D 1965
%P 276--279
%A L. Sterling
%A E. Shapiro
%T The Art of Prolog
%I mitp
%C cm
%Y 1986
%A L. Sterling
%A R.D. Beer
%D 1986
%T Incremental flavour-mixing of meta-interpreters for expert system construction
%S IEEE Symposium on Logic Programming, Salt Lake City
%A L.S. Sterling
%A E. Shapiro
%T The Art of Prolog
%I MIT Press
%D 1986
%A Leon Sterling
%A Mike Codish
%T Pressing For Parallelism: A Prolog Program made Concurrent
%J The Journal of Logic Programming
%V 3
%N 1
%P 75 - 92
%D 1986
%A L. Stockmeyer
%A U. Vishkin
%T Simulation of parallel random access machines by circuits
%J SIAM J. Comput.
%V 13
%N 2
%D 1984
%P 409--422
%A Mamoru Sugie
%A et al.
%T The Kernel Benchmarks for the Parallel Inference Machine (PIM)
%I Hitachi Central Research Laboratory
%Z Month August
%D 1986
%A N. Suzuki
%T Experience with specification and verification of
complex computer using Concurrent Prolog
%E D. H. D. Warren
%E M. van Caneghem
%B Logic Programming and Its Applications
%P 188--209
%I Ablex Pub.\ Co.,
%C New Jersey
%D 1986
%A Jean-Claude Syre
%T A review of computer architectures for functional and logic programming systems
%I CRC
%N CA-09
Type=Technical Report
%Z Month July
%D 1985
%A Jean Claude Syre
%A Harald Westphal
%T A Review of Parallel Models for Prolog
%I CRC
%N CA-07
%Z Month June
%D 1985
%A M. Ratcliffe, J.C. Syre
%T The PEPSys Parallel Logic Programming Language
%I ECRC
%T IJCAI
%C Milano, Italy
%Z Month August
%D 1987
%A Y. Takeda
%A H. Nakashima
%A K. Masuda
%A T. Chikayama
%A K. Taki
%T load balancing mechanism for large scale multiprocessor
systems and its implementation
%J Proc.\ International Conference on Fifth Generation Computer Systems
%P 978--986
%I ICOT
%C Tokyo
%D 1988
%A A. Takeuchi
%T Algorithmic debugging of GHC programs and its
%T implementation in GHC
%A A. Takeuchi
%A K. Furukawa
%T Bounded-buffer communication in Concurrent Prolog
%J New Generation Computing
%V 3
%N 2
%P 145--155
%D 1985
%A A. Takeuchi
%A H. Fujita
%D 1988
%T Competitive partial evaluation - Some remaining problems of partial evaluation
%J New Generation Computing
%V 6
%N 2-3
%P 259-278
%A A. Takeuchi
%A et al.
%T A description language with AND/OR
parallelism for concurrent systems and its stream-based realization
%R ICOT Technical Report TR-229, Institute for New Generation Computer
%R Technology
%C Tokyo
%D 1987
%A A. Takeuchi
%T How to solve it in Concurrent Prolog (unpublished note)
%D 1983
%A A. Takeuchi
%A K. Furukawa
%T Partial evaluation of Prolog
programs and its application to meta-programming
%J Information Processing 86
%P 415--420
%I North-Holland
%D 1986
%A A. Takeuchi
%A K. Furukawa
%D 1986
%T Partial evaluation of Prolog programs and its application to meta-programming
%S Information Processing-86
%E H.J. Kugler
%I Elsevier (North-Holland)
%A Akikazu Takeuchi
%A Koichi Furukawa
%T Parallel Logic Programming Languages
%B Third International Conference on Logic Programming
%E Ehud Shapiro
%C London
%P 242-254
%Z Month July
%D 1986
%A Kazuo Taki
%T The Parallel Software Research and Development Tool: Multi-PSI System
%I ICOT
%B France-Japan Artificial Intelligence and Computer Science Symposium
%P 365-381
%D 1986
%A H. Tamaki
%T A distributed unification scheme for systolic programs
%J Proc.\ International Conference on Parallel Processing
%P 552--559
%D 1985
%A H. Tamaki
%A T. Sato
%D 1984
%T Unfold/fold transformation of logic programs
%S 2nd International Conf. Logic Programming, Uppsala, Sweden
%A H. Tanaka
%A et al.
%T First annual report of the research on a
large scale knowledge information processing system
%R ICOT Technical Report, 1988 (Partly in Japanese)
%A Hidehiko Tanaka
%T A Parallel Inference Machine
%J IEEE Computer
%V 19
%N 5
%P 48,54
%Z Month may
%D 1986
%A J. Tanaka
%A K. Ueda
%A T. Miyazaki
%A A. Takeuchi
%A Y. Matsumoto,
%A K. Furukawa
%T Guarded Horn clauses and experiences with parallel logic programming
%J Proc.\ FJCC ACM
%P 948--954
%C Dallas
%D 1986
%A J. Tanaka
%T Meta-interpreters and reflective operations in GHC
%J Proc.\ International Conference on Fifth Generation Computer Systems
%P 774--783
%I ICOT
%C Tokyo
%D 1988
%A J. Tanaka
%T A simple programming system written in GHC and
its reflective operations
%R Proc.\ Japanese Logic Programming Conference
%P 143--149
%I ICOT
%C Tokyo
%D 1988
%A Keiji Hirata, Tsutomu Maruyama, Hidehiko Tanaka
%T Ground-Instance Sharing for Parallel Inference Machines
%I University of Tokyo
%B Fourth ICLP
%C Melbourne
%D 1987
%A A. Tarski
%T A Lattice Theoretical Fixpoint Theorem and Its Applications
%J Pacific J. Math
%V 5
%N 1955
%A H. Taylor
%T Localizing the GHC suspension test
%E K. Bowen
%E R.A. Kowalski
%B Proc.\ 5\/$^{th}$ International Conference Symposium on Logic Programming
%P 1257--1271
%I MIT Press
%D 1988
%A J. Taylor
%A B. du\0Boulay
%D 1987
%T Learning and using Prolog: An empirical investigation
%I University of Sussex
%R CSRP-90
%A J. Taylor
%A B. du\0Boulay
%D 1986
%T Studying novice programmers: Why they may find learning Prolog hard
%I University of Sussex
%R CSRP-60
%A J. Taylor
%A B. du\0Boulay
%D 1985
%T Why novices may find programming in Prolog hard
%I University of Sussex
%A S. Taylor
%A R. Shapiro
%T FCP: A summary of performance results
%E G. Fox
%B Proc.\ 3\/$^{rd}$ Conference on Hypercube Concurrent Computers and Applications
%P 1364--1373
%I ACM Press
%D 1988
%A S. Taylor
%A E. Shapiro
%T An improved parallel algorithm for Flat Concurrent Prolog
%J Technical Report CS88-09, Department of Computer Science,
%J The Weizmann Institute of Science, Rehovot
%D 1988
%A S. Taylor
%A E. Av-Ron
%A E. Shapiro
%T A layered method for process and code mapping
%J J.\ New Generation Computing
%V 5
%N 2
%D 1987
%A S. Taylor
%A A. Lowry
%A G.Q. Maguire Jr.
%A S.J. Stolfo
%T Logic Programming using Parallel Associative Operations
%D 1984
%Z Month February
%B International Symposium on Logic Programming
%C Atlantic City
%P 58-68
%K dado,unification,join,purge
%A S. Taylor
%A L. Hellerstein
%A S. Safra
%A E. Shapiro
%T Notes on the complexity of systolic programs
%J J.\ Parallel and Distributed Computing
%V 4
%N 3
%D 1987
%A S. Taylor
%A S. Safra
%A E. Shapiro
%T A Parallel Implementation of Flat Concurrent Prolog
%I Weizmann Institute of Science
%R CS87-04
%Z Month October
%D 1986
%A S. Taylor
%A S. Safra
%A E. Shapiro
%T A parallel implementation of Flat Concurrent Prolog
%J Parallel Programming
%V 15
%N 3
%P 245--275
%D 1987
%A S. Taylor
%T Parallel Logic Programming Techniques
%R Ph.D.\ Thesis, Department of Comptuer Science, The Weizmann Institute of
%R Science, Rehovot
%D 1988
%A Stephen Taylor
%T Prolog on the DADO machine
%D 1984
%Z Month March
%I Columbia University
%R Internal Report
%K logic,prolog,parallel
%A Tebra, H.
%T Optimistic And-Parallelism in Prolog
%I Lecture Notes in Computer Science
%B Parallel Architectures and Language Europe (PARLE)
%I de Bakker, J.W., Nijman, A.J. and Treleaven, P.C.
%P 420-431
%Z Month June
%D 1987
%K stream-parallelism, and-parallelism, precedence, validation
%A A. Thayse
%A P. Gribomont
%A G. Louis
%A D. Snyers
%A P. Wodon
%A P. Gochet
%A E. Gregoire
and E. Sanchez
%A P. Delsarte
%T Approche logique de l'Intelligence Artificielle --
De la logique a la programmation logique (tome 1)
%I Dunod
%C Paris (France)
%Y 1988
%A E. Tick
%T A performance comparison of And- and Or-parallel
logic programming architectures
%J ICOT Technical Report TR-421, Institute for New Generation Computer
%J Technology
%C Tokyo
%D 1988
%A P. Tinker
%A G. Lindstrom
%T A performance oriented design for OR parallel logic programming
%I The International Conference on Logic Programming
%B Proceedings, Melbourne, Australia
%P 601-615
%Z Month May
%D 1987
%A R. Topor
%A E. A. Sonenberg
%T On domain independent databases
%B mbook
%E J. Minker
%C Los Altos, CA
%I Morgan Kaufmann
%D 1988
%P 217--240
%A R. W. Topor
%A E. A. Sonenberg
%T On domain independent databases
%B minkbk
%E J. Minker
%P Los Altos, CA
%I Morgan Kaufmann
%D 1988
%A Rajiv Trehan
%T Object models in the committed choice non-deterministic logic languages
%A Paul Wilk
%A Michael Buckley
%I University of Edinburgh, Dept. of Artificial Intelligence
%D 1988
%R D.A.I. research paper ; no. 368.
%T A parallel chart parser for the committed choice non-deterministic (CCND)
logic languages
%A Rajiv Trehan
%A P.F. Wilk
%I University of Edinburgh, Dept. of Artificial Intelligence
%D 1988
%R D.A.I. research paper ; no. 366.
%A Richard James Treitel
%T Sequentialization of Logic Programs
%R STAN-CS-86-1135
%D NOV 1986
%I Stanford University Computer Science
%K AI10
%X 16 pages 15.00
%A E.D. Tribble
%A M.S. Miller
%A K. Kahn
%A D.G. Bobrow
%A C. Abbott
%T Channels: A generalization of streams
%E J.-L. Lassez
%B Proc.\ 4\/$^{th}$ International Conference of Logic Programming
%P 839--857
%I MIT Press
%D 1987
%A S-AA. T\"arnlund
%T Horn Clause Computability
%J BIT
%V 19
%D 1977
%A S. Uchida
%A K. Taki
%A K. Nakajima
%A A. Goto
%A T. Chikayama
%T Research and development of the parallel inference system in the
intermediate stage of the FGCS project
%J Proc.\ International Conference on Fifth Generation Computer Systems
%P 16--36
%I ICOT
%C Tokyo
%D 1988
%A Shunichi Uchida
%T Inference machine: from sequential to parallel
%P 410-416
%D 1983
%Z Month June
%I ACM
%T 10th Symp. on Comp. Architecture
%K inference,machine,ICOT,fgcs
%A K. Ueda
%A T. Chikayama
%T Concurrent Prolog compiler on top of Prolog
%J Proc.\ IEEE Symposium on Logic Programming
%P 119--126
%D 1985
%A K. Ueda
%T Concurrent Prolog re-examined
%R ICOT Technical Report TR-102, Institute for New
%R Generation Computer Technology
%C Tokyo
%D 1985
%A K. Ueda
%T Guarded Horn Clauses
%R Ph.D.\ Thesis,
%R Information Engineering Course, University of Tokyo
%C Tokyo
%D 1986
%A K. Ueda
%T Guarded Horn Clauses
%E E. Wada
%B Logic Programming
%S LNCS
%N 221
%P 168--179
%I Springer-Verlag,
%D 1986
%A K. Ueda
%T Guarded Horn Clauses: A parallel logic programming
%T language with the concept of a guard
%R ICOT Technical Report TR-208
%R Institute for New Generation Computer Technology
%C Tokyo
%D 1986
%A K. Ueda
%T Making exhaustive search programs deterministic
%R Part II, ICOT Technical Report TR-249, Institute for New Generation
%R Computer Technology
%C Tokyo
%D 1987
%A K. Ueda
%T Making exhaustive search programs deterministic
%J New Generation Computing
%V 5
%N 1
%P 29--44
%D 1987
%A K. Ueda
%A K. Furukawa
%T Transformation rules for GHC programs
%J Proc.\ International Conference on Fifth Generation Computer Systems
%P 582--591
%I ICOT, Tokyo
%D 1988
%A Kasunori Ueda
%A Takashi Shikayama
%T Efficient stream/array processing in logic programming languages
%P 317-326
%D 1984
%Z Month November
%T ICOT Conf. 84
%K stream, and,or,concurrent
%A Kazunori Ueda
%A Takashi Chikayama
%T Efficient Stream/Array Processing in Logic Programming Language
%D 1984
%Z Month April
%I ICOT
%N TR-065
%A Kazunori Ueda
%T Guarded Horn Clauses
%I ICOT
%N TR-103
%Z Month June
%D 1985
%A Kazunori Ueda
%T Guarded Horn Clauses
%I University of Tokyo
%Z Month March
%D 1986
%A J. D. Ullman
%Q Van Gelder, Allen
%T Efficient tests for top-down termination of logical rules
%J Journal of the ACM
%V 35
%P 345--373
%D 1988
%A J. D. Ullman
%T Implementation of logical query languages for databases
%J ACM Trans.\ on Database Systems
%V 10
%N 3
%Z Sep., YEAR = 1985
%P 289--321
%A J. D. Ullman
%Q Van Gelder, Allen
%T Parallel Complexity of Logical Query Programs
%R STAN--CS--85--1089
%I Dept. of Computer Science, Stanford University
%C Stanford, CA
%X (short version presented at 27th FOCS, Oct. 1986
%Z December, YEAR = 1985
%A J. D. Ullman
%T Principles of Database Systems
%I Computer Science Press
%P Rockville, MD
%D 1982
%A J. D. Ullman
%Q Van Gelder, Allen
%T Testing applicability of top-down capture rules
%R STAN--CS--85--1046
%I Dept. of Computer Science, Stanford University
%C Stanford, CA
%Z April, YEAR = 1985
%A Shinji Umeyama
%A Koichiro Tamura
%T A parallel execution model of logic programs
%P 349-355
%D 1983
%Z Month June
%I ACM
%B 10th Symp on Comp. Architecture
%K parallel,logic
%A Aho, A. V.
$A Ullman, J. D.
%T Universality of Data Retrieval Languages
%B 6th ACM Symp. on Principles of Programming Languages
%D 1979
%P 110--120
%A V.A.Saraswat
%T Merging many streams efficiently: The
importance of atomic commitment
%A L. G. Valiant
%A S. Skyum
%A S. Berkowitz
%A C. Rackoff
%T Fast parallel computation on polynomials using few processors
%J SIAM J. Computing
%V 12
%N 4
%Z Nov., YEAR = 1983
%P 641--644
%A M. van\0Someren
%A B. Wielinga
%A R. Winkels
%D 1987
%T What's wrong? Understanding Beginners problems with Prolog
%I Computer Science, University of Amsterdam
%R (Draft)
%A Vardi, Moshe
%T The complexity of relational query languages
%B 14th ACM Symposium on Theory of Computing
%D 1982
%P 137--145
%A Thomas Vasak
%A John Potter
%T Characterisation of Terminating Logic Programs
%P 140-147
%B International Symposium on Logic Programming
%I IEEE
%C Salt Lake City, Utah
%D 1986
%A P. Vasey
%T Qualified answers and their application to transformation
%E E. Shapiro
%B Proc.\ 3\/$^{rd}$ International Conference on Logic Programming
%S LNCS
%V 225
%P 425--432
%I Springer-Verlag
%D 1986
%A R. Venken
%A B. Demoen
%D 1988
%T A partial evaluation system for Prolog: some practical considerations
%J New Generation Computing
%V 6
%N 2-3
%P 279-290
%A Vieille, L.
%T Recursive axioms in deductive databases: various solutions
%N KB-6
%I European Computer-Industry Research Center
%C Munich, Germany
%D 1985
%A Paul J. Voda
%T Choices In, and Limitations Of, Logic Programming
%B Proceedings of the Third International Logic Programming Conference
%D 1986
%A Paul J. Voda
%T A View of Programming Languages as Symbiosis of Meaning and Computations
%J New Generation Computing
%V 3
%D 1985
%P 71-100
%A P. Wadler
%T How to replace failure by a list of successes
%J Conf. on Funct. Prog. Lang. and Comp. Architecture, Nancy
%D 1985
%O l.r. 11/19
%A C. Walinsky
%D 1988
%T CLP(Sigma*): Constraint Logic Programming with regular sets
%R Dartmouth College, NH.
%A A. Walker
%D 1983
%T Prolog/Ex1, an inference engine which explains both yes and no answers
%S IJCAI'83
%A A. Walker
%T Syllog: A Knowledge Based Data Management System
%R 034
INSTITUTION = Dept. of Computer Science, New York University
%D 1981
%A Mitchell Wand
%T A Semantic Algebra for Logic Programming
%I Indiana University Computer Science Department
%R TR 148
%D August 1983
%A D.H.D. Warren
%T An abstract Prolog instruction set
%R Technical Report 309
%R Artificial Intelligence Center, SRI International
%D 1983
%A D.H. D. Warren
%A F.C. N. Pereira
%D 1982
%T An efficient easily adaptable system for interpreting natural language queries
%J American J. Computational Linguistics
%V 8
%N 3-4
%P 110-122
%A D.H. D. Warren
%D 1981
%T Efficient processing of interactive relational database queries expressed in logic
%S Proc 7th International Conference Very Large Databases IEEE
%P 272-281
%A D. H. D. Warren
%T Or-parallel Execution Models of Prolog
%I DCS, University of Manchester
%B TAPSOFT 87, Joint Conference on Theory and Practice of Software Development
%C Pisa
%Z Month March
%D 1987
%A D.H.D. Warren
%T Parallel Execution of logic Programs
%B ECRC Workshop on Parallel Logic Programming Systems
%D 1987
%A D.H.D. Warren
%T The SRI Model for Or-Parallel Execution of Prolog. Abstract Design and Implementation Issues
%B Proceedings - 1987 Symposium on Logic Programming
%I The IEEE Computer Society Press
%P 46-53
%Z Month September
%D 1987
%A D.H.D. Warren
%T The SRI model for Or-parallel execution of
Prolog --- abstract design and implementation
%J Proc.\ IEEE Symposium on Logic Programming
%P 92--102
%C San Francisco
%D 1987
%A D. Weinbaum
%A E. Shapiro
%T Hardware description and simulation using Concurrent Prolog
%J Proc.\ CHDL '87
%P 9--27
%I Elsevier Science Publishing
%D 1987
%A H. Westphal
%A P. Robert
%A J. Chassin
%A J.-C. Syre
%T The PEPSys Model: Combining Backtracking, AND- and OR-parallelism
%B Proceedings - 1987 Symposium on Logic Programming
%I The IEEE Computer Society Press
%P 436-448
%Z Month September
%D 1987
%A A.N. Whitehead
%A B. Russell
%T Principia Mathematica
%X
EDITION = second
%I Cambridge University Press
%C London
%Y 1925
%A P.F. Wilk
%D 1986
%T PEST - Prolog Environment Support and Tools
%R AIAI-TR-15
%I AI Applications Institute, Edinburgh
%A P.F. Wilk
%D 1985
%T The production and evaluation of a set of Prolog benchmarks
%R (Draft)
%I AI Applications Institute, Edinburgh
%A P.F. Wilk
%T Prolog Benchmarking
%I Artificial Intelligence Applications Institute
%N AIAI - TR - 14
%Z Month Jan.
%D 1986
%A P.F. Wilk
%D 1984
%T Prolog benchmarking (Draft copy)
%I AI Applications Institute, Edinburgh
%R (Draft)
%A Michael J. Wise
%T EPILOG=PROLOG+Data Flow
%J SIGPLAN Notices
%V 17
%P 80-86
%D 1982
%O l.r. 12/1
%A Michael J. Wise
%T A parallel Prolog: the construction of a data driven model
%P 56-66
%D 1982
%Z Month August
%T ACM Conf. on LISP and functional programming
%K parallel,prolog
%A D.A. Wolfram
%A M.J. Maher
%A J-L. Lassez
%T A Unified Treatment of Resolution Strategies for Logic Programs
TB Proc. 2nd Int. Conf. on Logic Programming,Uppsala, Sweden
%D July 1984
%P 263-276
%A H. Xia
%A W. Giloi
%T A New Application of Abstract Interpretation in Prolog Programs:
Data Dependency Analysis
%B IFIP WG 10.1 Workshop on Concepts and Characteristics of Declarative Systems
%D 1988
%A Vardi, Moshe Y.
%T Querying logical databases
%B 4th PODS
%D 1985
%P 57--65
%A T. Yamaguchi
%A Y. Tezuka
%A O. Kakusho
%T Parallel Processing of Resolution
%B IJCAI85
%P 1178-1180
%Z Month August
%D 1985
%A R. Yang
%A H. Aiso
%T P-Prolog: a parallel logic language based on exclusive relation
%T Third International Conference on Logic Programming
%E Ehud Shapiro
%C London
%P 255-269
%Z Month July
%D 1986
%K in the proceedings volume
%A R. Yang
%T A Parallel Logic Programming Language and Its Implementation
%R Ph.D.\ Thesis, Keio University
%D 1986
%A Rong Yang
%A Hideo Aiso
%T Memory Management for Multiple Environments - Implementation of P-Prolog (1)
%I Yeio University
%Z Month January
%D 1987
%A Rong Yang
%T P-Prolog, a parallel logic programming language
%C Teaneck, N.J.
%I World Scientific
%D 1987.
%A Rong Yang
%T A Parallel Logic Programming Language and its Implementation
%I Yeio University
%Z Type=Thesis
%D 1986
%A Yannakakis, M.
%T Algorithms for acyclic database schemes
%B Proc. 7th Int. Conf. on Very Large Databases
%C Cannes, France
%Z MONTH = Sep.
%D 1981
%P 82--94
%A E. Yardeni
%A E. Shapiro
%T A type system for logic programs
%A Hiroshi Yasuhara
%A Kazuhiko Nitadori
%T ORBIT: A Parallel Computing Model of Prolog
%J New Generation Computing
%P 277 - 288
%D 1984
%Z Month July
%V 2
%I <OHMSHA and Springer-Verlag, Tokyo
%K architecture, multi processor, or-parallelism
%A C. Zaniolo
%T Object-Oriented Programming in Prolog
%B islp84
%C ac
%Y 1984
%P 265-270
%A J. Zhang
%A P.W. Grant
%D 1988
%T An automatic difference-list transformation algorithm for Prolog
%S ECAI-88, Munich
%P 320-325
%A Thomas Sj|land alf@sics.se or {mcvax,munnari,ukc,unido}!enea!sics.se!alf
--
Steve (really "D. E.") Stevenson steve@hubcap.clemson.edu
Department of Computer Science, (803)656-5880.mabell
Clemson University, Clemson, SC 29634-1906