Ondrej Cepek

According to our database, Ondrej Cepek authored at least 46 papers between 1994 and 2022.

Collaborative distances:

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

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

A Direct Equivalence-Testing Algorithm for SLRs.

Ondrej Cepek, James Weigle

Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

Switch lists in the landscape of knowledge representation languages.

Ondrej Cepek

Proceedings of the Thirty-Fifth International Florida Artificial Intelligence Research Society Conference, 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

2020

Properties of Switch-List Representations of Boolean Functions.

Milos Chromý, Ondrej Cepek

J. Artif. Intell. Res., 2020

Compiling SL representations of Boolean functions into OBDDs.

Milos Chromý, Ondrej Cepek

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

Switch-List Representations in a Knowledge Compilation Map.

Ondrej Cepek, Milos Chromý

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019

Separable discrete functions: Recognition and sufficient conditions.

Endre Boros, Ondrej Cepek, Vladimir Gurvich

Discret. Math., 2019

2017

Recognition of tractable DNFs representable by a constant number of intervals.

Ondrej Cepek, Radek Husek

Discret. Optim., 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

Strong Duality in Horn Minimization.

Endre Boros, Ondrej Cepek, Kazuhisa Makino

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016

Knowledge compilation from DNF to switch-list representations.

Ondrej Cepek, Radek Husek

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

A combinatorial min-max theorem and minimization of pure-Horn functions.

Endre Boros, Ondrej Cepek, Kazuhisa Makino

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

2014

On Minimum Representations of Matched Formulas.

Ondrej Cepek, Stefan Gurský, Petr Kucera

J. Artif. Intell. Res., 2014

On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas.

Ondrej Cepek, Stefan Gurský

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 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

Total tightness implies Nash-solvability for three-person game forms.

Endre Boros, Ondrej Cepek, Vladimir Gurvich

Discret. Math., 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

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

Book review.

Ondrej Cepek

Comput. Sci. Rev., 2010

Discovering implied constraints in precedence graphs with alternatives.

Roman Barták, Ondrej Cepek, Pavel Surynek

Ann. Oper. Res., 2010

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

Incremental Filtering Algorithms for Precedence and Dependency Constraints.

Roman Barták, Ondrej Cepek

Int. J. Artif. Intell. Tools, 2008

Recognition of interval Boolean functions.

Ondrej Cepek, David Kronus, Petr Kucera

Ann. Math. Artif. Intell., 2008

Nested temporal networks with alternatives: recognition and tractability.

Roman Barták, Ondrej Cepek

Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models.

Roman Barták, Ondrej Cepek

Proceedings of the Artificial Intelligence: Methodology, 2008

2007

Temporal Networks with Alternatives: Complexity and Model.

Roman Barták, Ondrej Cepek

Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference, 2007

Temporal Reasoning in Nested Temporal Networks with Alternatives.

Roman Barták, Ondrej Cepek, Martin Hejna

Proceedings of the Recent Advances in Constraints, 2007

Modelling Alternatives in Temporal Networks.

Roman Barták, Ondrej Cepek, Pavel Surynek

Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

2006

A Constraint Model for State Transitions in Disjunctive Resources.

Roman Barták, Ondrej Cepek

Proceedings of the Recent Advances in Constraints, 2006

Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach.

Roman Barták, Ondrej Cepek

Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

2005

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

Ondrej Cepek, Petr Kucera

Discret. Appl. Math., 2005

A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines.

Ondrej Cepek, Shao Chin Sung

Comput. Oper. Res., 2005

Extension of <i>O</i>(<i>n</i> log <i>n</i>) Filtering Algorithms for the Unary Resource Constraint to Optional Activities.

Petr Vilím, Roman Barták, Ondrej Cepek

Constraints An Int. J., 2005

2004

Unary Resource Constraint with Optional Activities.

Petr Vilím, Roman Barták, Ondrej Cepek

Proceedings of the Principles and Practice of Constraint Programming, 2004

2002

Nonpreemptive flowshop scheduling with machine dominance.

Ondrej Cepek, Masanori Okada, Milan Vlach

Eur. J. Oper. Res., 2002

2001

A Satisfiability Formulation of Problems on Level Graphs.

Bert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek

Electron. Notes Discret. Math., 2001

1998

Horn Minimization by Iterative Decomposition.

Endre Boros, Ondrej Cepek, Alexander Kogan

Ann. Math. Artif. Intell., 1998

1997

On perfect 0, +/- 1 matrices^,.

Endre Boros, Ondrej Cepek

Discret. Math., 1997

1994

Nonpreemptive open shop with restricted processing times.

Ondrej Cepek, Milan Vlach, Dominique de Werra

Math. Methods Oper. Res., 1994