Dale Miller (Ed.): Logic Programming, Proceedings of the 1993 International Symposium, Vancouver, British Columbia, Canada, October 26-29, 1993. MIT Press 1993, ISBN 0-262-63152-0

Invited Talks

• 
  Margaret A. Boden: The Logic of Creativity. 3-11
• 
  Krzysztof R. Apt: Declarative Programming in Prolog. 12-35
• 
  Gail E. Kaiser: MARVEL 3: 1: A Multi-User Software Development Environment. 36-39

Advanced Tutorials

• 
  Saumya K. Debray: Static Analysis of Logic Programs. 43-44
• 
  Luc De Raedt: A Brief Introduction to Inductive Logic Programming. 45-51
• 
  Hassan Aït-Kaci: An introduction to LIFE: Programming with Logic, Inheritance, Functions, and Equations. 52-68
• 
  Melvin Fitting: Metric Methods in the Semantics of Logic Programs. 69-71

Refereed Papers

• 
  Andrew D. Macdonald, Peter J. Stuckey, Roland H. C. Yap: Redundancy of Variables in CLP (R). 75-93
• 
  Gudjon Gudjonsson, William H. Winsborough: Update In Place: Overview of the Siva Project. 94-113
• 
  Michael Codish, Bart Demoen: Analysing Logic Programs Using `Prop'-ositional Logic Programs and a Magic Wand. 114-129
• 
  Maria J. García de la Banda, Manuel V. Hermenegildo, Kim Marriott: Independence in Constraint Logic Programs. 130-146
• 
  Marc Denecker, Danny De Schreye: Representing Incomplete Knowledge in Abductive Logic Programming. 147-163
• 
  Steffen Hölldobler, Michael Thielscher: Actions and Specificity. 164-180
• 
  Chitta Baral, Michael Gelfond, Olga Kosheleva: Approximating General Logic Programs. 181-198
• 
  Roland N. Bol, Lars Degerstedt: Tabulated Resolution for Well Founded Semantics. 199-219
• 
  James H. Andrews: A Logical Semantics for Depth-First Prolog with Ground Negation. 220-234
• 
  Frank Teusink: A Proof Procedure for Extended Logic Programs. 235-249
• 
  Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier: The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable. 250-265
• 
  Thomas Eiter, Georg Gottlob: Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics. 266-278
• 
  Naoki Kobayashi, Akinori Yonezawa: ACL - A Concurrent Linear Logic Programming Paradigm. 279-294
• 
  Jean-Marc Andreoli, Tiziana Castagnetti, Remo Pareschi: Abstract Interpretation of Linear Logic Programming. 295-314
• 
  Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten: Non-monotonic Concurrent Constraint Programming. 315-334
• 
  Sven-Olof Nyström, Bengt Jonsson: Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations. 335-352
• 
  Ewing L. Lusk, Shyam Mudambi, Ross A. Overbeek, Péter Szeredi: Applications of the Aurora Parallel Prolog System to Computational Molecular Biology. 353-369
• 
  Steve Gregory: Experiments with Speculative Parallelism in Parlog. 370-387
• 
  Bo-Ming Tong, Ho-Fung Leung: Concurrent Constraint Logic Programming On Massively Parallel SIMD Computers. 388-402
• 
  Raéd Yousef Sindaha: Branch-Level Scheduling in Aurora: The Dharma Scheduler. 403-419
• 
  Stefaan Decorte, Danny De Schreye, Massimo Fabris: Automatic Inference of Norms: A Missing Link in Automatic Termination Analysis. 420-436
• 
  Maria J. García de la Banda, Manuel V. Hermenegildo: A Practical Approach to the Global Analysis of CLP Programs. 437-455
• 
  Kjell Post, Allen Van Gelder, James Kerr: Deterministic Parsing of Languages with Dynamic Operators. 456-472
• 
  Matteo Baldoni, Laura Giordano, Alberto Martelli: A Multimodal Logic to Define Modules in Logic Programming. 473-487
• 
  Michael Kohlhase, Frank Pfenning: Unification in a Lambda-Calculus with Intersection Types. 488-505
• 
  Hassan Aït-Kaci, Andreas Podelski, Seth Copen Goldstein: Order-Sorted Feature Theory Unification. 506-524
• 
  Philippe Codognet, Daniel Diaz: Boolean Constraint Solving Using clp(FD). 525-539
• 
  Agostino Dovier, Gianfranco Rossi: Embedding extensional finite sets in CLP. 540-556
• 
  S. Sudarshan, Raghu Ramakrishnan: Optimizations of Bottom-Up Evaluation with Non-Ground Terms. 557-574
• 
  Sergio Greco, Domenico Saccà, Carlo Zaniolo: Dynamic Programming Optimization for Logic Queries with Aggregates. 575-589
• 
  S. Sudarshan, Divesh Srivastava, Raghu Ramakrishnan, Catriel Beeri: Extending the Well-Founded and Valid Semantics for Aggregation. 590-608
• 
  Fangqing Dong, Laks V. S. Lakshmanan: A Deductive Approach to Hypothetical Query Answering. 609-628

Poster Abstracts

• 
  Marc Kirschenbaum, Leon Sterling: Enhancement Structures for Proving Prolog Programs Correct. 631
• 
  D. Andre de Waal, John P. Gallagher: Logic Program Specialisation With Deletion of Useless Clauses. 632
• 
  Khaled Bsaïes: Automated Derivation of Efficient Logic Programs by Synthesizing Eureka Properties. 633
• 
  G. Aguzzi, U. Modigliani: Termination of Logic Programs via Equivalent Rewrite Systems. 634
• 
  Kirack Sohn: Relational Groundness Analysis for Logic Programs. 635
• 
  Maria Vargas-Vera, Wamberto Weber Vasconcelos, David Stuart Robertson: Building Large-Scale Prolog Programs using a Techniques Editing System. 636
• 
  Mauricio Osorio, Bharat Jayaraman: Subset Assertions and Negation As Failure. 637
• 
  A. Mora, J. Piris, María José Ramírez, Moreno Falaschi: A Prototype System for Equational Constructive Negation. 638
• 
  Joaquim Nunes Aparício: Assumption Set Semantics. 639
• 
  Jia-Huai You, Li-Yan Yuan: Contradiction Resolving for Extended Logic Programs and Default Theories. 640
• 
  Vladimir Lifschitz, Norman McCain, Hudson Turner: Automated Reasoning About Actions: A Logic Programming Approach. 641
• 
  Rachel Ben-Eliyahu: Back to the Future: Program Completion, Revisited. 642
• 
  Wlodzimierz Drabent: Completeness of SLDNF-Resolution for Non-Floundering Queries. 643
• 
  Howard C. Wasserman, Keitaro Yukawa, Zhizhang Shen: The Essential Inadequacy of Deductions in Logic Programming. 644
• 
  Luigi Palopoli, Carlo Zaniolo: Polynominal Time Computable Stable Models. 645
• 
  Esther D. Shilcrat: Id Est, A Logic Based Framework for Direct Manipulation Systems. 646
• 
  Ulf Nilsson: Goal-directed Bottom-up Evaluation of Normal Logic Programs. 647
• 
  Jiawei Han, Laks V. S. Lakshmanan: Evaluation of Regular Nonlinear Recursive Programs. 648
• 
  Vincent Berry, Philippe Ézéquel: Generating Goals and Their Use In Recursive Query Processing. 649
• 
  Hock Chuan Chan, Keng Siau: A Prolog-Based Definition of an Entity Relationship Language. 650
• 
  Monica D. Barback, Jorge Lobo: A Proof Procedure for Default Theories with Extensions. 651
• 
  Paul Tarau: An Efficient Specialization of the WAM for Continuation Passing Binary Programs. 652
• 
  Andreas Podelski, Peter Van Roy: The Beauty and the Beast Algorithm. 653
• 
  Roland Paterson-Jones, Peter T. Wood: Extending the WAM for HiLog. 654
• 
  Neng-Fa Zhou: On the Direct Parameter Passing Mechanism for Prolog Compilers. 655
• 
  Laurent Fribourg, Marcos Veloso Peixoto: Concurrent Constraint Automata. 656
• 
  María Alpuente, Moreno Falaschi, Germán Vidal: Incremental Equational Constraint Analyses. 657
• 
  B. McDonald, J. Xu, M. Epstein, E. Freeman: On the Denotational and Logical Semantics of CLP-Modules. 658
• 
  Gilles Pesant, Michel Boyer: Handling Quadratic Constraints through Geometry. 659
• 
  Greg Sidebottom: Optimizing Constraint Processing in CLP(FD). 660
• 
  Patrice Boizumault, Yan Delon, Laurent Péridy: Solving a real life exams problem using CHIP. 661
• 
  Bogumil Hausman: Turbo Erlang. 662
• 
  Wenfeng Li, Zheng Lin: A Distributed Parallel LP System. 663
• 
  Koenraad De Bosschere, Paul Tarau: Blackboard-based Extensions for Parallel Programming in BinProlog. 664
• 
  Ernesto Pimentel: L2||O2: A Concurrent Object-oriented Logic Language. 665
• 
  Maurizio Martelli, Alessandro Messora, Catuscia Palamidessi: Fixpoint Semantics of L-lambda. 666
• 
  Alain Hui-Bon-Hoa: An Intuitionistic Resolution Method for a Language Dealing with Scope Constraints. 667
• 
  Amy P. Felty: Definite Clause Grammars for Parsing Higher-Order Syntax. 668
• 
  Mehmet A. Orgun: The Soundness and Completeness of a Temporal Extension of Logic Programming. 669
• 
  Stefan Brüning, Steffen Hölldobler, Ute Cornelia Sigmund, Michael Thielscher, Josef Schneeberger: Disjunction In Resource-Oriented Deductive Planning. 670
• 
  Lidia Moreno, Manuel Palomar, Antonio Molina: The Incorporation of Logic Formalisms to Natural Language Through Logic Programming. 671
• 
  Silvia Takahashi, Frank S. K. Silbermann: Prolog Interpretation of A Functional-Logic Language. 672
• 
  Michael Hanus: Combining Lazy Narrowing and Normalization. 673
• 
  Bernd Meyer: Logic and the Structure of Space - Towards a Visual Logic for Spatial Reasoning. 674
• 
  Irene Pimenta Rodrigues, José Gabriel Lopes: Temporal Reasoning for Temporal Information Retrieval From Text. 675
• 
  Giorgio Delzanno, Maurizio Martelli: A Bottom-Up Characterization of Finite Success. 676
• 
  James Harland: On Goal-Directed Provability in Classical Logic. 677
• 
  Bruce Spencer: The Ordered Clause Restriction of Model Elimination and SLI Resolution. 678
• 
  Weidong Chen, Terrance Swift, David Scott Warren: Goal-Directed Evaluation of Well-Founded Sematics for XSB. 679
• 
  Zhenzhong Li: A pi-calculus Specification of Prolog. 680