Name and surname:
|
Ing. Ján Komara, PhD.
|
Document type:
|
Research/art/teacher profile of a person
|
The name of the university:
|
Comenius University Bratislava
|
The seat of the university:
|
Šafárikovo námestie 6, 818 06 Bratislava
|
V.1.a - Name of the profile course | V.1.b - Study programme | V.1.c - Degree | V.1.d - Field of study |
---|---|---|---|
1-AIN-121 Discrete mathematics (1) | Applied Informatics | I. | Informatics |
1-AIN-160 Discrete mathematics (2) | Applied Informatics | I. | Informatics |
1-AIN-188 Matematical analysis | Applied Informatics | I. | Informatics |
1-AIN-470 Specification and verification of programs | Applied Informatics | I. | Informatics |
V.5.a - Name of the course | V.5.b - Study programme | V.5.c - Degree | V.5.d - Field of study |
---|---|---|---|
2-AIN-266 Deklarative programming | Applied Informatics | II. | Informatics |
2-AIN-285 Symbolic programming and LISP | Applied Informatics | II. | Informatics |
Komara, J. Efficient elimination of Skolem functions in LKʰ. Arch. Math. Logic 61, 503–534 (2022). https://doi.org/10.1007/s00153-021-00798-z
Komara, J. On nested simple recursion. Arch. Math. Logic 50, 617–624 (2011). https://doi.org/10.1007/s00153-011-0236-9
Komara J., Voda P.J. (1999) Theorems of Péter and Parsons in Computer Programming. In: Gottlob G., Grandjean E., Seyr K. (eds) omputer Science Logic. CSL 1998. Lecture Notes in Computer Science, vol 1584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10703163_15
Komara J., Voda P.J. (1997) On quasitautologies. In: Galmiche D. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 1997. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence), vol 1227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027417
Komara J., Voda P.J. (1995) Syntactic reduction of predicate tableaux to propositional tableaux. In: Baumgartner P., Hähnle R., Possega J. (eds) Theorem Proving with Analytic Tableaux and Related Methods. TABLEAUX 1995. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence), vol 918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59338-1_39
Komara, J. Efficient elimination of Skolem functions in LKʰ. Arch. Math. Logic 61, 503–534 (2022). https://doi.org/10.1007/s00153-021-00798-z https://app.crepc.sk/?fn=detailBiblioForm&sid=2B6C9B3B6E03D6F406A30DBAFD
Komara, J. Efficient elimination of Skolem functions in LKh. arXiv.org (2020), Art. No. ArXiv:1909.01697. https://arxiv.org/abs/1909.01697 https://app.crepc.sk/?fn=detailBiblioForm&sid=66C74FF48D413BFF4FDC3EA132
Ján Komara, Paul J. Voda. Extraction of Efficient Programs in IΣ1-arithmetic. arXiv.org (2019), Art. No.ArXiv:1910.00635. https://arxiv.org/abs/1910.00635
P. J. Voda and J. Komara. On Herbrand skeletons. Technical report, Institute of Informatics, Faculty of Mathematics and Physics, Comenius University, Bratislava, July 1995. Revised January 1996. Also in: arXiv.org (2019), Art. No. ArXiv:1909.13514. https://arxiv.org/abs/1909.13514. 18 citations.
Komara, J. Efficient elimination of Skolem functions in LKʰ. Arch. Math. Logic 61, 503–534 (2022). https://doi.org/10.1007/s00153-021-00798-z. 1 citation.
Komara, J. On nested simple recursion. Arch. Math. Logic 50, 617–624 (2011). https://doi.org/10.1007/s00153-011-0236-9. 1 citation.
Investigator within the project VEGA 1/0778/18, principal investigator Damas Gruska, 2019-2021.
He is a member of the commissions for the state final exams of the bachelor's degree in Applied Informatics.