(Enter summary)
Abstract: In this paper, we present a basic set of methods to guide a proof in
the Whelk logic program synthesis system. Starting from the methods
used in the Oyster/CL
A
M system, designed for a functional context, we
developed some proof "critics" to solve the cases in which those methods
are blocked in a relational context. The application of those methods and
proof critics is illustrated by an example, the delete predicate synthesis.
1 Introduction
In this paper, we present a basic set of methods... (Update)
Context of citations to this paper: More
...1993. 16] K. Marriott and H. Sondergaard. Difference list transformation for prolog. New Generation Computing, 11(2) 125 157, 1993. [17] U. Nilsson. Towards a methodology for the design of abstract machines for logic programming languages. The Journal of Logic Programming,...
...expressions 4 . Another remedy to rippling s poor behaviour on relational structures is the development of unblocking techniques [Lombart et al. 93] which let the rippling process guide most of a proof, but which come into action when it is blocked, to unblock it, using some...
Cited by: More
Rippling on Relational Structures - Vincent Lombart Yves (1994)
(Correct)
Logic Program Synthesis - Deville, Lau (1993)
(Correct)
Publications in Program Development - June Journal
(Correct)
Active bibliography (related documents): More All
0.3: Middle-Out Reasoning for Logic Program Synthesis - Kraan, Basin, Bundy (1993)
(Correct)
0.3: Logic Program Synthesis via Proof Planning - Kraan, Basin, Bundy (1993)
(Correct)
0.3: Relational Rippling: A General Approach - Bundy, Lombart (1995)
(Correct)
Similar documents based on text: More All
0.3: IsaWhelk: Whelk Interpreted in Isabelle - Basin (1994)
(Correct)
0.3: Consistency Techniques for Interprocedural Test Data Generation - Sy, Deville (2003)
(Correct)
0.2: Acceptance Driven Local Search and Evolutionary Algorithms - Poupaert, Deville (2001)
(Correct)
Related documents from co-citation: More All
2: Logic program synthesis via proof planning
- Kraan, Basin et al. - 1993
2: ACM Transactions on Programming Languages and Systems (context) - Bates, Constable et al. - 1985
2: Inductive Logic Programming
- Muggleton - 1992
BibTeX entry: (Update)
V. Lombart, G. Wiggins, and Y. Deville. Guiding synthesis proofs. In Proceedings of LOPSTR'93 http://citeseer.comp.nus.edu.sg/18427.html More
@misc{ lombart-guiding,
author = "V. Lombart and G. Wiggins and Y. Deville",
title = "Guiding synthesis proofs",
text = "V. Lombart, G. Wiggins, and Y. Deville. Guiding synthesis proofs. In Proceedings
of LOPSTR'93",
url = "citeseer.comp.nus.edu.sg/18427.html" }
Citations (may not include all citations):
505
Implementing Mathematics with the Nuprl Proof Development Sy..
- Constable, Allen et al. - 1986
392
A Computational Logic (context) - Boyer, Moore - 1979
226
The use of explicit plans to guide inductive proofs
- Bundy - 1988
168
Rippling: A heuristic for guiding inductive proofs
- Bundy, Stevens et al. - 1993
87
The Oyster-Clam system (context) - Bundy, van Harmelen et al. - 1990
30
The synthesis of logic programs from inductive proofs (context) - Bundy, Smaill et al. - 1990
17
Synthesis and transformation of logic programs in the Whelk .. (context) - Wiggins - 1992
5
Increasing the versatility of heuristic based theorem prover.. (context) - Manning, Ireland et al. - 1993
4
Synthesis and transformation of logic programs through const.. (context) - Wiggins, Bundy et al. - 1991
3
Computing Science Department (context) - Ahs, working et al. - 1993
Documents on the same site (http://www.info.ucl.ac.be/research/projects/FRISCO/logic_programming_publ.html): More
A Distributed Arc-Consistency Algorithm - Nguyen, Deville (1995)
(Correct)
Relational Rippling: A General Approach - Bundy, Lombart (1995)
(Correct)
Design, Implementation, and Evaluation of the.. - Van Hentenryck.. (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.