3. LPAR 1992: St. Petersburg, Russia

Andrei Voronkov (Ed.): Logic Programming and Automated Reasoning,International Conference LPAR'92, St. Petersburg, Russia, July 15-20, 1992, Proceedings. Lecture Notes in Computer Science 624 Springer 1992, ISBN 3-540-55727-X BibTeX

@proceedings{DBLP:conf/lpar/1992,
  editor    = {Andrei Voronkov},
  title     = {Logic Programming and Automated Reasoning,International Conference
               LPAR'92, St. Petersburg, Russia, July 15-20, 1992, Proceedings},
  booktitle = {LPAR},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {624},
  year      = {1992},
  isbn      = {3-540-55727-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Semantics I

Halina Przymusinska, Teodor C. Przymusinski, Hirohisa Seki: Soundness and Completeness of Partial Deductions for Well-Founded Semantics. 1-12 BibTeX

Non-Resolution Theorem Proving I

Steffen Hölldobler: On Deductive Planning and the Frame Problem. 13-29 BibTeX
James Harland, David J. Pym: On Resolution in Fragments of Classical Linear Logic. 30-41 BibTeX
Didier Galmiche, Guy Perrier: A Procedure for Automatic Proof Nets Construction. 42-53 BibTeX

Constraints

James Bowen, Dennis Bahler: Free Logic and Infinite Constraint Networks. 54-65 BibTeX

Data Bases and Knowledge Bases

Beat Wüthrich: Towards Probabilistic Knowledge Bases. 66-77 BibTeX
Barrett R. Bryant, Aiqin Pan: Two-Level Grammar: A Funtional/Logic Query Language for Database and Knowledge-Base Systems. 78-83 BibTeX
Burkhard Freitag: Extending Deductive Database Languages by Embedded Implications. 84-95 BibTeX

Resolution Theorem Proving

Ewing L. Lusk: Controlling Redundancy in Large Search Spaces: Argonne-Style Theorem Proving Through the Years. 96-106 BibTeX
Matthias Baaz, Christian G. Fermüller: Resolution for Many-Valued Logics. 107-118 BibTeX
Peter Baumgartner: An Order Theory Resolution Calculus. 119-130 BibTeX
William McCune, Larry Wos: Application of Automated Deduction to the Search for Single Axioms for Exponent Groups. 131-136 BibTeX

Theorem Proving and Complexity

Hai-Ping Ko, Mark E. Nadel: Elementary Lower Bounds for th Length of Refutations. 137-147 BibTeX
Uwe Egly: Shortening Proofs by Quantifier Introduction. 148-159 BibTeX

Implementation Aspects

Håkan Millroth: Reform Compilation for Nonlinear Recursion. 160-171 BibTeX
Ulrich Neumerkel: Pruning Infinite Failure Branches in Programs with Occur-Check. 172-177 BibTeX

Logical Frameworks

Andrew Ireland: The Use of Planning Critics in Mechanizing Inductive Proofs. 178-189 BibTeX
Michel Parigot: Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction. 190-201 BibTeX
Thierry Boy de la Tour, Christoph Kreitz: Building Proofs by Analogy via the Curry-Horward Isomorphism. 202-213 BibTeX
Siani Baker, Andrew Ireland, Alan Smaill: On the Use of the Constructive Omega-Rule within Automated Deduction. 214-225 BibTeX

Parallel Theorem Proving and Logic Programming

Wolfgang Ertel: OR-Parallel Theorem Proving with Random Competition. 226-237 BibTeX
Christian B. Suttner: Parallel Computation of Multiple Sets-of_Support. 238-249 BibTeX
Bogumil Hausman: Towards Using the Andorra Kernel Language for Industrial Real-Time Applications. 250-260 BibTeX

Unification and Equality I

Christophe Ringeissen: Unification in a Combination of Equational Theories with Shared Constants and its Application to Primal Algebras. 261-272 BibTeX
Leo Bachmair, Harald Ganzinger: Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria. 273-284 BibTeX
Bernhard Gramlich: Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems. 285-296 BibTeX

Semantics II

Maurizio Gabbrielli, Giorgio Levi, Daniele Turi: A Two Steps Semantics for Logic Programs with Negation. 297-308 BibTeX
Chitta Baral: Generalized Negation As Failure and Semantics of Normal Disjunctive Logic Programs. 309-319 BibTeX
Mino Bai, Howard A. Blair: General Model Theoretic Semantics for Higher-Order Horn Logic Programming. 320-331 BibTeX

Extensions of Logic Programming

José Alberto Fernández, Jack Minker: Disjunctive Deductive Databases. 332-356 BibTeX
Alexander V. Voinov: Netlog - A Concept Oriented Logic Programming Language. 357-368 BibTeX
Michael Fisher, Richard Owens: From the Past to the Future: Executing Temporal Logic Programs. 369-380 BibTeX

Non-Resolution Theorem Proving II

Christoph Walther: Computing Induction Axioms. 381-392 BibTeX

Specification and Verification

Valentin M. Antimirov, Anatoli Degtyarev: Consistency of Equational Enrichments. 293-402 BibTeX
Paul Curzon: A Programming Logic for a Verified Structured Assembly Language. 403-408 BibTeX

Unification and Equality II

Gernot Salzer: The Unification of Infinite Sets of Terms and Its Applications. 409-420 BibTeX
Michael Kohlhase: Unification in Order-Sorted Type Theory. 421-432 BibTeX
Andrea Sattler-Klein: Infinite, Canonical String Rewriting Systems Generated by Completion. 433-444 BibTeX

System Descriptions

Francis Alexandre, Khaled Bsaïes, Jean-Pierre Finance, Alain Quéré: Spes: A System for Logic Program Transformation. 445-447 BibTeX
Jean-Marc Andreoli, Remo Pareschi: Linear Objects: a Logic Framework for Open System Programming. 448-450 BibTeX
Bernhard Bauer, Rolf Hennicker: ISAR: An Interactive System for Algebraic Implementation Proofs. 451-453 BibTeX
Michael Beeson: Mathpert: Computer Support for Learning Algebra, Trig, and Calculus. 454-456 BibTeX
Jorge B. Bocca, Michael Dahmen, Michael Freeston: MegaLog - A Platform for Developing Knowledge Base Management Systems. 457-459 BibTeX
Adel Bouhoula, Emmanuel Kounalis, Michaël Rusinowitch: SPIKE, an Automatic Theorem Prover. 460-462 BibTeX
Li Dafa: An Application to Teaching in Logic Course of ATP Based Natural Deduction. 463-465 BibTeX
Mark Dawson: A Generic Logic Environment. 466-468 BibTeX
Michel Dorochevsky, Liang-Liang Li, Mike Reeve, Kees Schuerman, André Véron: ElipSys - A Parallel Programming System based on Logic. 469-471 BibTeX
Mireille Ducassé: Opium - A High-level Debugging Environment. 472-474 BibTeX
Ulrich Fraus, Heinrich Hußmann: An Inductive Theorem Prover Based on Narrowing. 475-477 BibTeX
Terry Gaasterland, Parke Godfrey, Jack Minker, Lev Novik: A Cooperative Answering System. 478-480 BibTeX
Javier Leach, Susana Nieva: MIZ-PR: A Theorem Prover for Polymorphic and Recursive Functions. 481-483 BibTeX
Pascal Manoury, Michel Parigot, Marianna Simonot: ProPre A Programming Language with Proofs. 484-486 BibTeX
Julio García Marrtín, Juan José Moreno-Navarro: FRIENDLY-WAM: An Interactive Tool to Understand the Compilation of PROLOG. 487-489 BibTeX
Micha Meier: SEPIA - a Bases for Prolog Extensions. 490-492 BibTeX
Hans Nilsson: The External Database in SICStus Prolog. 493-495 BibTeX
Jacques Noyé: The KCM System: Speeding-up Logic Programming through Hardware Support. 496-498 BibTeX
Igor Romanenko: Logican's Workbench. 499-500 BibTeX
Hajime Sawamura, Toshiro Minami, Kyoko Ohashi: EUODHILOS: A General Reasoning System for a Variety of Logics. 501-503 BibTeX
Laurent Vieille, Petra Bayer, Volker Küchenhoff, Alexandre Lefebvre, Rainer Manthey: The EKS-V1 System. 504-506 BibTeX
Mark Wallace, Thierry Le Provost: CHIP and Propia. 507-509 BibTeX