8th International Conference on Automated Deduction

Language: English

Published by Springer Berlin Heidelberg, Springer Jul 1986, 1986

3540167803 / 9783540167808

  • Softcover
  • New
See all details

Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.

5-star seller

AbeBooks seller since January 11, 2012

View this seller's items
Softcover

Condition: New

£ 47.38

£ 19.78 shipping 
Ships from Germany to U.S.A.

Quantity: 2 available

Add to basket
Free 30-day returns

Item description from seller

This item is printed on demand - it takes 3-4 days longer - Neuware -Connections and higher-order logic.- Commutation, transformation, and termination.- Full-commutation and fair-termination in equational (and combined) term-rewriting systems.- An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations.- Proving termination of associative commutative rewriting systems by rewriting.- Relating resolution and algebraic completion for Horn logic.- A simple non-termination test for the Knuth-Bendix method.- A new formula for the execution of categorical combinators.- Proof by induction using test sets.- How to prove equivalence of term rewriting systems without induction.- Sufficient completeness, term rewriting systems and ¿anti-unification¿.- A new method for establishing refutational completeness in theorem proving.- A theory of diagnosis from first principles.- Some contributions to the logical analysis of circumscription.- Modal theorem proving.- Computational aspects of three-valued logic.- Resolution and quantified epistemic logics.- A commonsense theory of nonmonotonic reasoning.- Negative paramodulation.- The heuristics and experimental results of a new hyperparamodulation: HL-resolution.- ECR: An equality conditional resolution proof procedure.- Using narrowing to do isolation in symbolic equation solving ¿ an experiment in automated reasoning.- Formulation of induction formulas in verification of prolog programs.- Program verifier 'Tatzelwurm': Reasoning about systems systems of linear inequalities.- An interactive verification system based on dynamic logic.- What you always wanted to know about clause graph resolution.- Parallel theorem proving with connection graphs.- Theory links in semantic graphs.- Abstraction using generalization functions.- An improvement of deduction plans: Refutation plans.- Controlling deduction with proof condensation and heuristics.- Nested resolution.- Mechanizing constructive proofs.- Implementing number theory: An experiment with Nuprl.- Parallel algorithms for term matching.- Unification in combinations of collapse-free theories with disjoint sets of function symbols.- Combination of unification algorithms.- Unification in the data structure sets.- NP-completeness of the set unification and matching problems.- Matching with distributivity.- Unification in boolean rings.- Some relationships between unification, restricted unification, and matching.- A classification of many-sorted unification problems.- Unification in many-sorted equational theories.- Classes of first order formulas under various satisfiability definitions.- Diamond formulas in the dynamic logic of recursively enumerable programs.- A prolog machine.- A prolog technology theorem prover: Implementation by an extended prolog compiler.- Paths to high-performance automated theorem proving.- Purely functional implementation of a logic.- Causes for events: Their computation and applications.- How to clear a block: Plan formation in situational logic.- Deductive synthesis of sorting programs.- The TPS theorem proving system.- Trspec: A term rewriting based system for algebraic specifications.- Highly parallel inference machine.- Automatic theorem proving in the ISDV system.- The karlsruhe induction theorem proving system.- Overview of a theorem-prover for a computational logic.- GEO-prover ¿ A geometry theorem prover developed at UT.- The markgraf karl refutation procedure (MKRP).- The J-machine: Functional programming with combinators.- The illinois prover: A general purpose resolution theorem prover.- Theorem proving systems of the Formel project.- The passau RAP system: Prototyping algebraic specifications using conditional narrowing.- RRL: A rewrite rule laboratory.- A geometry theorem prover based on Buchberger's algorithm.- REVE a rewrite rule laboratory.- ITP at argonne national laboratory.- Autologic at university of victoria.-.…

Seller Inventory # 9783540167808

Title
8th International Conference on Automated Deduction
Author
Jörg H. Siekmann
Publisher
Springer Berlin Heidelberg, Springer Jul 1986
Publication year
1986
Condition
Neu
Binding
Taschenbuch
Language
English
ISBN 10
3540167803
ISBN 13
9783540167808
Item weight
1,077 grams
Dimensions
235x155x39 mm

BuchWeltWeit Ludwig Meier e.K.

Bergisch Gladbach, Germany

5-star seller

AbeBooks seller since January 11, 2012

Shipping rates from Germany to U.S.A.

Item5 to 15 business days5 to 15 business days
First item£ 19.78£ 19.78
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay
  • Bank Wire Transfer
  • Check
  • Paypal

Seller's business information

BuchWeltWeit Ludwig Meier e.K.

Germany