Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


Middle-out reasoning for logic program synthesis

Basin, David A. and Kraan, Ina and Bundy, Alan

MPI-I-93-214. April 1993, 12 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
Logic programs can be synthesized as a by-product of the planning of
their verification proofs. This is achieved by using higher-order
variables at the proof planning level, which become instantiated in
the course of planning. We illustrate two uses of such variables in
proof planning for program synthesis, one for synthesis proper and one
for the selection of induction schemes. We demonstrate that the use of
these variables can be restricted naturally in such a way that terms
containing them form a tractable extension of first-order terms.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-93-214.pdfMPI-I-93-214.pdfMPI-I-93-214.dvi55 KBytes; 104 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Basin, David A. and Kraan, Ina and Bundy, Alan},
  TITLE = {Middle-out reasoning for logic program synthesis},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-93-214},
  MONTH = {April},
  YEAR = {1993},
  ISSN = {0946-011X},