Martin Suda

Education

M.S. in Computer Science (2007), Faculty of Mathematics and Physics, Charles University, Prague

Current

I am a PhD student at the Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University.
My supervisor is Prof. RNDr. Petr Stepanek, DrSc..

Research Interests

I am interested in automated theorem provers for first order logic, especially modern saturation-based provers like SPASS, E or Vampire. I would like to investigate how these provers could be better adapted for use in their new application areas such as bioinformatics or large ontologies. In particular, I am currently interested in the possibility of accessing an external function (search function, database access) from the prover loop.

Publications

External Sources of Axioms in Automated Theorem Proving
M. Suda, G. Sutcliffe, P. Wischnewsk, M. Lamotte-Schubert, G. de Melo, in Proceedings of the 32nd Annual Conference on Artificial Intelligence (eds. B. Mertsching), LNAI 5803, pp. 281-288. Springer, Heidelberg (2009)

SPASS Version 3.5
C. Weidenbach, D. Dimova, A. Fietzke, R. Kumar, M. Suda, and P. Wischnewski, in Automated Deduction – CADE-22 Proceedings (eds. R. A. Schmidt), LNCS (LNAI), vol. 5663, pp. 140-145. Springer, Heidelberg (2009)

Relevancy Zones for Lambda Search in Rigid Board Games
M. Suda, in WDS'08 Proceedings of Contributed Papers: Part I - Mathematics and Computer Sciences (eds. J. Safrankova and J. Pavlu), Prague, Matfyzpress, pp. 151-158, 2008.

Effective Algorithms for Verifying Goals in Computer Games [PDF (czech only)]
M. Suda. My master degree diploma thesis (2007).

E-mail: martin.suda(zavinac=at)gmail.com

updated: 22. 9. 2009