5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980 [electronic resource] /
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.
Main Authors: | , , |
---|---|
Format: | Texto biblioteca |
Language: | eng |
Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg,
1980
|
Subjects: | Mathematics., Mathematical logic., Mathematical Logic and Foundations., Mathematical Logic and Formal Languages., |
Online Access: | http://dx.doi.org/10.1007/3-540-10009-1 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
KOHA-OAI-TEST:209283 |
---|---|
record_format |
koha |
spelling |
KOHA-OAI-TEST:2092832018-07-30T23:40:55Z5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980 [electronic resource] / Bibel, Wolfgang. editor. Kowalski, Robert. editor. SpringerLink (Online service) textBerlin, Heidelberg : Springer Berlin Heidelberg,1980.engUsing 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.Mathematics.Mathematical logic.Mathematics.Mathematical Logic and Foundations.Mathematical Logic and Formal Languages.Springer eBookshttp://dx.doi.org/10.1007/3-540-10009-1URN:ISBN:9783540381402 |
institution |
COLPOS |
collection |
Koha |
country |
México |
countrycode |
MX |
component |
Bibliográfico |
access |
En linea En linea |
databasecode |
cat-colpos |
tag |
biblioteca |
region |
America del Norte |
libraryname |
Departamento de documentación y biblioteca de COLPOS |
language |
eng |
topic |
Mathematics. Mathematical logic. Mathematics. Mathematical Logic and Foundations. Mathematical Logic and Formal Languages. Mathematics. Mathematical logic. Mathematics. Mathematical Logic and Foundations. Mathematical Logic and Formal Languages. |
spellingShingle |
Mathematics. Mathematical logic. Mathematics. Mathematical Logic and Foundations. Mathematical Logic and Formal Languages. Mathematics. Mathematical logic. Mathematics. Mathematical Logic and Foundations. Mathematical Logic and Formal Languages. Bibel, Wolfgang. editor. Kowalski, Robert. editor. SpringerLink (Online service) 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980 [electronic resource] / |
description |
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. |
format |
Texto |
topic_facet |
Mathematics. Mathematical logic. Mathematics. Mathematical Logic and Foundations. Mathematical Logic and Formal Languages. |
author |
Bibel, Wolfgang. editor. Kowalski, Robert. editor. SpringerLink (Online service) |
author_facet |
Bibel, Wolfgang. editor. Kowalski, Robert. editor. SpringerLink (Online service) |
author_sort |
Bibel, Wolfgang. editor. |
title |
5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980 [electronic resource] / |
title_short |
5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980 [electronic resource] / |
title_full |
5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980 [electronic resource] / |
title_fullStr |
5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980 [electronic resource] / |
title_full_unstemmed |
5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980 [electronic resource] / |
title_sort |
5th conference on automated deduction les arcs, france, july 8–11, 1980 [electronic resource] / |
publisher |
Berlin, Heidelberg : Springer Berlin Heidelberg, |
publishDate |
1980 |
url |
http://dx.doi.org/10.1007/3-540-10009-1 |
work_keys_str_mv |
AT bibelwolfgangeditor 5thconferenceonautomateddeductionlesarcsfrancejuly8111980electronicresource AT kowalskiroberteditor 5thconferenceonautomateddeductionlesarcsfrancejuly8111980electronicresource AT springerlinkonlineservice 5thconferenceonautomateddeductionlesarcsfrancejuly8111980electronicresource |
_version_ |
1756268638097113088 |