7. ICLP 1990: Jerusalem, Israel

Concurrent Logic Languages

• Kazunori Ueda, Masao Morita: A New Implementation Technique for Flat GHC. 3-17
• Yu Inamura, Satoshi Onishi: A Detection Algorithm of Perpetual Suspension in KL1. 18-30
• Seif Haridi, Sverker Janson: Kernel Andorra Prolog and its Computation Model. 31-46

Architectures

• Mark Korsloot, Hans M. Mulder: Sequential Architecture Models for Prolog: A Performance Comparison. 49-67
• Arie Harsat, Ran Ginosar: An Extended RISC Methodology and its Application to FCP. 67-82
• Kenji Nishida, Yasunori Kimura, Akira Matsumoto, Atsuhiro Goto: Evaluation of MRB Garbage Collection on Parallel Logic Programming Architectures. 83-95

Logic Databases

• Oded Shmueli, Shalom Tsur: Incremental Re-evaluation of LDL Queries. 99-111
• Oded Shmueli, Shalom Tsur: Logical Diagnosis of LDL Programs. 112-129
• Ulrike Griefahn, Stefan Lüttringhaus: Top-Down Integrity Constraint Checking for Deductive Databases. 130-144

Implementation

• Vishv M. Malhotra: An Algorithm for Optimal Back-Striding in Prolog. 147-158
• Neng-Fa Zhou, Toshihisa Takagi, Kazuo Ushijima: A Matching Tree Oriented Abstract Machine for Prolog. 159-173
• Andrew Taylor: LIPS on a MIPS: Results from a Prolog Compiler for a RISC. 174-185

Constraints, Attribute Grammars

• Pascal Van Hentenryck: Incremental Constraint Satisfaction in Logic Programming. 189-202
• Jukka Paakki: A Logic-Based Modification of Attribute Grammars for Practical Compiler Writing. 203-217

Independent And-Parallelism

• Kalyan Muthukumar, Manuel V. Hermenegildo: The DCG, UDG, and MEL Methods for Automatic Compile-time Parallelization of Logic Programs for Independent And-parallelism. 221-236
• Manuel V. Hermenegildo, Francesca Rossi: Non-Strict Independent And-Parallelism. 237-252
• Manuel V. Hermenegildo, K. J. Greene: &-Prolog and its Performance: Exploiting Independent And-Parallelism. 253-268

And-Parallelism

• David M. Meyer, John S. Conery: Architected Failure Handling for AND-Parallel Logic Programs. 271-290
• Roberto Giacobazzi, Laura Ricci: Pipeline Optimizations in AND-Parallel Logic Programs. 291-305
• Antonio Brogi: AND-Parallelism without Shared Variables. 306-321

Parallel Systems and Algorithms

• Pier Giorgio Bosco, C. Cecchi, Corrado Moiso, M. Porta, G. Sofi: Logic and Functional Programmin on Distributed Memory Architectures. 325-339
• T. J. Reynolds, Petros Kefalas: OR-Parallel Prolog and Search Problems in AI Applications. 340-354
• Arthur L. Delcher, Simon Kasif: Efficient Parallel Term Matching and Anti-Unification. 355-369

Grammars, Program Mappings, Proof Constructions

• Remo Pareschi, Dale Miller: Extending Definite Clause Grammars with Scoping Constructs. 373-389
• A. John Power, Leon Sterling: A Notion of Map between Logic Programs. 390-404
• Hajime Sawamura, Toshiro Minami, Kaoru Yocota, Kyoko Ohashi: A Logic Programming Approach to Specifying Logics and Constructing Proofs. 405-424

Semantics

• Laura Giordano, Alberto Martelli: Generalized Stable Models, Truth Maintenance and Conflict Resolution. 427-441
• François Fages: A New Fixpoint Semantics for General Logic Programs Compared with the Well-Founded and the Stable Model Semantics. 441-458
• Teodor C. Przymusinski: Extended Stable Semantics for Normal and Disjunctive Programs. 459-477

Language Issues

• Luís Monteiro, António Porto: A Transformational View of Inheritance in Logic Programming. 481-494
• Jean-Marc Andreoli, Remo Pareschi: Linear Objects in a Logic Processes with Built-in Inheritance. 495-510
• Joshua S. Hodas, Dale Miller: Representing Objects in a Logic Programming Langueage with Scoping Constructs. 511-526

Higher-Order Logic, Abduction

• Yeh-Heng Sheng: HIFUNLOG : Logic Programming with Higher-order Relational Functions. 529-545
• Mantis H. M. Cheng, Maarten H. van Emden, B. E. Richards: On Warren's Method for Functional Programming in Logic. 546-560
• François Bry: Intensional Updates: Abduction via Deduction. 561-575

Negation

• Michael Gelfond, Vladimir Lifschitz: Logic Programs with Classical Negation. 579-597
• Robert A. Kowalski, Fariba Sadri: Logic Programs with Exceptions. 598-613

Program Termination

• Krzysztof R. Apt, Marc Bezem: Acyclic Programs. 617-633
• Lutz Plümer: Termination Proofs for Logic Programs Based on Predicate Inequalities. 634-648
• Danny De Schreye, Kristof Verschaetse, Maurice Bruynooghe: A Practical Technique for Detecting Non-terminating Queries for a Restricted Class of Horn Clauses, Using Directed, Weighted Graphs. 649-663

Program Synthesis and Optimization

• Kung-Kiu Lau, Steven David Prestwich: Top-down Synthesis of Recursive Logic Procedures from First-order Logic Specifications. 667-684
• Laurent Fribourg: Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction. 685-699
• Kristof Verschaetse, Danny De Schreye, Maurice Bruynooghe: Generation and Compilation of Efficient Computation Rules. 700-714

Program Analysis and Transformation

• Dean Jacobs, Anno Langen, William H. Winsborough: Multiple Specialization of Logic Programs with Run-Time Test. 717-731
• John P. Gallagher, Maurice Bruynooghe: The Derivation of an Algorithm for Program Specialisation. 732-746
• Anne Mulkers, William H. Winsborough, Maurice Bruynooghe: Analysis of Shared Data Structures for Compile-Time Garbage. 747-762

Abstracts of Invited Lectures

• Raymond Reiter: What Should a Database Know? 765
• Alain Colmerauer: Prolog III as it Actually Is. 766
• Moshe Y. Vardi: Global Optimization Problems for Database Logic Programs. 767-771
• David Harel: How Hard Is It to Reason about Propositional Programs? 772-773

Abstracts of Advanced Tutorials

• Vijay A. Saraswat: The Paradigm of Concurrent Constraint Programming. 777-778
• Haim Gaifman: Semantics of Logic Programs. 779-782
• Catriel Beeri: Logic Programming and Databases. 783
• Dale Miller: Higher-Order Logic Programming. 784
• Jacques Chassin de Kergommeaux: Parallel Logic Programming Systems. 785
• Frank Pfenning: Types in Logic Programming. 786