Krzysztof R. Apt (Ed.): Logic Programming, Proceedings of the Joint International Conference and Symposium on Logic Programming, November 1992. MIT Press 1992, ISBN 0-262-51064-2

Invited Talks

• 
  K. Mani Chandy, Carl Kesselman: The Derivation of Compositional Programs. 3-17
• 
  Judea Pearl: Empirical Semantics for Defeasible Databases. 18-20

Advanced Tutorials

• 
  Melvin Fitting: Many-Valued Semantics for Logic Programming. 23-24
• 
  Evan Tick: Advanced Tutorial: Concurrent Logic Programming. 25
• 
  Serge Abiteboul: Deductive and Object-Oriented Databases. 26-29
• 
  A. S. Troelstra: Tutorial on Linear Logic. 30-31
• 
  Ross A. Overbeek: Logic Programming and Genetic Sequence Analysis: a Tutorial. 32-34

Unification

• 
  Bruno Dumant: hecking the Soundness of Resolution Schemes. 37-51
• 
  Zhenyu Qian, Kang Wang: Higher-Order E-Unification for Arbitrary Theories. 52-66
• 
  Livio Colussi, Elena Marchiori: A Predicate Transformer for Unification. 67-81

Programming Languages Issues

• 
  Yann Rouzaud, Lan Nguyen-Phuong: Integrating Modes and Subtypes into a Prolog Type-Checker. 85-97
• 
  Jean-Marie Jacquet, Luís Monteiro: Communicating Clauses: Towards Synchronous Communication in Contextual Logic Programming. 98-112
• 
  Michele Bugliesi: A Declarative View of Inheritance in Logic Programming. 113-127

Verification I

• 
  Maurizio Gabbrielli, Giorgio Levi, Maria Chiara Meo: Observational Equivalences for Logic Programs. 131-145
• 
  James Harland: On Normal Forms and Equivalence for Logic Programs. 146-160
• 
  Gérard Ferrand, Pierre Deransart: Proof Method of Partial Correctness and Weak Completeness for Normal Logic Programs. 161-174

Functions and Equations

• 
  Gerd Große, Steffen Hölldobler, Josef Schneeberger, Ute Cornelia Sigmund, Michael Thielscher: Equational Logic Programming Actions, and Change. 177-191
• 
  Michael Hanus: On the Completeness of Residuation. 192-206
• 
  Herbert Kuchen, Francisco Javier López-Fraguas, Juan José Moreno-Navarro, Mario Rodríguez-Artalejo: Implementing a Lazy Functional Logic Language with Disequality Constraints. 207-221

Constraints

• 
  Hélène Kirchner, Christophe Ringeissen: A Constraint Solver in Finite Algebras and Its Combination with Unification Algorithms. 225-239
• 
  Gert Smolka, Ralf Treinen: Records for Logic Programming. 240-254
• 
  Margarida Mamede, Luís Monteiro: A Contraint Logic Programming Scheme for Taxonomic Reasoning. 255-269

Deductive Databases

• 
  Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan: Controlling the Search in Bottom-Up Evaluation. 273-287
• 
  David B. Kemp, Peter J. Stuckey, Divesh Srivastava: Query Restricted Bottom-Up Evaluation of Normal Logic Programs. 288-302
• 
  Fangqing Dong, Laks V. S. Lakshmanan: Deductive Databases with Incomplete Information. 303-317

Verification II

• 
  François Bronsard, T. K. Lakshman, Uday S. Reddy: A Framework of Directionality for Proving Termination of Logic Programs. 321-335
• 
  Gerhard Gröger, Lutz Plümer: Handling of Mutual Recursion in Automatic Termination Proofs for Logic Programs. 336-350
• 
  Geraint A. Wiggins: Synthesis and Transformation of Logic Programs in the Whelk Proof Development System. 351-365

Implementation I

• 
  William J. Older, John A. Rummell: An Incremental Garbage Collector for WAM-Based Prolog. 369-383
• 
  Salvador Abreu, Luís Moniz Pereira, Philippe Codognet: Improving Backward Execution in the Andorra Family of Languages. 384-398
• 
  David Gudeman, Koenraad De Bosschere, Saumya K. Debray: jc: An Efficient and Portable Sequential Implementation of Janus. 399-413

Negation I

• 
  Piero A. Bonatti: Autoepistemic Logics as a Unifying Framework for the Semantics of Logic Programs. 417-430
• 
  Laura Giordano, Nicola Olivetti: Negation as Failure in Intuitionistic Logic Programming. 431-445
• 
  V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel: The Stable Models of a Predicate Logic Program. 446-460

Concurrent Logic Programming

• 
  Frank S. de Boer, Catuscia Palamidessi: A Process Algebra of Concurrent Constraint Programming. 463-477
• 
  Andy King, Paul Soper: Schedule Analysis of Concurrent Logic programs. 478-492
• 
  R. Sundararajan, A. V. S. Sastry, Evan Tick: Variable Threadedness Analysis for Concurrent Logic Programs. 493-508

Meta and Higher-Order Programming

• 
  Bern Martens, Danny De Schreye: A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming. 511-525
• 
  Taisuke Sato: Meta-Programming through a Truth Predicate. 526-540
• 
  Juergen Haas, Bharat Jayaraman: Interactive Synthesis of Definite-Clause Grammars. 541-555

Negation II

• 
  Michael Gelfond, Vladimir Lifschitz: Representing Actions in Extended Logic Programming. 559-573
• 
  José Júlio Alferes, Luís Moniz Pereira: On Logic Program Semantics with Two Kinds of Negation. 574-588
• 
  Weidong Chen, David Scott Warren: A Goal-Oriented Approach to Computing Well Founded Semantics. 589-603

Linear Logic

• 
  Serenella Cerrito: Herbrand Methods in Sequent Calculi: Unification in LL. 607-621
• 
  Joshua S. Hodas: Specifying Filler-Gap Dependency Parsers in a Linear-Logic Programming Language. 622-636

Implementation II

• 
  Ta Chen, I. V. Ramakrishnan, R. Ramesh: Multistage Indexing Algorithms for Speeding Prolog Execution. 639-653
• 
  Saumya K. Debray, Sampath Kannan, Mukul Paithane: Weighted Decision Trees. 654-668

Abduction

• 
  Ken Satoh, Noboru Iwayama: A Query Evaluation Method for Abductive Logic Programming. 671-685
• 
  Marc Denecker, Danny De Schreye: SLDNFA: An Abductive Procedure for Normal Abductive Programs. 686-700

Implementation of Parallelism

• 
  Péter Szeredi: Exploiting Or-Parallelism in Optimisation Problems. 703-716
• 
  Kish Shen: Exploiting Dependent And-Parallelism in Prolog: The Dynamic Dependent And-Parallel Scheme (DDAS). 717-731

Program Analysis

• 
  Peter A. Bigot, Saumya K. Debray, Kim Marriott: Understanding Finiteness Analysis Using Abstract Interpretation. 735-749
• 
  Baudouin Le Charlier, Pascal Van Hentenryck: Reexecution in Abstract Interpretation of Prolog. 750-764
• 
  Nevin Heintze: Practical Aspects of Set Based Analysis. 765-779

Semantics

• 
  Antonio Brogi, Evelina Lamma, Paolo Mancarella, Paola Mello: Normal Logic Programs as Open Positive Programs. 783-797
• 
  Jürgen Dix: Classifying Semantics of Disjunctive Logic Programs. 798-812
• 
  Rachel Ben-Eliyahu, Rina Dechter: Propositional Sematics for Disjunctive Logic Programs. 813-827

Addendum

• 
  William J. Mitchell: The Logic of Architecture: Programming the Invention of Physical Artifacts. 831-846