Logic program synthesis by induction over Horn Clauses
We report on the implementation of a new induction scheme in the Whelk logic program synthesis and transformation system . The scheme is based on work by Feferman , and allows constructive proof by induction over the minimal Herbrand model of a set of Horn Clauses. This is an important addition to the Whelk system, because it admits reasoning about and synthesis from “real” logic programs, whereas previously the system was limited to induction over recursive data structures.
The contribution of this work is practical, in the extension of the synthesis capability of the Whelk program synthesis system. Theoretically, it is closely related to an extension of  (reported in ), where a similar induction scheme is used to synthesise logic programs which embody functions.
Full details of the extension and its implementation may be found in .
- 1.S. Feferman. Finitary inductively presented logics. In Logic Colloquium '88, pages 191–220, Amsterdam, 1989. North-Holland.Google Scholar
- 2.L. Fribourg. Extracting logic programs from proofs that use extended Prolog execution and induction. In Proceedings of Eighth International Conference on Logic Programming, pages 685–699. MIT Press, June 1990. Extended version in .Google Scholar
- 3.J.-M. Jacquet, editor. Constructing Logic Programs. Wiley, 1993.Google Scholar
- 4.A. J. Parkes. Generator induction for relational proofs, logic programming and reasoning about database systems. MSc dissertation, Dept. of Artificial Intelligence, Edinburgh, 1994.Google Scholar
- 5.G. A. Wiggins. Synthesis and transformation of logic programs in the Whelk proof development system. In K. R. Apt, editor, Proceedings of JICSLP-92, pages 351–368. M.I.T. Press, Cambridge, MA, 1992.Google Scholar