Correctness of logic programs using proof schemes

The correctness of logic programs which are constructed by a schema-based method is presented in this paper. This schema-based method constructs typed, moded logic programs by stepwise top-down design using five program schemata, data types and modes. Correctness proofs in this approach are guided by the constructed logic programs. A proof scheme is proposed for each program schema. It is claimed that the structure of a logic program constructed by this schema-based method is reflected in the structure of its correctness proof. The proof schemes which correspond to design schemata are followed in the correctness proofs of logic programs.

[1]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[2]  Emmanouil I. Marakakis.  Guided Correctness Proofs of Logic Programs , 2005, Artificial Intelligence and Applications.

[3]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[4]  Anna-Lena Johansson.  Logic program synthesis using schema instantiation in an interactive environment , 1995 .

[5]  Paul A. Strooper,et al.  A refinement calculus for logic programs , 2002, Theory Pract. Log. Program..

[6]  John W. Lloyd,et al.  The Gödel programming language , 1994 .

[7]  John P. Gallagher,et al.  Schema-Based Top-Down Design of Logic Programs Using Abstract Data Types , 1994, LOPSTR.

[8]  Kung-Kiu Lau,et al.  Top-down Synthesis of Recursive Logic Procedures from First-order Logic Specifications , 1990, ICLP.

[9]  Εμμανουηλ Μαρακακησ.  LOGIC PROGRAM DEVELOPMENT BASED ON TYPED,MODED SCHEMATA AND DATA TYPES , 1997 .

[10]  Cliff B. Jones,et al.  Systematic software development using VDM , 1986, Prentice Hall International Series in Computer Science.

[11]  Yves Deville,et al.  Logic programming - systematic program development , 1990, International series in logic programming.

[12]  J. Michael Spivey,et al.  The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.

[13]  Yves Deville,et al.  Logic Program Synthesis from Incomplete Specifications , 1993, J. Symb. Comput..

[14]  Keith L. Clark.  Predicate logic as a computational formalism , 1979 .

[15]  Keith L. Clark,et al.  A First Order Theory of Data and Programs , 1977, IFIP Congress.

[16]  George Dayantis,et al.  Logic Program Derivation for a Class of First Order Logic Relations , 1987, IJCAI.

[17]  Wlodzimierz Drabent,et al.  Proving correctness and completeness of normal programs - a declarative approach , 2005, Theory Pract. Log. Program..

[18]  Annalisa Bossi,et al.  Verifying Correctness of Logic Programs , 1989, TAPSOFT, Vol.2.