Abstract is missing.
- Entailment and Disentailment of Order-Sorted Feature ConstraintsHassan Aït-Kaci, Andreas Podelski. 1-18
- Computing Extensions of Default Logic - Preliminary ReportGrigoris Antoniou, Elmar Langetepe, Volker Sperschneider. 19-27
- Prolog with Arrays and Bounded QuantificationsJonas Barklund, Johan Bevemyr. 28-39
- Linear 0-1 Inequalities and Extended ClausesPeter Barth. 40-51
- Search Space Pruning by Checking Dynamic Term GrowthStefan Brüning. 52-63
- A Proof Search System for a Modal Substructural Logic Based on Labelled Deductive SystemsHiu Fai Chau. 65-75
- Consistency Checking of Automata Functional SpecificationsAnatoli N. Chebotarev, Marina K. Morokhobets. 76-85
- Yet Another Application for Topie: Verification of Mutual Exclusion AlgorithmsMarc-Michel Corsini, Alain Griffault, Antoine Rauzy. 86-97
- Parsing with DCG-termsAndrew Davison. 98-109
- A First Order Resolution Calculus with SymmetriesUwe Egly. 110-121
- Ordered Paramodulation and Resolution as Decision ProcedureChristian G. Fermüller, Gernot Salzer. 122-133
- Static Analysis of Prolog with CutGilberto Filé, Sabina Rossi. 134-145
- A New Type THeory for Representing LogicsPhilippa Gardner. 146-157
- Verification of Switch-Level Designs with Many-Valued LogicReiner Hähnle, Werner Kernig. 158-169
- Deciding in HFS-Theory via Linear Integer ProgrammingM. Hibti, Henri Lombardi, Bruno Legeard. 170-181
- The Completion of Typed Logic Programs and SLDNF-ResolutionPatricia M. Hill. 182-193
- Incresing the Versatility of Heuristic Based Theorem ProversAlistair Manning, Andrew Ireland, Alan Bundy. 194-204
- Sequentialization of Parallel Logic Programs with Mode AnalysisBarton C. Massey, Evan Tick. 205-216
- Refinements and Extensions of Model EliminationKlaus Mayr. 217-228
- Executable Specifications based on Dynamic AlgebrasAngelica Maria Kappel. 229-240
- Generic Resolution in Propositional Modal SystemsHans de Nivelle. 241-252
- Optimized Translation of Multi Modal Logic into Predicate LogicHans Jürgen Ohlbach. 253-264
- Default Reasoning with a Constraint Resolution PrincipleSven Eric Panitz. 265-276
- Non-Clausal Deductive Techniques for Computing Prime Implicants and Prime ImplicatesAnavai Ramesh, Neil V. Murray. 277-288
- Unification Under One-Sided Distributivity with a Multiplicative UnitManfred Schmidt-Schauß. 289-300
- Unification in Order-Sorted Logic With Term DeclarationsRolf Socher-Ambrosius. 301-308
- Extracting Inheritance Hierarchies from Prolog Programs: A System Based on the Inference of Type RelationsChristine Solnon, Michel Rueher. 309-320
- A Comparison of Mechanisms for Avoiding Repetition of Subdeductions in Chain Formal Linear Deduction SystemsGeoff Sutcliffe. 321-332
- Neutralization and Preemtion in Extended Logic ProgramsGerd Wagner. 333-344
- MULTILOG: A System for Axiomatizing Many-valued LogicsMatthias Baaz, Christian G. Fermüller, Arie Ovrutcki, Richard Zach. 345-347
- SKIL: A System for Programming with ProofsDidier Galmiche, O. Hermann. 348-350
- Reasoning About the Reals: The Marriage of HOL and MapleJohn Harrison, Laurent Théry. 351-353
- System Description of LAMBDALG - A Higher Order Algebraic Specification LanguageYexuan Gui, Mitsuhiro Okada. 354-356
- Mixing metaforBreanndán Ó Nualláin. 357-359
- A Complete Axiom System for Isomorphism of Types in Closed CategoriesSergei Soloviev. 360-371
- Reasoning, Modeling, and Component-Based TechnologyPeter Wegner. 372-386