Petr Kucera

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 27

Top Topics

Boolean Functions

Top Venues

Theor. Comput. Sci.

J. Artif. Intell. Res.

Publications

Petr Illner, Petr Kucera
A Compiler for Weak Decomposable Negation Normal Form. AAAI (2024)
Petr Kucera
Binary Constraint Trees and Structured Decomposability. CP (2023)
Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
Unique key Horn functions. Theor. Comput. Sci. 922 (2022)
Petr Kucera, Petr Savický
Propagation complete encodings of smooth DNNF theories. Constraints An Int. J. 27 (3) (2022)
Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
Approximating Minimum Representations of Key Horn Functions. SIAM J. Comput. 51 (1) (2022)
Petr Kucera
Learning a Propagation Complete Formula. CPAIOR (2022)
Petr Kucera, Petr Savický
Backdoor Decomposable Monotone Circuits and Propagation Complete Encodings. AAAI (2021)
Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino
Generating clause sequences of a CNF formula. Theor. Comput. Sci. 856 (2021)
Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
Unique key Horn functions. CoRR (2020)
Petr Kucera, Petr Savický
Bounds on the Size of PC and URC Formulas. J. Artif. Intell. Res. 69 (2020)
Petr Kucera, Petr Savický
On the size of CNF formulas with high propagation strength. ISAIM (2020)
Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino
Generating clause sequences of a CNF formula. CoRR (2020)
Petr Kucera, Petr Savický
Bounds on the size of PC and URC formulas. CoRR (2020)
Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
Approximating minimum representations of key Horn functions. ISAIM (2020)
Petr Kucera, Petr Savický, Vojtech Vorel
A lower bound on CNF encodings of the at-most-one constraint. Theor. Comput. Sci. 762 (2019)
Petr Kucera, Petr Savický
Propagation complete encodings of smooth DNNF theories. CoRR (2019)
Milos Chromý, Petr Kucera
Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability. SOFSEM (2019)
Petr Kucera, Petr Savický
Backdoor Decomposable Monotone Circuits and their Propagation Complete Encodings. CoRR (2018)
Milos Chromý, Petr Kucera
Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability. CoRR (2018)
Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
Approximating minimum representations of key Horn functions. CoRR (2018)
Ondrej Cepek, Stefan Gurský, Petr Kucera
On Minimum Representations of Matched Formulas (Extended Abstract). IJCAI (2017)
Petr Kucera
Hydras: Complexity on general graphs and a subclass of trees. Theor. Comput. Sci. 658 (2017)
Petr Kucera, Petr Savický, Vojtech Vorel
A lower bound on CNF encodings of the at-most-one constraint. CoRR (2017)
Petr Savický, Petr Kucera
Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract). IJCAI (2017)
Petr Kucera, Petr Savický, Vojtech Vorel
A Lower Bound on CNF Encodings of the At-Most-One Constraint. SAT (2017)
Petr Savický, Petr Kucera
Generating Models of a Matched Formula With a Polynomial Delay. J. Artif. Intell. Res. 56 (2016)
Petr Savický, Petr Kucera
Generating models of a matched formula with a polynomial delay. ISAIM (2016)
Petr Kucera
Hydras: Complexity on general graphs and a subclass of trees. ISAIM (2014)
Ondrej Cepek, Stefan Gurský, Petr Kucera
On Minimum Representations of Matched Formulas. J. Artif. Intell. Res. 51 (2014)
Martin Babka, Tomás Balyo, Ondrej Cepek, Stefan Gurský, Petr Kucera, Václav Vlcek
Complexity issues related to propagation completeness. Artif. Intell. 203 (2013)
Endre Boros, Ondrej Cepek, Petr Kucera
A decomposition method for CNF minimality proofs. Theor. Comput. Sci. 510 (2013)
Ondrej Cepek, Petr Kucera, Stanislav Kurik
Boolean functions with long prime implicants. Inf. Process. Lett. 113 (19-21) (2013)
Ondrej Cepek, Petr Kucera, Petr Savický
Boolean functions with a simple certificate for CNF complexity. Discret. Appl. Math. 160 (4-5) (2012)
Václav Vlcek, Tomás Balyo, Stefan Gurský, Petr Kucera
On hierarchies over the SLUR class. ISAIM (2012)
Ondrej Cepek, Petr Kucera, Stanislav Kurik
Boolean functions with long prime implicants. ISAIM (2012)
Ondrej Cepek, Petr Kucera, Václav Vlcek
Properties of SLUR Formulae. SOFSEM (2012)
Ondrej Cepek, Petr Kucera
Disjoint essential sets of implicates of a CQ Horn function. Ann. Math. Artif. Intell. 61 (3) (2011)
Ondrej Cepek, David Kronus, Petr Kucera
Analysing DNA microarray data using Boolean techniques. Ann. Oper. Res. 188 (1) (2011)
Endre Boros, Ondrej Cepek, Alexander Kogan, Petr Kucera
Exclusive and essential sets of implicates of Boolean functions. Discret. Appl. Math. 158 (2) (2010)
Endre Boros, Ondrej Cepek, Alexander Kogan, Petr Kucera
A subclass of Horn CNFs optimally compressible in polynomial time. Ann. Math. Artif. Intell. 57 (3-4) (2009)
Kunihiko Hiraishi, Petr Kucera
Application of DES Theory to Verification of Software Components. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2) (2009)
Ondrej Cepek, David Kronus, Petr Kucera
Recognition of interval Boolean functions. Ann. Math. Artif. Intell. 52 (1) (2008)
Petr Kucera
On the size of maximum renamable Horn sub-CNF. Discret. Appl. Math. 149 (1-3) (2005)
Ondrej Cepek, Petr Kucera
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing. Discret. Appl. Math. 149 (1-3) (2005)