Abstract is missing.
- Soundness and Completeness of Partial Deductions for Well-Founded SemanticsHalina Przymusinska, Teodor C. Przymusinski, Hirohisa Seki. 1-12
- On Deductive Planning and the Frame ProblemSteffen Hölldobler. 13-29
- On Resolution in Fragments of Classical Linear LogicJames Harland, David J. Pym. 30-41
- A Procedure for Automatic Proof Nets ConstructionDidier Galmiche, Guy Perrier. 42-53
- Free Logic and Infinite Constraint NetworksJames Bowen, Dennis Bahler. 54-65
- Towards Probabilistic Knowledge BasesBeat Wüthrich. 66-77
- Two-Level Grammar: A Funtional/Logic Query Language for Database and Knowledge-Base SystemsBarrett R. Bryant, Aiqin Pan. 78-83
- Extending Deductive Database Languages by Embedded ImplicationsBurkhard Freitag. 84-95
- Controlling Redundancy in Large Search Spaces: Argonne-Style Theorem Proving Through the YearsEwing L. Lusk. 96-106
- Resolution for Many-Valued LogicsMatthias Baaz, Christian G. Fermüller. 107-118
- An Order Theory Resolution CalculusPeter Baumgartner. 119-130
- Application of Automated Deduction to the Search for Single Axioms for Exponent GroupsWilliam McCune, Larry Wos. 131-136
- Elementary Lower Bounds for th Length of RefutationsHai-Ping Ko, Mark E. Nadel. 137-147
- Shortening Proofs by Quantifier IntroductionUwe Egly. 148-159
- Reform Compilation for Nonlinear RecursionHåkan Millroth. 160-171
- Pruning Infinite Failure Branches in Programs with Occur-CheckUlrich Neumerkel. 172-177
- The Use of Planning Critics in Mechanizing Inductive ProofsAndrew Ireland. 178-189
- Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural DeductionMichel Parigot. 190-201
- Building Proofs by Analogy via the Curry-Horward IsomorphismThierry Boy de la Tour, Christoph Kreitz. 202-213
- On the Use of the Constructive Omega-Rule within Automated DeductionSiani Baker, Andrew Ireland, Alan Smaill. 214-225
- OR-Parallel Theorem Proving with Random CompetitionWolfgang Ertel. 226-237
- Parallel Computation of Multiple Sets-of_SupportChristian B. Suttner. 238-249
- Towards Using the Andorra Kernel Language for Industrial Real-Time ApplicationsBogumil Hausman. 250-260
- Unification in a Combination of Equational Theories with Shared Constants and its Application to Primal AlgebrasChristophe Ringeissen. 261-272
- Non-Clausal Resolution and Superposition with Selection and Redundancy CriteriaLeo Bachmair, Harald Ganzinger. 273-284
- Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting SystemsBernhard Gramlich. 285-296
- Consistency of Equational EnrichmentsValentin M. Antimirov, Anatoli Degtyarev. 293-402
- A Two Steps Semantics for Logic Programs with NegationMaurizio Gabbrielli, Giorgio Levi, Daniele Turi. 297-308
- Generalized Negation As Failure and Semantics of Normal Disjunctive Logic ProgramsChitta Baral. 309-319
- General Model Theoretic Semantics for Higher-Order Horn Logic ProgrammingMino Bai, Howard A. Blair. 320-331
- Disjunctive Deductive DatabasesJosé Alberto Fernández, Jack Minker. 332-356
- Netlog - A Concept Oriented Logic Programming LanguageAlexander V. Voinov. 357-368
- From the Past to the Future: Executing Temporal Logic ProgramsMichael Fisher, Richard Owens. 369-380
- Computing Induction AxiomsChristoph Walther. 381-392
- A Programming Logic for a Verified Structured Assembly LanguagePaul Curzon. 403-408
- The Unification of Infinite Sets of Terms and Its ApplicationsGernot Salzer. 409-420
- Unification in Order-Sorted Type TheoryMichael Kohlhase. 421-432
- Infinite, Canonical String Rewriting Systems Generated by CompletionAndrea Sattler-Klein. 433-444
- Spes: A System for Logic Program TransformationFrancis Alexandre, Khaled Bsaïes, Jean-Pierre Finance, Alain Quéré. 445-447
- Linear Objects: a Logic Framework for Open System ProgrammingJean-Marc Andreoli, Remo Pareschi. 448-450
- ISAR: An Interactive System for Algebraic Implementation ProofsBernhard Bauer, Rolf Hennicker. 451-453
- Mathpert: Computer Support for Learning Algebra, Trig, and CalculusMichael Beeson. 454-456
- MegaLog - A Platform for Developing Knowledge Base Management SystemsJorge B. Bocca, Michael Dahmen, Michael Freeston. 457-459
- SPIKE, an Automatic Theorem ProverAdel Bouhoula, Emmanuel Kounalis, Michaël Rusinowitch. 460-462
- An Application to Teaching in Logic Course of ATP Based Natural DeductionLi Dafa. 463-465
- A Generic Logic EnvironmentMark Dawson. 466-468
- ElipSys - A Parallel Programming System based on LogicMichel Dorochevsky, Liang-Liang Li, Mike Reeve, Kees Schuerman, André Véron. 469-471
- Opium - A High-level Debugging EnvironmentMireille Ducassé. 472-474
- An Inductive Theorem Prover Based on NarrowingUlrich Fraus, Heinrich Hußmann. 475-477
- A Cooperative Answering SystemTerry Gaasterland, Parke Godfrey, Jack Minker, Lev Novik. 478-480
- MIZ-PR: A Theorem Prover for Polymorphic and Recursive FunctionsJavier Leach, Susana Nieva. 481-483
- ProPre A Programming Language with ProofsPascal Manoury, Michel Parigot, Marianna Simonot. 484-486
- FRIENDLY-WAM: An Interactive Tool to Understand the Compilation of PROLOGJulio García Marrtín, Juan José Moreno-Navarro. 487-489
- SEPIA - a Bases for Prolog ExtensionsMicha Meier. 490-492
- The External Database in SICStus PrologHans Nilsson. 493-495
- The KCM System: Speeding-up Logic Programming through Hardware SupportJacques Noyé. 496-498
- Logican s WorkbenchIgor Romanenko. 499-500
- EUODHILOS: A General Reasoning System for a Variety of LogicsHajime Sawamura, Toshiro Minami, Kyoko Ohashi. 501-503
- The EKS-V1 SystemLaurent Vieille, Petra Bayer, Volker Küchenhoff, Alexandre Lefebvre, Rainer Manthey. 504-506
- CHIP and PropiaMark Wallace, Thierry Le Provost. 507-509