Efficient Minimal Model Generation Using Branching Lemmas
暂无分享,去创建一个
[1] Mark E. Stickel. The Path-Indexing Method for Indexing Terms , 1989 .
[2] Hiroshi Fujita,et al. Implementing a model-generation based theorem prover MGTP in Java , 1998 .
[3] Krzysztof R. Apt,et al. Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[4] Wenjin Lu. Minimal Model Generation Based on E-hyper Tableaux , 1997, KI.
[5] Ryuzo Hasegawa,et al. New implementation technique for model generation theorem provers to solve constraint satisfaction problems , 1999 .
[6] François Bry,et al. Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux , 1996, TABLEAUX.
[7] Ilkka Niemelä. A Tableau Calculus for Minimal Model Reasoning , 1996, TABLEAUX.
[8] Neng-Fa Zhou. A Logic Programming Approach to Channel Routing , 1995, ICLP.
[9] Toby Walsh,et al. Automated Deduction—CADE-11 , 1992, Lecture Notes in Computer Science.
[10] Katsumi Inoue,et al. Embedding Negation as Failure into a Model Generation Theorem Prover , 1992, CADE.
[11] Geoff Sutcliffe,et al. The TPTP Problem Library , 1994, CADE.