TY  - CHAP
AU  - Király, Sándor
AU  - Balla, Tamás
ED  - Tick, József
ED  - Kokas, Károly
ED  - Holl, András
TI  - Flipped classroom az sqlsuli.hu-ban
T2  - Új technológiákkal, új tartalmakkal a jövő digitális transzformációja felé
PB  - Hungarnet
CY  - Budapest
SN  - 9786158224314
PY  - 2023
SP  - 7
EP  - 13
PG  - 7
DO  - 10.31915/NWS.2023.1
UR  - https://m2.mtmt.hu/api/publication/34440487
ID  - 34440487
LA  - Hungarian
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Király, Sándor
AU  - Balla, Tamás
AU  - Király, Roland
TI  - Learning SQL by practicing on popular movie databases
JF  - CENTRAL-EUROPEAN JOURNAL OF NEW TECHNOLOGIES IN RESEARCH EDUCATION AND PRACTICE
J2  - CEJ-NETREP
VL  - 4
PY  - 2022
IS  - 1
SP  - 16
EP  - 24
PG  - 9
SN  - 2676-9425
DO  - 10.36427/CEJNTREP.4.1.4465
UR  - https://m2.mtmt.hu/api/publication/33180513
ID  - 33180513
LA  - English
DB  - MTMT
ER  - 

TY  - CHAP
AU  - Kusper, Gábor
AU  - Balla, Tamás
AU  - Biró, Csaba
AU  - Tajti, Tibor
AU  - Yang, Zijian Győző
AU  - Baják, Imre
TI  - Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs
T2  - 2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
PB  - IEEE
CY  - Piscataway (NJ)
SN  - 9781728176284
PY  - 2020
SP  - 84
EP  - 92
PG  - 9
DO  - 10.1109/SYNASC51798.2020.00024
UR  - https://m2.mtmt.hu/api/publication/31897929
ID  - 31897929
N1  - Eszterhazy Karoly University, Hungary            
            Budapest Business School, Hungary            
            Export Date: 14 November 2023; Cited By: 2; Conference name: 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2020; Conference date: 1 September 2020 through 4 September 2020; Conference code: 167393
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Balla, Tamás
AU  - Király, Sándor
TI  - A Discussion of Developing a Programming Education Portal
JF  - CENTRAL-EUROPEAN JOURNAL OF NEW TECHNOLOGIES IN RESEARCH EDUCATION AND PRACTICE
J2  - CEJ-NETREP
VL  - 2
PY  - 2020
IS  - 2
SP  - 1
EP  - 14
PG  - 14
SN  - 2676-9425
DO  - 10.36427/CEJNTREP.2.2
UR  - https://m2.mtmt.hu/api/publication/31784760
ID  - 31784760
LA  - English
DB  - MTMT
ER  - 

TY  - CONF
AU  - Balla, Tamás
AU  - Kusper, Gábor
AU  - Biró, Csaba
AU  - Tajti, Tibor
ED  - Horváth, Zoltán
ED  - Adrian, Petruşel
TI  - BaW 2.0 - A Problem Specific SAT Solver for Balatonboglár Models Generated from Digraphs
T2  - Collection of Abstracts
PB  - Babes-Bolyai Tudományegyetem
C1  - Budapest
PY  - 2020
SP  - 22
EP  - 23
PG  - 2
UR  - https://m2.mtmt.hu/api/publication/31672348
ID  - 31672348
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Király, Sándor
AU  - Balla, Tamás
TI  - The effectiveness of a fully gamified programming course after combining with serious games
JF  - ACTA DIDACTICA NAPOCENSIA
J2  - ACTA DID NAPOC
VL  - 13
PY  - 2020
IS  - 1
SP  - 65
EP  - 76
PG  - 12
SN  - 2065-1430
DO  - 10.24193/adn.13.1.7
UR  - https://m2.mtmt.hu/api/publication/31409198
ID  - 31409198
LA  - English
DB  - MTMT
ER  - 

TY  - CONF
AU  - Balla, Tamás
AU  - Biró, Csaba
AU  - Kusper, Gábor
ED  - Kovásznai, Gergely
ED  - Fazekas, István
ED  - Tómács, Tibor
TI  - The BWConverter Toolchain: An Incomplete Way to Convert SAT Problems into Directed Graphs
T2  - Proceedings of the 11th International Conference on Applied Informatics (ICAI 2020)
PB  - CEUR Workshop Proceedings
C1  - Eger
T3  - CEUR Workshop Proceedings, ISSN 1613-0073 ; 2650.
PY  - 2020
SP  - 24
EP  - 29
PG  - 6
UR  - https://m2.mtmt.hu/api/publication/31402796
ID  - 31402796
N1  - Export Date: 14 November 2023; Cited By: 2; Conference name: 11th International Conference on Applied Informatics, ICAI 2020; Conference date: 29 January 2020 through 31 January 2020; Conference code: 162210
AB  - 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).
LA  - English
DB  - MTMT
ER  - 

TY  - CONF
AU  - Balla, Tamás
AU  - Király, Sándor
ED  - Kovásznai, Gergely
ED  - Fazekas, István
ED  - Tómács, Tibor
TI  - Enhancing learning efficiency after analysing the users' results in a gamified learning portal for computer programming education
T2  - Proceedings of the 11th International Conference on Applied Informatics (ICAI 2020)
PB  - CEUR Workshop Proceedings
C1  - Eger
T3  - CEUR Workshop Proceedings, ISSN 1613-0073 ; 2650.
PY  - 2020
SP  - 23
EP  - 23
PG  - 1
UR  - https://m2.mtmt.hu/api/publication/31366279
ID  - 31366279
LA  - English
DB  - MTMT
ER  - 

TY  - CHAP
AU  - Kusper, Gábor
AU  - Biró, Csaba
AU  - Balla, Tamás
TI  - Investigation of the Efficiency of Conversion of Directed Graphs to 3-SAT Problems
T2  - IEEE 14th International Symposium on Applied Computational Intelligence and Informatics (SACI 2020)
PB  - IEEE
CY  - Piscataway (NJ)
SN  - 9781728173771
PY  - 2020
SP  - 227
EP  - 233
PG  - 7
DO  - 10.1109/SACI49304.2020.9118786
UR  - https://m2.mtmt.hu/api/publication/31350746
ID  - 31350746
N1  - Scopus:hiba:85087421967 2022-10-12 17:49 befoglaló egyiknél nincsenek szerzők
AB  - 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.
LA  - English
DB  - MTMT
ER  - 

TY  - CONF
AU  - Balla, Tamás
AU  - Biró, Csaba
AU  - Kusper, Gábor
ED  - Kovásznai, Gergely
ED  - Fazekas, István
ED  - Tómács, Tibor
TI  - THE BWCONVERTER TOOLCHAIN: AN INCOMPLETE WAY TO CONVERT SAT PROBLEMS INTO DIRECTED GRAPHS
T2  - Proceedings of the 11th International Conference on Applied Informatics (ICAI 2020)
PB  - CEUR Workshop Proceedings
C1  - Eger
T3  - CEUR Workshop Proceedings, ISSN 1613-0073 ; 2650.
PY  - 2020
UR  - https://m2.mtmt.hu/api/publication/31150681
ID  - 31150681
LA  - English
DB  - MTMT
ER  -