leanCoP: Lean connection-based theorem proving

Journal of Symbolic Computation

Volumn 36, Issue 1-2, 2003, Pages 139-161

  Otten, Jens ^a   Bibel, Wolfgang ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30244551599     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(03)00037-3     Document Type: Article

References (29)

1. Argonne National Laboratory, Mathematics and Computer Science Division, 2000. Otter and MACE on TPTP v2.3.0. http://www-unix.mcs.anl.gov/AR/otter/tptp230.html.
2. Astrachan, O., Loveland, D., 1991. Meteors: high performance theorem provers using model elimination. In: Boyer, R. (Ed.), Automated Reasoning, Essays in Honour of Woody Bledsoe. Kluwer.
3. Baumgartner, P., Furbach, U., 1994. Model elimination without contrapositives. In: 12th CADE, LNAI, vol. 814. Springer, pp. 87-101.
4. Beckert, B., Goré, R., 1997. Free variable tableaux for propositional modal logics. In: TABLEAUX' 97, LNAI, vol. 1227. Springer, pp. 91-106.
5. Beckert, B., Posegga, J., 1995. leanTAP: lean tableau-based deduction. Journal of Automated Reasoning 15, 339-358. Kluwer.
6. Bibel, W., 1983. Matings in matrices. Communications of the ACM 26, 844-852.
7. Bibel, W., 1987. Automated Theorem Proving, second ed., Vieweg, Wiesbaden.
8. Bibel, W., 1993. Deduction: Automated Logic. Academic Press, London.
9. Bibel, W., Brüning, S., Egly, U., Rath, T., 1994. KoMeT. In: 12th CADE, LNAI, vol. 814. Springer, pp. 783-787.
10. Clocksin, W., Mellish, C., 1981. Programming in Prolog. Springer, Berlin, Heidelberg, New York.
11. Gentzen, G., 1935. Untersuchungen über das logische Schließen. Mathematische Zeitschrift 39, 176-210, 405-431.
12. Kreitz, C., Otten, J., 1999. Connection-based theorem proving in classical and non-classical logics. Journal of Universal Computer Science 5, 88-112. Springer.
13. Letz, R., Mayr, K., Goller, C., 1994. Controlled integration of the cut rule into connection tableaux calculi. Journal of Automated Reasoning 13, 297-337. Kluwer.
14. Letz, R., Schumann, J., Bayerl, S., Bibel, W., 1992. Setheo: a high-performance theorem prover. Journal of Automated Reasoning 8, 183-212. Kluwer.
15. Loveland, D., 1968. Mechanical theorem proving by model elimination. Journal of the ACM 15, 236-251.
16. Mantel, H., Otten, J., 1999. linTAP: a tableau prover for linear logic. In: TABLEAUX' 99, LNAI, vol. 1617. Springer, pp. 217-231.
17. Manthey, R., Bry, F., 1988. Satchmo: a theorem prover implemented in Prolog. In: 9th CADE, LNCS, vol. 310. Springer, pp. 415-434.
18. McCune, W., 1994. Otter 3.0 reference manual and guide, Technical Report ANL-94/6, Argonne National Laboratory.
19. Moser, M., Ibens, O., Letz, R., Steinbach, J., Goller, C., Schumann, J., Mayr, K., 1997. Setheo and E-Setheo - The CADE-13 systems. Journal of Automated Reasoning 18, 237-246. Kluwer.
20. Neugebauer, G., Schaub, T., 1991. A pool-based connection calculus. Technical Report AIDA-91-02, Intellektik, TH Darmstadt.
21. Otten, J., 1997. ileanTAP: An intuitionistic theorem prover. In: TABLEAUX' 97, LNAI, vol. 1227. Springer, pp. 307-312.
22. Otten, J., Kreitz, C., 1996a. T-string-unification: Unifying prefixes in non-classical proof methods. In: Proceedings of the 5th TABLEAUX Workshop, LNAI, vol. 1071. Springer, pp. 244-260.
23. Otten, J., Kreitz, C., 1996b. A uniform proof procedure for classical and non-classical logics. In: KI-96: Advances in Artificial Intelligence, LNAI, vol. 1137. Springer, pp. 307-319.
24. Pelletier, F., 1986. Seventy-five problems for testing automatic theorem provers. Journal of Automated Reasoning 2, 191-216. Kluwer.
25. Posegga, J., Schmitt, P., 1999. Implementing semantic tableaux. In: D'Agostino, M., Gabbay, D., Hähnle, R., Posegga, J. (Eds.), Handbook of Tableau Methods. Kluwer, pp. 581-629.
26. Stenz, G., Wolf, A., 1997. E-Setheo: an automated theorem prover. In: TABLEAUX 2000, LNAI, vol. 1847. Springer, pp. 436-440.
27. Stickel, M., 1988. A Prolog technology theorem prover: implementation by an extended Prolog compiler. Journal of Automated Reasoning 4, 353-380. Kluwer.
28. Stickel, M., 1992. A Prolog technology theorem prover: a new exposition and implementation in Prolog. In: Theoretical Computer Science, vol. 104. Elsevier Science, pp. 109-128.
29. Sutcliffe, G., Suttner, C., 1998. The TPTP problem library - CNF release v1.2.1. Journal of Automated Reasoning 21, 177-203. Kluwer.