MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Towards a Systematic Approach to Representing Knowledge in Declarative Logic Programming (INVITED TALK)

Download:
Download as a PDF | Download as a PS
by Michael Gelfond
http://www.uni-koblenz.de/ag-ki/lpnmr97/INV_gelfond.ps
Add To MetaCart

Abstract:

"The only effective way to raise the confidence level of a program significantly is to give a proof of its correctness. But one should not first make the program and then prove its correctness, because then the requirement of providing the proof would only increase the poor programmer's burden. On the contrary: the programmer should let correctness proof and program grow hand in hand....If one first asks oneself what the structure of a convincing proof would be and, having found this, then construct a program satisfying this proof's requirements, then these correctness concerns turn out to be a very effective heuristic guidance." E. Dijkstra, The Humble Programmer The main goal of this talk is to present some recent results related to representing knowledge in declarative logic programming. We are looking for some insights into the ways to specify knowledge, to gradually transfer an initial specification into an executable logic program and to insure the correctness of this transformation. We hope that such insights will help to facilitate the construction of

Citations

66 Logic Programming: Systematic Program Development – Deville - 1990
13 Towards a theory of elaboration tolerance: logic programming approach – Gelfond, Przymusinska - 1996
7 Approximating general logic programs – Baral, Gelfond, et al. - 1993