Petr Kucera

According to our database, Petr Kucera authored at least 32 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A Compiler for Weak Decomposable Negation Normal Form.

Petr Illner, Petr Kucera

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Binary Constraint Trees and Structured Decomposability.

Petr Kucera

Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

2022

Unique key Horn functions.

Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino

Theor. Comput. Sci., 2022

Approximating Minimum Representations of Key Horn Functions.

Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino

SIAM J. Comput., 2022

Propagation complete encodings of smooth DNNF theories.

Petr Kucera, Petr Savický

Constraints An Int. J., 2022

Learning a Propagation Complete Formula.

Petr Kucera

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2022

2021

Generating clause sequences of a CNF formula.

Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino

Theor. Comput. Sci., 2021

Backdoor Decomposable Monotone Circuits and Propagation Complete Encodings.

Petr Kucera, Petr Savický

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Bounds on the Size of PC and URC Formulas.

Petr Kucera, Petr Savický

J. Artif. Intell. Res., 2020

On the size of CNF formulas with high propagation strength.

Petr Kucera, Petr Savický

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020

2019

A lower bound on CNF encodings of the at-most-one constraint.

Petr Kucera, Petr Savický, Vojtech Vorel

Theor. Comput. Sci., 2019

Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability.

Milos Chromý, Petr Kucera

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

2018

Backdoor Decomposable Monotone Circuits and their Propagation Complete Encodings.

Petr Kucera, Petr Savický

CoRR, 2018

2017

Hydras: Complexity on general graphs and a subclass of trees.

Petr Kucera

Theor. Comput. Sci., 2017

Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract).

Petr Savický, Petr Kucera

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

On Minimum Representations of Matched Formulas (Extended Abstract).

Ondrej Cepek, Stefan Gurský, Petr Kucera

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016

Generating Models of a Matched Formula With a Polynomial Delay.

Petr Savický, Petr Kucera

J. Artif. Intell. Res., 2016

2014

On Minimum Representations of Matched Formulas.

Ondrej Cepek, Stefan Gurský, Petr Kucera

J. Artif. Intell. Res., 2014

2013

A decomposition method for CNF minimality proofs.

Endre Boros, Ondrej Cepek, Petr Kucera

Theor. Comput. Sci., 2013

Boolean functions with long prime implicants.

Ondrej Cepek, Petr Kucera, Stanislav Kurik

Inf. Process. Lett., 2013

Complexity issues related to propagation completeness.

Martin Babka, Tomás Balyo, Ondrej Cepek, Stefan Gurský, Petr Kucera, Václav Vlcek

Artif. Intell., 2013

2012

Boolean functions with a simple certificate for CNF complexity.

Ondrej Cepek, Petr Kucera, Petr Savický

Discret. Appl. Math., 2012

Properties of SLUR Formulae.

Ondrej Cepek, Petr Kucera, Václav Vlcek

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

On hierarchies over the SLUR class.

Václav Vlcek, Tomás Balyo, Stefan Gurský, Petr Kucera

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

2011

Analysing DNA microarray data using Boolean techniques.

Ondrej Cepek, David Kronus, Petr Kucera

Ann. Oper. Res., 2011

Disjoint essential sets of implicates of a CQ Horn function.

Ondrej Cepek, Petr Kucera

Ann. Math. Artif. Intell., 2011

2010

Exclusive and essential sets of implicates of Boolean functions.

Endre Boros, Ondrej Cepek, Alexander Kogan, Petr Kucera

Discret. Appl. Math., 2010

2009

Application of DES Theory to Verification of Software Components.

Kunihiko Hiraishi, Petr Kucera

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

A subclass of Horn CNFs optimally compressible in polynomial time.

Endre Boros, Ondrej Cepek, Alexander Kogan, Petr Kucera

Ann. Math. Artif. Intell., 2009

2008

Recognition of interval Boolean functions.

Ondrej Cepek, David Kronus, Petr Kucera

Ann. Math. Artif. Intell., 2008

2005

On the size of maximum renamable Horn sub-CNF.

Petr Kucera

Discret. Appl. Math., 2005

Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing.

Ondrej Cepek, Petr Kucera

Discret. Appl. Math., 2005