ISBN: 9783540100096 - 5th conference on automated deduction: les arcs, france, july 8-11, 1980 (lecture notes in computer science, 87, band 87) (8 Ergebnisse)

Zustand: Very Good. *Price HAS BEEN REDUCED by 10% until Monday, Nov. 16 (weekend SALE item)* 396 pp., paperback, very good. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.…

Zustand: New.

Zustand: New. In English.

Zustand: As New. Unread book in perfect condition.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Using meta-theoretic reasoning to do algebra.- Generating contours of integration: An application of PROLOG in symbolic computing.- Using meta-level inference for selective application of multiple rewrite rules in algebraic manipulation.- Proofs as descriptions of computation.- Program synthesis from incomplete specifications.- A system for proving equivalences of recursive programs.- Variable elimination and chaining in a resolution-based prover for inequalities.- Decision procedures for some fragments of set theory.- Simplifying interpreted formulas.- Specification and verification of real-time, distributed systems using the theory of constraints.- Reasoning by plausible inference.- Logical support in a time-varying model.- An experiment with the Boyer-Moore theorem prover: A proof of the correctness of a simple parser of expressions.- An experiment with 'Edinburgh LCF'.- An approach to theorem proving on the basis of a typed lambda-calculus.- Adding dynamic paramodulation to rewrite algorithms.- Hyperparamodulation: A refinement of paramodulation.- The AFFIRM theorem prover: Proof forests and management of large proofs.- Data structures and control architecture for implementation of theorem-proving programs.- A note on resolution: How to get rid of factoring without loosing completeness.- Abstraction mappings in mechanical theorem proving.- Transforming matings into natural deduction proofs.- Analysis of dependencies to improve the behaviour of logic programs.- Selective backtracking for logic programs.- Canonical forms and unification.- Deciding unique termination of permutative rewriting systems: Choose your term algebra carefully.- How to prove algebraic inductive hypotheses without induction.- A complete, nonredundant algorithm for reversed skolemization.…

Broschiert Broschiert. Zustand: Gut. VII, 385 Seiten, Zust: Gutes Exemplar. Mit Vorbesitzereintrag. Seitenränder leicht gebräunt. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 646.…

Taschenbuch. Zustand: Neu. 5th Conference on Automated Deduction | Les Arcs, France, July 8-11, 1980 | Wolfgang Bibel (u. a.) | Taschenbuch | viii | Englisch | 1980 | Springer | EAN 9783540100096 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Zustand: gut. 1980. 5th Conference on Automated Deduction: Les Arcs, France, July 8-11, 1980 (Lecture Notes in Computer Science, 87, Band 87) In deutscher Sprache. pages.