Code Improvements for Model Elimination Based Reasoning Systems
暂无分享,去创建一个
[1] David Poole,et al. A Logical Framework for Default Reasoning , 1988, Artif. Intell..
[2] Abdul Sattar,et al. Improving Search in a Hypothetical Reasoning System , 2003, ACSC.
[3] Donald E. Knuth,et al. The Stanford GraphBase - a platform for combinatorial computing , 1993 .
[4] David Andre De Waal,et al. Analysis and transformation of proof procedures , 1994 .
[5] Mark E. Stickel. A prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler , 1986, CADE.
[6] Donald W. Loveland,et al. Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.
[7] John P. Gallagher,et al. The Applicability of Logic Program Analysis and Transformation to Theorem Proving , 1994, CADE.
[8] Donald W. Loveland,et al. A Simplified Format for the Model Elimination Theorem-Proving Procedure , 1969, J. ACM.
[9] Victor W. Marek,et al. Default Reasoning System DeReS , 1996, KR.
[10] Victor W. Marek,et al. Experimenting with Nonmonotonic Reasoning , 1995, ICLP.
[11] Mark E. Stickel,et al. Caching and Lemmaizing in Model Elimination Theorem Provers , 1992, CADE.
[12] Peter Baumgartner,et al. Model Elimination Without Contrapositives , 1994, CADE.
[13] Peter Baumgartner,et al. PROTEIN: A PROver with a Theory Extension INterface , 1994, CADE.
[14] Antonis C. Kakas,et al. Integrating Abductive and Constraint Logic Programming , 1995 .