Saumya K. Debray, Manuel V. Hermenegildo (Eds.): Logic Programming, Proceedings of the 1990 North American Conference, Austin, Texas, October 29 - November 1, 1990. MIT Press 1990, ISBN 0-262-54058-4

Semantics

• 
  Giorgio Levi, Maurizio Martelli, Catuscia Palamidessi: Failure and Success made Symmetric. 3-22
• 
  Paolo Mancarella, Dino Pedreschi, Marina Rondinelli, Marco Tagliatti: Algebraic Properties of a Class of Logic Programs. 23-39
• 
  Teodor C. Przymusinski: Stationary Semantics for Disjunctive Logic Programs and Deductive Databases. 40-59

Implementation I

• 
  Micha Meier: Compilation of Compound Terms in Prolog. 63-79
• 
  Zerksis D. Umrigar: Finding Advantageous Orders for Argument Unification for the Prolog WAM. 80-96
• 
  Shmuel Kliger, Ehud Y. Shapiro: From Decision Trees to Decision Graphs. 97-116

Constraints and their Applications

• 
  Donald A. Smith, Timothy J. Hickey: Partial Evaluation of a CLP Language. 119-138
• 
  Hayato Ohwada, Fumio Mizoguchi: A Constraint Logic Programming Approach for Maintaining Consistency in User-Interface Design. 139-153
• 
  Jean Jourdan, Raúl E. Valdés-Pérez: Constraint Logic Programming Applied to Hypothetical Reasoning in Chemistry. 154-172

Concurrency

• 
  Frank S. de Boer, Catuscia Palamidessi: Concurrent Logic Programming: Asynchronism and Language Comparison. 175-194
• 
  Jean-Marie Jacquet, Luís Monteiro: Comparative Semantics for a Parallel Contextual Logic Programming Language. 195-214
• 
  Christian Codognet, Philippe Codognet, Marc-Michel Corsini: Abstract Interpretation for Concurrent Logic Languages. 215-232

Databases

• 
  Yehoshua Sagiv: Is There Anything Better than Magic? 235-254
• 
  Shamim A. Naqvi, Francesca Rossi: Reasoning in Inconsistent Databases. 255-272
• 
  Yuan Liu: Null Values in Definite Programs. 273-288

Implementation II

• 
  Toshihiro Ozawa, Akira Hosoi, Akira Hattori: Generation Type Garbage Collection for Parallel Logic Languages. 291-305
• 
  Patrick Weemeeuw, Bart Demoen: A la Recherche de la Mémoire Perdue OR Memory Compaction for Shard Memory Multiprocessors. 306-320
• 
  Leon Alkalaj, Tomás Lang, Ehud Y. Shapiro: FCP Sequential Abstract Machine Characteristics for the Systems Development Workload. 321-339

Partial Evaluation

• 
  Kerima Benkerimi, John W. Lloyd: A Partial Evaluation Procedure for Logic Programs. 343-358
• 
  Michele Bugliesi, Evelina Lamma, Paola Mello: Partial Evaluation for Hierarchies of Logic Theories. 359-376
• 
  Dan Sahlin: The Mixtus Approach to Automatic Partial Evaluation of Full Prolog. 377-398

Constraints

• 
  Jim Cox, Ken McAloon, Carol Tretkoff: Computational Complexity and Constraint Logic Programming Languages. 401-415
• 
  Pierre Lim, Peter J. Stuckey: Meta Programming as Constraint Programming. 416-430
• 
  Vijay A. Saraswat, Kenneth M. Kahn, Jacob Levy: Janus: A step towards distributed constraint programming. 431-446

Theory

• 
  Maria Paola Bonacina, Jieh Hsiang: Operational and Denotational Semantics of Rewrite Programs. 449-464
• 
  Roland N. Bol: Towards More Efficient Loop Checks. 465-479
• 
  Sergio Greco, Domenico Saccà: Negative Logic Programs. 480-497

Program Analysis

• 
  Peter Van Roy, Alvin M. Despain: The Benefits of Global Dataflow Analysis for an Optimizing Prolog Compiler. 501-515
• 
  R. S. Kemp, Graem A. Ringwood: An Algebraic Framework for Abstract Interpretation of Definite Programs. 516-530
• 
  Kim Marriott, Harald Søndergaard: Analysis of Constraint Logic Programs. 531-547

Proof Theory

• 
  Richard Helm: On the Elimination of Redundant Derivations During Execution. 551-568
• 
  Bruce Spencer: Avoiding Duplicate Proofs. 569-584
• 
  James H. Andrews: The Logical Structure of Sequential Prolog. 585-602

Parallelism I

• 
  Gopal Gupta, Bharat Jayaraman: Optimizing And-Or Parallel Implementations. 605-623
• 
  Laxmikant V. Kalé, Balkrishna Ramkumar: Joining AND Parallel Solutions in AND/OR Parallel Systems. 624-641
• 
  Jim A. Crammond: Scheduling and Variable Assignment in the Parallel PARLOG Implementation. 642-657

Negation

• 
  Kim Marriott, Harald Søndergaard, Philip W. Dart: A Characterization of Non-Floundering Logic Programs. 661-680
• 
  Anthony J. Bonner, L. Thorne McCarty: Adding Negation-as-Failure to Intuitionistic Logic Programming. 681-703
• 
  Jorge Lobo: On Constructive Negation for Disjunctive Logic Programs. 704-718

Parallelism II

• 
  Bogumil Hausman: Handling Speculative Work in OR-Parallel Prolog: Evaluation Results. 721-736
• 
  Gopal Gupta, Bharat Jayaraman: On Criteria for Or-Parallel Execution Models of Logic Programs. 737-756
• 
  Khayri A. M. Ali, Roland Karlsson: The Muse Or-Parallel Prolog Model and its Performance. 757-776

Abstracts of Invited Lectures

• 
  Jon Barwise: Hyperproof: An Excursion in Situated Logic. 779-787
• 
  Andrea Corradini, Ugo Montanari: An Algebraic Semantics of Logic Programs as Structured Transition Systems. 788-812
• 
  Fernando C. N. Pereira: Prolog and Natural-Language Analysis: Into the Third Decade. 813-832

Abstracts of Advanced Tutorials

• 
  Andrzej Ciepielewski: Parallel Implementations of Prolog. 835
• 
  Uday S. Reddy: Types for Logic Programs. 836-840
• 
  Pascal Van Hentenryck: Constraint Logic Programming: From Theory to Applications. 841
• 
  Carlo Zaniolo: Deductive Database Systems: Applications and Programming. 842-845