Lemma generation for model elimination by combining top-down and bottom-up inference

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1999, Pages 4-9

  Fuchs, Marc ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY SEARCH; FORWARD REASONING; LEMMA GENERATIONS; PROOF SEARCH; SELF ADAPTIVE CONTROL; SUBGOALS; TOPDOWN;

EVOLUTIONARY ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 84880685683     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. O. Astrachan and D. Loveland. The Use of Lemmas in the Model Elimination Procedure. Journal of Automated Reasoning, 19(1):117-141,1997. (Pubitemid 127715766)
2. L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217-247,1994.
3. D. Fuchs. Cooperation of Top-Down and Bottom-Up Theorem Provers by Subgoal Clause Transfer. In Proceedings of AISC-98, pages 157-169. Springer, LNAI1476,1998.
4. M. Fuchs. An Evolutionary Approach for Combining Top-down and Bottom-up Proof Search. AR-Report AR-98-04,1998, Technische Universitat Munchen, Institut fur Informatik, 1998.
5. M. Fuchs. Relevancy-Based Lemma Selection for Model Elimination using Lazy Tableaux Enumeration. In Proceedings of ECAI-98, pages 346-350. John Wiley k Sons, Ltd., 1998.
6. J. Holland. Adaptation in natural and artificial systems. Ann Arbor: Univ. of Michigan Press, second edition, 1992.
7. J. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, 1992.
8. R. Letz, K. Mayr, and C. Goller. Controlled Integration of the Cut Rule into Connection Tableau Calculi. Journal of Automated Reasoning, 13:297-337,1994.
9. D. Loveland. Automated Theorem Proving: a Logical Basis. North-Holland, 1978.
10. D. Loveland, D. Reed, and D. Wilson. SATCHMORE: SATCHMO with RElevancy. Journal of Automated Reasoning, 14:325-351,1995.
11. M. Moser, O. Ibens, R. Letz, J. Steinbach, C. Goller, J. Schumann, and K. Mayr. The Model Elimination Provers SETHEO and E-SETHEO. Journal of Automated Reasoning, 18(2), 1997.
12. J. Schumann. Delta - a bottom-up preprocessor for top-down theorem provers. system abstract. In Proceedings of CADE-12, pages 774-777. Springer, LNAI 814,1994.
13. M. Stickel. A prolog technology theorem proven Implementation by an extended prolog compiler. Journal of Automated Reasoning, 4:353-380,1988.
14. M. Stickel. Upside-Down Meta-Interpretation of the Model Elimination Theorem-Proving Procedure for Deduction and Abduction. Journal of Automated Reasoning, 13:189-210,1994.
15. G. Sutcliffe, C. Suttner, and T. Yemenis. The TPTP Problem Library. In Proceedings of CADE-12, pages 252-266. LNAI 814,1994.