Del i serien Lecture Notes in Computer Science

5th Conference on Automated Deduction

Les Arcs, France, July 8-11, 1980

Häftad, Engelska, 1980

AvWolfgang Bibel,R. Kowalski

719 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1980-06-01
Mått155 x 233 x 22 mm
Vikt610 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor388
Upplaga1980
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540100096

Tillhör följande kategorier

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.

Du kanske också är intresserad av

Wolfgang Bibel, P.H. Schmitt - Automated Deduction - A Basis for Applications Volume I Foundations - Calculi and Methods Volume II Systems and Implementation Techniques Volume III Applications, Häftad

Del 9

Automated Deduction - A Basis for Applications Volume I Foundations - Calculi and Methods Volume II Systems and Implementation Techniques Volume III Applications

Wolfgang Bibel, P.H. Schmitt

Häftad, 2010

2 869 kr

Fuzzy-Systems in Computer Science

Rudolf Kruse, Jörg Gebhardt, Rainer (Eds.) Palm, Wolfgang Bibel

Häftad, 2012

739 kr

Multiobjective Heuristic Search

Pallab Dasgupta, P. P. Chakrabarti, S. C. DeSarkar, Wolfgang Bibel

Häftad, 1999

749 kr

Del 10

Automated Deduction - A Basis for Applications Volume I Foundations - Calculi and Methods Volume II Systems and Implementation Techniques Volume III Applications

Wolfgang Bibel, P.H. Schmitt

Häftad, 2010

2 149 kr

Wissensrepräsentation und Inferenz

Wolfgang Bibel, Steffen Hölldobler, Torsten Schaub, Wolfgang Bibel

Häftad, 1993

809 kr

Automated Deduction - A Basis for Applications Volume I Foundations - Calculi and Methods Volume II Systems and Implementation Techniques Volume III Applications

Wolfgang Bibel, P.H. Schmitt

Häftad, 2010

2 869 kr

Grundlagen zur Neuroinformatik und Neurobiologie

Patricia S. Churchland, Terrence J. Sejnowski, Wolfgang Bibel

Häftad, 2012

1 079 kr

SAP R/3® Guide to EDI and Interfaces

Axel Angeli, Ulrich Streit, Robi Gonfalonieri, Wolfgang Bibel

Häftad, 2014

719 kr

Automated Theorem Proving

Wolfgang Bibel

Häftad, 1982

769 kr

Einführung in Evolutionäre Algorithmen

Volker Nissen, Wolfgang Bibel

Häftad, 1997

609 kr

Del i serien Lecture Notes in Computer Science

5th Conference on Automated Deduction

Les Arcs, France, July 8-11, 1980

Häftad, Engelska, 1980

AvWolfgang Bibel,R. Kowalski

719 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1980-06-01
Mått155 x 233 x 22 mm
Vikt610 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor388
Upplaga1980
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540100096

Tillhör följande kategorier

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.