A sequent-style model elimination strategy and a positive refinement
暂无分享,去创建一个
[1] David Alan Plaisted. Theorem proving and semantic trees. , 1976 .
[2] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.
[3] David A. Plaisted,et al. A Simplified Problem Reduction Format , 1982, Artif. Intell..
[4] Donald W. Loveland,et al. A Simplified Format for the Model Elimination Theorem-Proving Procedure , 1969, J. ACM.
[5] David A. Plaisted,et al. Non-Horn clause logic programming without contrapositives , 1988, Journal of Automated Reasoning.
[6] Donald W. Loveland,et al. Near-Horn PROLOG , 1987, ICLP.
[7] Jean H. Gallier,et al. Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .
[8] Donald W. Loveland,et al. Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.
[9] Mark E. Stickel,et al. A prolog technology theorem prover: Implementation by an extended prolog compiler , 1986, Journal of Automated Reasoning.
[10] William F. Clocksin,et al. Programming in Prolog , 1981, Springer Berlin Heidelberg.