@inproceedings{MTMT:34440487,
	title = {Flipped classroom az sqlsuli.hu-ban},
	url = {https://m2.mtmt.hu/api/publication/34440487},
	author = {Király, Sándor and Balla, Tamás},
	booktitle = {Új technológiákkal, új tartalmakkal a jövő digitális transzformációja felé},
	doi = {10.31915/NWS.2023.1},
	unique-id = {34440487},
	year = {2023},
	pages = {7-13}
}

@article{MTMT:33180513,
	title = {Learning SQL by practicing on popular movie databases},
	url = {https://m2.mtmt.hu/api/publication/33180513},
	author = {Király, Sándor and Balla, Tamás and Király, Roland},
	doi = {10.36427/CEJNTREP.4.1.4465},
	journal-iso = {CEJ-NETREP},
	journal = {CENTRAL-EUROPEAN JOURNAL OF NEW TECHNOLOGIES IN RESEARCH EDUCATION AND PRACTICE},
	volume = {4},
	unique-id = {33180513},
	year = {2022},
	eissn = {2676-9425},
	pages = {16-24},
	orcid-numbers = {Király, Roland/0009-0005-5500-2622}
}

@inproceedings{MTMT:31897929,
	title = {Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs},
	url = {https://m2.mtmt.hu/api/publication/31897929},
	author = {Kusper, Gábor and Balla, Tamás and Biró, Csaba and Tajti, Tibor and Yang, Zijian Győző and Baják, Imre},
	booktitle = {2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)},
	doi = {10.1109/SYNASC51798.2020.00024},
	unique-id = {31897929},
	year = {2020},
	pages = {84-92}
}

@article{MTMT:31784760,
	title = {A Discussion of Developing a Programming Education Portal},
	url = {https://m2.mtmt.hu/api/publication/31784760},
	author = {Balla, Tamás and Király, Sándor},
	doi = {10.36427/CEJNTREP.2.2},
	journal-iso = {CEJ-NETREP},
	journal = {CENTRAL-EUROPEAN JOURNAL OF NEW TECHNOLOGIES IN RESEARCH EDUCATION AND PRACTICE},
	volume = {2},
	unique-id = {31784760},
	year = {2020},
	eissn = {2676-9425},
	pages = {1-14}
}

@CONFERENCE{MTMT:31672348,
	title = {BaW 2.0 - A Problem Specific SAT Solver for Balatonboglár Models Generated from Digraphs},
	url = {https://m2.mtmt.hu/api/publication/31672348},
	author = {Balla, Tamás and Kusper, Gábor and Biró, Csaba and Tajti, Tibor},
	booktitle = {Collection of Abstracts},
	unique-id = {31672348},
	year = {2020},
	pages = {22-23}
}

@article{MTMT:31409198,
	title = {The effectiveness of a fully gamified programming course after combining with serious games},
	url = {https://m2.mtmt.hu/api/publication/31409198},
	author = {Király, Sándor and Balla, Tamás},
	doi = {10.24193/adn.13.1.7},
	journal-iso = {ACTA DID NAPOC},
	journal = {ACTA DIDACTICA NAPOCENSIA},
	volume = {13},
	unique-id = {31409198},
	issn = {2065-1430},
	year = {2020},
	pages = {65-76}
}

@CONFERENCE{MTMT:31402796,
	title = {The BWConverter Toolchain: An Incomplete Way to Convert SAT Problems into Directed Graphs},
	url = {https://m2.mtmt.hu/api/publication/31402796},
	author = {Balla, Tamás and Biró, Csaba and Kusper, Gábor},
	booktitle = {Proceedings of the 11th International Conference on Applied Informatics (ICAI 2020)},
	unique-id = {31402796},
	abstract = {In our previous works we showed, how to convert a directed graph into a SAT problem. We showed that if the directed graph is strongly connected, then the converted SAT problem is Black-and-White. A SAT problem is Black-and-White if it has exactly two solutions, the black assignment, where each variable is false, and the white one, where each variable is true. In this paper, we study the other way: How to convert a SAT problem into a directed graph. This direction seems to be very difficult, so we introduce the BWConverter toolchain which helps us to create Black-and-White SAT instances, and convert them to directed graphs using different strategies. The toolchain consist of two tools: the BWConverter and the NPP tool. As a first step, one has to use the BWConverter tool, which creates a Black-and-White SAT problem from any UNSAT problems. The resulting SAT problem is Black-and-White if the input was UNSAT. As a second step, we generate a directed graph using our NPP tool. This tool generates edges from clauses which contain either exactly one positive literal, or exactly one negative one using the observations of our previous models. Copyright © 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).},
	keywords = {Directed graphs; SAT problems; Strongly connected; SAT instances; SAT; BWConverter; Strongly Connected Directed Graphs},
	year = {2020},
	pages = {24-29}
}

@CONFERENCE{MTMT:31366279,
	title = {Enhancing learning efficiency after analysing the users' results in a gamified learning portal for computer programming education},
	url = {https://m2.mtmt.hu/api/publication/31366279},
	author = {Balla, Tamás and Király, Sándor},
	booktitle = {Proceedings of the 11th International Conference on Applied Informatics (ICAI 2020)},
	unique-id = {31366279},
	year = {2020},
	pages = {23-23}
}

@inproceedings{MTMT:31350746,
	title = {Investigation of the Efficiency of Conversion of Directed Graphs to 3-SAT Problems},
	url = {https://m2.mtmt.hu/api/publication/31350746},
	author = {Kusper, Gábor and Biró, Csaba and Balla, Tamás},
	booktitle = {IEEE 14th International Symposium on Applied Computational Intelligence and Informatics (SACI 2020)},
	doi = {10.1109/SACI49304.2020.9118786},
	unique-id = {31350746},
	abstract = {In our previous works we introduced several 2-SAT (Strong Model) and 3-SAT (Weak Model, Balatonboglár Model and Simplified Balatonboglár Model) models of directed graphs. We showed that Balatonboglár Model is a Black-and-White 3-SAT problem if and only if the represented directed graph is strongly connected. Balatonboglár Model generates a lot of so called Negative-Negative-Positive shaped clauses to represent cycles of the directed graph without detecting cycles, i.e., it can be generated fast but it is bigger than necessary. To overcome this problem, we have introduced the Simplified Balatonboglár Model. In this article, first, we give an example to illustrate the various conversion methods (models) and we briefly explain the theoretical background. After, we present the results of the latest version of CSFLOC on benchmarks generated by different conversion models. Finally, we show how the file sizes of benchmarks and the number of unused clauses changes as a function of the density of the represented directed graph. © 2020 IEEE.},
	keywords = {Artificial intelligence; Directed graph; Directed graphs; Conversion methods; Weak models; Strongly connected; File sizes; 3-SAT; 3-SAT problems; R models; 2-SAT; Balatonboglár Model; Simplified Balatonboglár Model; Strong Model; Conversion model},
	year = {2020},
	pages = {227-233}
}

@CONFERENCE{MTMT:31150681,
	title = {THE BWCONVERTER TOOLCHAIN: AN INCOMPLETE WAY TO CONVERT SAT PROBLEMS INTO DIRECTED GRAPHS},
	url = {https://m2.mtmt.hu/api/publication/31150681},
	author = {Balla, Tamás and Biró, Csaba and Kusper, Gábor},
	booktitle = {Proceedings of the 11th International Conference on Applied Informatics (ICAI 2020)},
	unique-id = {31150681},
	year = {2020}
}