Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Deductive Inference in Automatic Programming

In Chapter 2, we survey the use of deductive inference in automatic programming. Axiomatic specifications are expected to be complete and non-ambiguous, but are usually also quite lengthy and artificial. Deductive synthesis from axiomatic specifications can be classified into transformational synthesis, proofs-as-programs synthesis (or constructive synthesis), and schema-guided synthesis. We survey the achievements of deductive synthesis of LISP functions and Prolog predicates. [Pg.257]

See other pages where Deductive Inference in Automatic Programming is mentioned: [Pg.2]    [Pg.15]    [Pg.15]    [Pg.16]    [Pg.18]    [Pg.20]    [Pg.22]    [Pg.24]    [Pg.26]    [Pg.28]    [Pg.2]    [Pg.15]    [Pg.15]    [Pg.16]    [Pg.18]    [Pg.20]    [Pg.22]    [Pg.24]    [Pg.26]    [Pg.28]   


SEARCH



Automatic programming

Deductibles

Deduction

Deductive

Deductive inferences

Inference

Inferences deduction

© 2024 chempedia.info