Deductive Composition of Astronomical Software from Subroutine Libraries
暂无分享,去创建一个
Michael R. Lowry | Ian Underwood | Mark E. Stickel | Richard J. Waldinger | Thomas Pressburger | R. Waldinger | M. Stickel | M. Lowry | T. Pressburger | Ian Underwood
[1] Ė. Kh. Tyugu,et al. Knowledge-Based Programming , 2004 .
[2] Douglas R. Smith,et al. KIDS: A Semiautomatic Program Development System , 1990, IEEE Trans. Software Eng..
[3] Michaël Rusinowitch,et al. Proving refutational completeness of theorem-proving strategies: the transfinite semantic tree method , 1991, JACM.
[4] Nachum Dershowitz,et al. Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[5] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[6] L. Wos,et al. Paramodulation and Theorem-Proving in First-Order Theories with Equality , 1983 .
[7] Nachum Dershowitz. Orderings for Term-Rewriting Systems , 1979, FOCS.
[8] Enn Tyugu,et al. Knowledge-Based Programming (Turing Institute Press Knowledge Engineering Tutorial Series) , 1988 .
[9] Jeannette M. Wing,et al. Specifications as Search Keys for Software Libraries , 1991, ICLP.
[10] Larry Wos,et al. Efficiency and Completeness of the Set of Support Strategy in Theorem Proving , 1965, JACM.
[11] Zohar Manna,et al. Fundamentals of Deductive Program Synthesis , 1992, IEEE Trans. Software Eng..
[12] Donald Michie,et al. Machine Intelligence 4 , 1970 .
[13] Robert S. Boyer,et al. A computational logic handbook , 1979, Perspectives in computing.