Gábor Kusper

Dr. Gábor Kusper

Computer Science, Eszterházy Károly Catholic University, Eger, Heves, Hungary
orcid
Associate Professor at Eszterházy Károly Catholic University...

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 May 2021 in Annales Mathematicae et Informaticae
Verified
Journal Article
Closed access
ZYZijian Győző Yang
Zijian Győző Yang
ÁAÁdám Agócs
Ádám Agócs
Gábor KusperGábor Kusper
Gábor Kusper
TVTamás Váradi
Tamás Váradi

1 January 2018 in Miskolc Mathematical Notes
Verified
Journal Article
Closed access
CBCsaba Biró
Csaba Biró
Gábor KusperGábor Kusper
Gábor Kusper

15 October 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
Gábor KusperGábor Kusper
Gábor Kusper
CBCsaba Biró
Csaba Biró
BNBenedek Nagy
Benedek Nagy
In this paper, we introduce the notion of resolvable networks. A resolvable network is a digraph of subnetworks, where subnetworks may overlap, and the inner structure of subnetworks are not interesting from the viewpoint of the network. There are two special subnetworks, Source and Sink, with the following properties: there is no incoming edge to Source, and there is no outgoing edge from Sink. Any resolvable network can be represented by a satisfiability problem in Boolean logic (shortly, SAT problem), and any SAT problem can be represented by a resolvable network. Because of that, the resolution operation is valid also for resolvable networks. We can use resolution to find out or refine the inner structure of subnetworks. We give also a pessimistic and an optimistic interpretation of subnetworks. In the pessimistic case, we assume that inside a subnetwork, all communication possibilities are represented as part of the resolvable network. In the optimistic case, we assume that each subnetwork is strongly connected. We show that any SAT problem can be visualized using the pessimistic interpretation. We show that transitivity is very limited in the pessimistic interpretation, and in this case, transitivity corresponds to resolution of clauses. In the optimistic interpretation of subnetworks, we have transitivity without any further condition, but not all SAT problems can be represented in this case; however, any such network can be represented as a SAT problem. The newly introduced graphical concept allows to use terminology and tools from directed graphs in the field of SAT and also to give graphical representations of various concepts of satisfiability problems. A resolvable network is also a suitable data structure to study, for example, wireless sensor networks. The visualization power of resolvable networks is demonstrated on some pigeon hole SAT problems. Another important application field could be modeling the communication network of an information bank. Here, a subnetwork represents a dataset of a user which is secured by a proxy. Any communication should be done through the proxy, and this constraint can be checked using our model.

5 November 2020 in Preprints.org
Verified
Preprint
Open access
Gábor KusperGábor Kusper
Gábor Kusper
CBCsaba Biró
Csaba Biró
In a previous paper we defined the Black-and-White SAT problem which has exactly two solutions, where each variable is either true or false. We showed that Black-and-White $2$-SAT problems represent strongly connected directed graphs. We presented also the strong model of communication graphs. In this work we introduce two new models, the weak model, and the Balatonbogl\'{a}r model of communication graphs. A communication graph is a directed graph, where no self loops are allowed. In this work we show that the weak model of a strongly connected communication graph is a Black-and-White SAT problem. We prove a powerful theorem, the so called Transitions Theorem. This theorem states that for any model which is between the strong and the weak model, we have that this model represents strongly connected communication graphs as Blask-and-White SAT problems. We show that the Balatonbogl\'{a}r model is between the strong and the weak model, and it generates $3$-SAT problems, so the Balatonbogl\'{a}r model represents strongly connected communication graphs as Black-and-White $3$-SAT problems. Our motivation to study these models is the following: The strong model generates a $2$-SAT problem from the input directed graph, so it does not give us a deep insight how to convert a general SAT problem into a directed graph. The weak model generates huge models, because it represents all cycles, even non-simple cycles, of the input directed graph. We need something between them to gain more experience. From the Balatonbogl\'{a}r model we learned that it is enough to have a subset of a clause, which represents a cycle in the weak model, to make the Balatonbogl\'{a}r model more compact. We still do not know how to represent a SAT problem as a directed graph, but this work gives a strong link between two prominent fields of formal methods: SAT problem and directed graphs.

1 January 2025
Verified
Conference Paper
Closed access
GGGábor Guta
Gábor Guta
Gábor KusperGábor Kusper
Gábor Kusper
The use of large language models (LLMs) in software development is becoming increasingly widespread, despite well-known concerns regarding their reliability. A significant risk arises from relying on poorly understood approximate solutions that may subtly introduce errors into the final system. A key barrier to the adoption of formal modeling – beyond the steep learning curve of formal specification languages – is the additional abstraction layer, which can be as difficult to maintain as the source code itself. This complexity persists even when the formal specification can generate code directly. Another challenge is that, while tools for verifying properties of formal models are well-established, the initial translation of a mental model into a formal one often results in invalid or imprecise representations. We propose a tool which facilitates the validation of formal models generated by LLMs from natural language specifications. The validation process involves two steps: first, the formal model is translated back into natural language using a deterministic, easily verifiable rule-based method; second, the author of the original specification validates this reformulated version. This human-in-the-loop method mitigates the risks associated with LLM black-box generation by enabling explicit semantic verification of the model.

3 December 2020 in Algorithms
Verified
Journal Article
Open access
PDF file
Gábor KusperGábor Kusper
Gábor Kusper
CBCsaba Biró
Csaba Biró
In a previous paper we defined the black and white SAT problem which has exactly two solutions, where each variable is either true or false. We showed that black and white 2-SAT problems represent strongly connected directed graphs. We presented also the strong model of communication graphs. In this work we introduce two new models, the weak model, and the Balatonboglár model of communication graphs. A communication graph is a directed graph, where no self loops are allowed. In this work we show that the weak model of a strongly connected communication graph is a black and white SAT problem. We prove a powerful theorem, the so called transitions theorem. This theorem states that for any model which is between the strong and the weak model, we have that this model represents strongly connected communication graphs as black and white SAT problems. We show that the Balatonboglár model is between the strong and the weak model, and it generates 3-SAT problems, so the Balatonboglár model represents strongly connected communication graphs as black and white 3-SAT problems. Our motivation to study these models is the following: The strong model generates a 2-SAT problem from the input directed graph, so it does not give us a deep insight how to convert a general SAT problem into a directed graph. The weak model generates huge models, because it represents all cycles, even non-simple cycles, of the input directed graph. We need something between them to gain more experience. From the Balatonboglár model we learned that it is enough to have a subset of a clause, which represents a cycle in the weak model, to make the Balatonboglár model more compact. We still do not know how to represent a SAT problem as a directed graph, but this work gives a strong link between two prominent fields of formal methods: the SAT problem and directed graphs.