+612 9045 4394
Logic Programming and Automated Reasoning : International Conference Lpar '92, St.Petersburg, Russia, July 15-20, 1992. Proceedings - Andrei Voronkov

Logic Programming and Automated Reasoning

International Conference Lpar '92, St.Petersburg, Russia, July 15-20, 1992. Proceedings

By: Andrei Voronkov (Editor)

Paperback Published: 1st July 1992
ISBN: 9783540557272
Number Of Pages: 516

Share This Book:


or 4 easy payments of $42.43 with Learn more
Ships in 5 to 9 business days

This volume contains the proceedings of LPAR '92, theinternational conference on logic programming and automatedreasoning held in St. Petersburg in July 1992. The aim ofthe conference was to bring together researchers from theRussian and the international logic programming and theoremproving communities.The topics of interest covered by papers inthe volumeinclude automated theorem proving, non-monotonic reasoning,applications of mathematical logic to computer science,deductive databases, implementation of declarative concepts,and programming in non-classical logics.LPAR '92 is the successor of the First and Second RussianConferences on Logic Programming held in 1990 and 1991,respectively, the proceedings of which were publishedinLNAI Vol. 592.

Soundness and Completeness of Partial Deductions for Well-Founded Semanticsp. 1
On Deductive Planning and the Frame Problemp. 13
On Resolution in Fragments of Classical Linear Logicp. 30
A Procedure for Automatic Proof Nets Constructionp. 42
Free Logic and Infinite Constraint Networksp. 54
Towards Probabilistic Knowledge Basesp. 66
Two-Level Grammar: A Functional/Logic Query Language for Database and Knowledge-Base Systemsp. 78
Extending Deductive Database Languages by Embedded Implicationsp. 84
Controlling Redundancy in Large Search Spaces: Argonne-Style Theorem Proving Through the Yearsp. 96
Resolution for Many-Valued Logicsp. 107
An Ordered Theory Resolution Calculusp. 119
Application of Automated Deduction to the Search for Single Axioms for Exponent Groupsp. 131
Elementary Lower Bounds for the Lengths of Refutationsp. 137
Shortening Proofs by Quantifier Introductionp. 148
Reform Compilation for Nonlinear Recursionp. 160
Pruning Infinite Failure Branches in Programs with Occur-Checkp. 172
The Use of Planning Critics in Mechanizing Inductive Proofsp. 178
[lambda][mu]-Calculus: An Algorithmic Interpretation of Classical Natural Deductionp. 190
Building Proofs by Analogy via the Curry-Howard Isomorphismp. 202
On the Use of the Constructive Omega-Rule Within Automated Deductionp. 214
OR-Parallel Theorem Proving with Random Competitionp. 226
Parallel Computation of Multiple Sets-of-Supportp. 238
Towards Using the Andorra Kernel Language for Industrial Real-Time Applicationsp. 250
Unification in a Combination of Equational Theories with Shared Constants and its Application to Primal Algebrasp. 261
Non-Clausal Resolution and Superposition with Selection and Redundancy Criteriap. 273
Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systemsp. 285
A Two Step Semantics for Logic Programs with Negationp. 297
Generalized Negation as Failure and Semantics of Normal Disjunctive Logic Programsp. 309
General Model Theoretic Semantics for Higher-Order Horn Logic Programmingp. 320
Disjunctive Deductive Databasesp. 332
Netlog - A Concept Oriented Logic Programming Languagep. 357
From the Past to the Future: Executing Temporal Logic Programsp. 369
Computing Induction Axiomsp. 381
Consistency of Equational Enrichmentsp. 393
A Programming Logic for a Verified Structured Assembly Languagep. 403
The Unification of Infinite Sets of Terms and its Applicationsp. 409
Unification in Order-Sorted Type Theoryp. 421
Infinite, Canonical String Rewriting Systems Generated by Completionp. 433
Spes: A System for Logic Program Transformationp. 445
Linear Objects: A Logic Framework for Open System Programmingp. 448
ISAR: An Interactive System for Algebraic Implementation Proofsp. 451
Mathpert: Computer Support for Learning Algebra, Trig and Calculusp. 454
MegaLog - A Platform for Developing Knowledge Base Management Systemsp. 457
SPIKE, an Automatic Theorem Proverp. 460
An Application to Teaching in Logic Course of ATP Based on Natural Deductionp. 463
A Generic Logic Environmentp. 466
ElipSys. A Parallel Programming System Based on Logicp. 469
Opium - A High Level Debugging Environmentp. 472
An Inductive Theorem Prover Based on Narrowingp. 475
A Cooperative Answering Systemp. 478
MIZ-PR: A Theorem Prover for Polymorphic and Recursive Functionsp. 481
ProPre. A Programming Language with Proofsp. 484
FRIENDLY-WAM: An Interactive Tool to Understand the Compilation of Prologp. 487
SEPIA: A Basis for Prolog Extensionsp. 490
The External Database in SICStus Prologp. 493
The KCM System: Speeding-up Logic Programming Through Hardware Supportp. 496
Logician's Workbenchp. 499
EUODHILOS: A General Reasoning System for a Variety of Logicsp. 501
The EKS-VI Systemp. 504
CHIP and Propiap. 507
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540557272
ISBN-10: 354055727X
Series: Lecture Notes in Computer Science / Lecture Notes in Artific
Audience: General
Format: Paperback
Language: English
Number Of Pages: 516
Published: 1st July 1992
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.72
Weight (kg): 0.74