- 1984
- Yves Bekkers, Bernard Canet, Olivier Ridoux, Lucien Ungaro:
A Memory Management Machine for Prolog Interpreter. ICLP 1984: 343-353 - Pier Giorgio Bosco, G. Giandonato, Elio Giovannetti:
A Prolog System for the Verification of Concurrent Processes Against Temporal Logic Specifications. ICLP 1984: 219-229 - Krysia Broda, Steve Gregory:
Parlog for Discrete Event Simulation. ICLP 1984: 301-312 - Jim A. Crammond, C. D. F. Miller:
An Architecture for Parallel Logic Languages. ICLP 1984: 183-194 - Verónica Dahl:
On Gapping Grammars. ICLP 1984: 77-88 - Nachum Dershowitz, N. Alan Josephson:
Logic Programming by Completion. ICLP 1984: 313-320 - Maarten H. van Emden, John W. Lloyd:
A Logical Reconstruction of Prolog II. ICLP 1984: 35-40 - Lars-Henrik Erikson, Manny Rayner:
Incorporating Mutable Arrays into Logic Programming. ICLP 1984: 101-114 - Joseph A. Goguen, José Meseguer:
Equality, Types, Modules and Generics for Logic Programming. ICLP 1984: 115-125 - Hideki Hirakawa, Takashi Chikayama, Koichi Furukawa:
Eager and Lazy Enumerations in Concurrent Prolog. ICLP 1984: 89-100 - Anna-Lena Johansson:
Using Symmetry for the Derivation of Logic Programs. ICLP 1984: 243-251 - Péter Kacsuk:
A Highly Parallel Prolog Interpreter Based on the Generalized Data Flow Model. ICLP 1984: 195-205 - Laxmikant V. Kalé, David Scott Warren:
A Class of Architectures for a Prolog Machine. ICLP 1984: 171-182 - Jacob Levy:
A Unification Algorithm for Concurrent Prolog. ICLP 1984: 333-341 - Gary Lindstrom:
Or-Parallelism on Applicative Architectures. ICLP 1984: 159-170 - Alan Littleford:
A Mycin-Like Expert System in Prolog. ICLP 1984: 289-300 - Michael C. McCord:
Semantic Interpretation for the Epistle System. ICLP 1984: 65-76 - Miklós Szöts:
A Comparison of two Logic Programming Languages: A Case Study. ICLP 1984: 41-51 - Katsuhiko Nakamura:
Associative Concurrent Evaluation of Logic Programs. ICLP 1984: 321-331 - Martin Nilsson:
Prolog as a Tool for Optimizing Prolog Unifiers. ICLP 1984: 13-21 - Jean François Pique:
Drawing Trees and their Equations in Prolog. ICLP 1984: 23-33 - David A. Plaisted:
An Efficient Bug Location Algorithm. ICLP 1984: 151-157 - Gilles Berger-Sabbatel, W. Dang, Jean-Christophe Ianeselli, Gia Toan Nguyen:
Unification for a Prolog Data Base Machine. ICLP 1984: 207-217 - Yoav Shoam:
FAME:A Prolog Program that solves Problems in Combinatorics. ICLP 1984: 277-288 - Michel Sintzoff:
Bounded-Horizon Success-Complete Restriction of Inference Programs. ICLP 1984: 139-150 - Olga Stepánková, Petr Stepánek:
Computation Trees and Transformations of Logic Programs. ICLP 1984: 53-63 - Leon Sterling:
Logical Levels of Problem Solving. ICLP 1984: 231-242 - Huaimin Sun, Liguo Wang:
A Model Theory of Logic Programming Methodology. ICLP 1984: 253-262 - Shigeyuki Takagi, Toshio Yokoi, Shunichi Uchida, Toshiaki Kurokawa, Takashi Hattori, Takashi Chikayama, Kô Sakai, Junichiro Tsuji:
Overall design of SIMPOS. ICLP 1984: 1-12 - Hisao Tamaki, Taisuke Sato:
Unfold/Fold Transformation of Logic Programs. ICLP 1984: 127-138