Výsledky vyhledávání

Introducing w-Horn and z-Horn: A generalization of Horn and q-Horn formulae

Autor: Csaba Biró, Gábor Kusper, Imre Bajak, Attila Adamkó

Publikováno v: Annales Mathematicae et Informaticae.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::909c7ceb72775ec26719c3784bd88939
https://doi.org/10.33039/ami.2021.03.009

Zobrazit plný text záznamu

Cognitive Code Quality Improvement with Pattern Recognition and Recommendation by Examples

Autor: Gábor Kusper, Krisztian Kusper, Imre Bajak, Attila Adamkó, Szabolcs Marien, Mark Danisovszky

Publikováno v: 2020 11th IEEE International Conference on Cognitive Infocommunications (CogInfoCom).

Several groups work on automated design pattern recognition or automated refactoring. The goal of our paper is to present examples for ugly program code and its transformation into a pretty version. These examples are useful to test and teach their s

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::dfa15e4737bbf10c65c5c5e1871cb6fc
https://doi.org/10.1109/coginfocom50765.2020.9237896

Zobrazit plný text záznamu

Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs

Autor: Tibor Tajti, Imre Bajak, Zijian Gyozo Yang, Gábor Kusper, Tamás Balla, Csaba Biró

Publikováno v: SYNASC

We present a model generator which generates SAT problems from digraphs. There are a few restrictions on the input digraphs. There must be no self-loops, and its vertices must be Boolean variables or labeled by distinct Boolean variables. We call suc

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::22249b459ab691a205e87698847c2c09
https://doi.org/10.1109/synasc51798.2020.00024

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání