Automated Deduction - Cade-11: 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992. Proceedings (Lecture ... Computer Science / Lecture Notes in Artific)

"This volume contains the papers presented at the Eleventh International Conference on Automated Deduction (CADE-11) held in Saratoga Springs, NY, inJune 1992. A total of 136 papers were submitted for presentation by researchers from nearly 20 countries. Papers covered many topics including: resolution; term rewriting; natural deduction; theorem proving, in particular in algebra and geometry; parallel theoremprovers; unification theory; constraint solving; logic programing; verification; multivalued, temporal and nonclassical logics; non-monotonic reasoning; planning; proof theory; higher-order logics; and inductive theorem proving. Each submission was reviewed by at least three program committee members and 46 papers were selected for presentation and publication. This volume also contains short descriptions of 23 implementations of automated deduction systems. The volume opens with a keynote address by Larry Wos, winner of the first Herbrand Award for Distinguished Contributions to Automated Reasoning."--PUBLISHER'S WEBSITE The impossibility of the automation of logical reasoning....Pages 1-3 Automatic proofs in mathematical logic and analysis....Pages 4-19 Proving geometry statements of constructive type....Pages 20-34 The central variable strategy of str∔ve....Pages 35-49 Unification in the union of disjoint equational theories: Combining decision procedures....Pages 50-65 Reduction and unification in Lambda calculi with subtypes....Pages 66-78 A combinatory logic approach to higher-order E -unification (extended abstract)....Pages 79-93 Cycle unification....Pages 94-108 A parallel completion procedure for term rewriting systems....Pages 109-123 Grammar rewriting....Pages 124-138 Polynomial interpretations and the complexity of algorithms....Pages 139-147 Uniform traversal combinators: Definition, use and properties....Pages 148-162 Sorted unification using set constraints....Pages 163-177 An abstract view of sorted unification....Pages 178-192 Unification in order-sorted algebras with overloading....Pages 193-207 Puzzles and paradoxes....Pages 208-208 Experiments in automated deduction with condensed detachment....Pages 209-223 Caching and lemmaizing in model elimination theorem provers....Pages 224-238 LIM+ challenge problems by RUE hyper-resolution....Pages 239-252 Computing prime implicates incrementally....Pages 253-267 Linear-input subset analysis....Pages 268-280 Theoretical study of symmetries in propositional calculus and applications....Pages 281-294 Difference matching....Pages 295-309 Using middle-out reasoning to control the synthesis of tail-recursive programs....Pages 310-324 The use of proof plans to sum series....Pages 325-339 Disproving conjectures....Pages 340-354 An interval-based temporal logic in a multivalued setting....Pages 355-369 A normal form for first-order temporal formulae....Pages 370-384 Semantic entailment in non classical logics based on proofs found in classical logic....Pages 385-399 Embedding negation as failure into a model generation theorem prover....Pages 400-415 Automated correctness proofs of machine code programs for a commercial microprocessor....Pages 416-430 Proving the Chinese remainder theorem by the cover set induction....Pages 431-445 Automatic program optimization through proof transformation....Pages 446-460 Proof search theory and practice in the (former) USSR (Tentative)....Pages 461-461 Basic paramodulation and superposition....Pages 462-476 Theorem proving with ordering constrained clauses....Pages 477-491 The special-relation rules are incomplete....Pages 492-506 An improved method for adding equality to free variable semantic tableaux....Pages 507-521 Proof search in the intuitionistic sequent calculus....Pages 522-536 Implementing the meta-theory of deductive systems....Pages 537-551 Tactic-based theorem proving and knowledge-based forward chaining: An experiment with Nuprl and Ontic....Pages 552-566 Little theories....Pages 567-581 Some termination criteria for narrowing and E-narrowing....Pages 582-588 Decidable matching for convergent systems....Pages 589-602 Free sequentially in orthogonal order-sorted rewriting systems with constructors....Pages 603-617 Programming with equations: A framework for lazy parallel evaluation....Pages 618-632 A many sorted logic with possibly empty sorts....Pages 633-647 Theorem proving in non-standard logics based on the inverse method....Pages 648-662 One more logic with uncertainty and resolution principle for it....Pages 663-667 A natural deduction automated theorem proving system....Pages 668-672 Isabelle-91....Pages 673-676 The semantically guided linear deduction system....Pages 677-680 The Shunyata system....Pages 681-685 A geometry theorem prover for macintoshes....Pages 686-690 FRI: Failure-resistant induction in RRL....Pages 691-695 Herky: High performance rewriting in RRL....Pages 696-700 IMPS: System description....Pages 701-705 Proving equality theorems with hyper-linking....Pages 706-710 Xpnet: A graphical interface to proof nets with an efficient proof checker....Pages 711-715 &: Automated natural deduction....Pages 716-720 An overview of Frapps 2.0: A framework for resolution-based automated proof procedure systems....Pages 721-725 The GAZER theorem prover....Pages 726-730 ROO: A parallel theorem prover....Pages 731-734 RVF: An automated formal verification system....Pages 735-739 KPROP — An AND-parallel theorem prover for propositional logic implemented in KL1 system abstract....Pages 740-742 A report on ICL HOL....Pages 743-747 PVS: A prototype verification system....Pages 748-752 The KIV system: Systematic construction of verified software....Pages 753-757 The tableau-based theorem prover 3 T A P for multiple-valued logics....Pages 758-760 Analytica — A theorem prover in mathematica....Pages 761-765 The FAUST — prover....Pages 766-770 Eves system description....Pages 771-775 MGTP: A parallel theorem prover based on lazy model generation....Pages 776-780 Benchmark problems in which equality plays the major role....Pages 781-785 Computing transitivity tables: A challenge for automated theorem provers....Pages 786-790

This volume contains the papers presented at the Eleventh International Conference on Automated Deduction (CADE-11)
held in Saratoga Springs, NY, inJune 1992. A total of 136
papers were submitted for presentation by researchers from nearly 20 countries. Papers covered many topics including:
resolution; term rewriting; natural deduction; theorem proving, in particular in algebra and geometry; parallel theoremprovers; unification theory; constraint solving;
logic programing; verification; multivalued, temporal and nonclassical logics; non-monotonic reasoning; planning;
proof theory; higher-order logics; and inductive theorem proving. Each submission was reviewed by at least three program committee members and 46 papers were selected for presentation and publication. This volume also contains short descriptions of 23 implementations of automated deduction systems. The volume opens with a keynote address by Larry Wos, winner of the first Herbrand Award for Distinguished Contributions to Automated Reasoning.