4. LPAR 1993: St. Petersburg, Russia

• Hassan Aït-Kaci, Andreas Podelski:
  Entailment and Disentailment of Order-Sorted Feature Constraints. 1-18
  
• Grigoris Antoniou, Elmar Langetepe, Volker Sperschneider:
  Computing Extensions of Default Logic - Preliminary Report. 19-27
  
• Jonas Barklund, Johan Bevemyr:
  Prolog with Arrays and Bounded Quantifications. 28-39
  
• Peter Barth:
  Linear 0-1 Inequalities and Extended Clauses. 40-51
  
• Stefan Brüning:
  Search Space Pruning by Checking Dynamic Term Growth. 52-63
  
• Hiu Fai Chau:
  A Proof Search System for a Modal Substructural Logic Based on Labelled Deductive Systems. 65-75
  
• Anatoli N. Chebotarev, Marina K. Morokhobets:
  Consistency Checking of Automata Functional Specifications. 76-85
  
• Marc-Michel Corsini, Alain Griffault, Antoine Rauzy:
  Yet Another Application for Topie: Verification of Mutual Exclusion Algorithms. 86-97
  
• Andrew Davison:
  Parsing with DCG-terms. 98-109
  
• Uwe Egly:
  A First Order Resolution Calculus with Symmetries. 110-121
  
• Christian G. Fermüller, Gernot Salzer:
  Ordered Paramodulation and Resolution as Decision Procedure. 122-133
  
• Gilberto Filé, Sabina Rossi:
  Static Analysis of Prolog with Cut. 134-145
  
• Philippa Gardner:
  A New Type THeory for Representing Logics. 146-157
  
• Reiner Hähnle, Werner Kernig:
  Verification of Switch-Level Designs with Many-Valued Logic. 158-169
  
• M. Hibti, Henri Lombardi, Bruno Legeard:
  Deciding in HFS-Theory via Linear Integer Programming. 170-181
  
• Patricia M. Hill:
  The Completion of Typed Logic Programs and SLDNF-Resolution. 182-193
  
• Alistair Manning, Andrew Ireland, Alan Bundy:
  Incresing the Versatility of Heuristic Based Theorem Provers. 194-204
  
• Barton C. Massey, Evan Tick:
  Sequentialization of Parallel Logic Programs with Mode Analysis. 205-216
  
• Klaus Mayr:
  Refinements and Extensions of Model Elimination. 217-228
  
• Angelica Maria Kappel:
  Executable Specifications based on Dynamic Algebras. 229-240
  
• Hans de Nivelle:
  Generic Resolution in Propositional Modal Systems. 241-252
  
• Hans Jürgen Ohlbach:
  Optimized Translation of Multi Modal Logic into Predicate Logic. 253-264
  
• Sven Eric Panitz:
  Default Reasoning with a Constraint Resolution Principle. 265-276
  
• Anavai Ramesh, Neil V. Murray:
  Non-Clausal Deductive Techniques for Computing Prime Implicants and Prime Implicates. 277-288
  
• Manfred Schmidt-Schauß:
  Unification Under One-Sided Distributivity with a Multiplicative Unit. 289-300
  
• Rolf Socher-Ambrosius:
  Unification in Order-Sorted Logic With Term Declarations. 301-308
  
• Christine Solnon, Michel Rueher:
  Extracting Inheritance Hierarchies from Prolog Programs: A System Based on the Inference of Type Relations. 309-320
  
• Geoff Sutcliffe:
  A Comparison of Mechanisms for Avoiding Repetition of Subdeductions in Chain Formal Linear Deduction Systems. 321-332
  
• Gerd Wagner:
  Neutralization and Preemtion in Extended Logic Programs. 333-344
  
• Matthias Baaz, Christian G. Fermüller, Arie Ovrutcki, Richard Zach:
  MULTILOG: A System for Axiomatizing Many-valued Logics. 345-347
  
• Didier Galmiche, O. Hermann:
  SKIL: A System for Programming with Proofs. 348-350
  
• John Harrison, Laurent Théry:
  Reasoning About the Reals: The Marriage of HOL and Maple. 351-353
  
• Yexuan Gui, Mitsuhiro Okada:
  System Description of LAMBDALG - A Higher Order Algebraic Specification Language. 354-356
  
• Breanndán Ó Nualláin:
  Mixing metafor. 357-359
  
• Sergei Soloviev:
  A Complete Axiom System for Isomorphism of Types in Closed Categories. 360-371
  
• Peter Wegner:
  Reasoning, Modeling, and Component-Based Technology. 372-386