Ondrej Cepek

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 19

Top Topics

Knowledge Compilation

Unsatisfiable Cores

Boolean Functions

Top Venues

J. Artif. Intell. Res.

Theor. Comput. Sci.

Publications

Endre Boros, Ondrej Cepek, Vladimir Gurvich, Kazuhisa Makino
Recognizing distributed approval voting forms and correspondences. Ann. Oper. Res. 336 (3) (2024)
Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
Unique key Horn functions. Theor. Comput. Sci. 922 (2022)
Ondrej Cepek
Switch lists in the landscape of knowledge representation languages. FLAIRS (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)
Ondrej Cepek, James Weigle
A Direct Equivalence-Testing Algorithm for SLRs. ISAIM (2022)
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)
Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino
Generating clause sequences of a CNF formula. CoRR (2020)
Ondrej Cepek, Milos Chromý
Switch-List Representations in a Knowledge Compilation Map. IJCAI (2020)
Milos Chromý, Ondrej Cepek
Properties of Switch-List Representations of Boolean Functions. J. Artif. Intell. Res. 69 (2020)
Milos Chromý, Ondrej Cepek
Compiling SL representations of Boolean functions into OBDDs. ISAIM (2020)
Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
Approximating minimum representations of key Horn functions. ISAIM (2020)
Endre Boros, Ondrej Cepek, Vladimir Gurvich
Separable discrete functions: Recognition and sufficient conditions. Discret. Math. 342 (5) (2019)
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)
Endre Boros, Ondrej Cepek, Kazuhisa Makino
Strong Duality in Horn Minimization. FCT (2017)
Ondrej Cepek, Radek Husek
Recognition of tractable DNFs representable by a constant number of intervals. Discret. Optim. 23 (2017)
Endre Boros, Ondrej Cepek, Kazuhisa Makino
A combinatorial min-max theorem and minimization of pure-Horn functions. ISAIM (2016)
Ondrej Cepek, Radek Husek
Knowledge compilation from DNF to switch-list representations. ISAIM (2016)
Ondrej Cepek, Stefan Gurský, Petr Kucera
On Minimum Representations of Matched Formulas. J. Artif. Intell. Res. 51 (2014)
Ondrej Cepek, Stefan Gurský
On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas. ISAIM (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)
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)
Endre Boros, Ondrej Cepek, Vladimir Gurvich
Total tightness implies Nash-solvability for three-person game forms. Discret. Math. 312 (8) (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)
Roman Barták, Ondrej Cepek, Pavel Surynek
Discovering implied constraints in precedence graphs with alternatives. Ann. Oper. Res. 180 (1) (2010)
Ondrej Cepek
Book review. Comput. Sci. Rev. 4 (3) (2010)
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)
Ondrej Cepek, David Kronus, Petr Kucera
Recognition of interval Boolean functions. Ann. Math. Artif. Intell. 52 (1) (2008)
Roman Barták, Ondrej Cepek
Nested temporal networks with alternatives: recognition and tractability. SAC (2008)
Roman Barták, Ondrej Cepek
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models. AIMSA (2008)
Roman Barták, Ondrej Cepek
Incremental Filtering Algorithms for Precedence and Dependency Constraints. Int. J. Artif. Intell. Tools 17 (1) (2008)
Roman Barták, Ondrej Cepek, Pavel Surynek
Modelling Alternatives in Temporal Networks. CISched (2007)
Roman Barták, Ondrej Cepek
Temporal Networks with Alternatives: Complexity and Model. FLAIRS Conference (2007)
Roman Barták, Ondrej Cepek, Martin Hejna
Temporal Reasoning in Nested Temporal Networks with Alternatives. CSCLP (2007)
Roman Barták, Ondrej Cepek
Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach. ICAPS (2006)
Roman Barták, Ondrej Cepek
A Constraint Model for State Transitions in Disjunctive Resources. CSCLP (2006)
Roman Barták, Ondrej Cepek
Incremental Filtering Algorithms for Precedence and Dependency Constraints. ICTAI (2006)
Ondrej Cepek, Shao Chin Sung
A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. Comput. Oper. Res. 32 (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)
Petr Vilím, Roman Barták, Ondrej Cepek
) Filtering Algorithms for the Unary Resource Constraint to Optional Activities. Constraints An Int. J. 10 (4) (2005)
Petr Vilím, Roman Barták, Ondrej Cepek
Unary Resource Constraint with Optional Activities. CP (2004)
Ondrej Cepek, Masanori Okada, Milan Vlach
Nonpreemptive flowshop scheduling with machine dominance. Eur. J. Oper. Res. 139 (2) (2002)
Bert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek
A Satisfiability Formulation of Problems on Level Graphs. Electron. Notes Discret. Math. 9 (2001)
Endre Boros, Ondrej Cepek, Alexander Kogan
Horn Minimization by Iterative Decomposition. Ann. Math. Artif. Intell. 23 (3-4) (1998)
Endre Boros, Ondrej Cepek
. Discret. Math. (1997)
Ondrej Cepek, Milan Vlach, Dominique de Werra
Nonpreemptive open shop with restricted processing times. Math. Methods Oper. Res. 39 (2) (1994)