Petr Kučera
Título
Citado por
Citado por
Ano
A subclass of Horn CNFs optimally compressible in polynomial time
E Boros, O Čepek, A Kogan, P Kučera
Annals of Mathematics and Artificial Intelligence 57 (3), 249-291, 2009
262009
Properties of SLUR formulae
O Čepek, P Kučera, V Vlček
International Conference on Current Trends in Theory and Practice of …, 2012
212012
Exclusive and essential sets of implicates of Boolean functions
E Boros, O Čepek, A Kogan, P Kučera
Discrete Applied Mathematics 158 (2), 81-96, 2010
202010
A decomposition method for CNF minimality proofs
E Boros, O Čepek, P Kučera
Theoretical Computer Science 510, 111-126, 2013
192013
Complexity issues related to propagation completeness
M Babka, T Balyo, O Čepek, Š Gurský, P Kučera, V Vlček
Artificial Intelligence 203, 19-34, 2013
162013
Boolean functions with a simple certificate for CNF complexity
P Kučera, P Savický
Discrete Applied Mathematics 160 (4-5), 365-382, 2012
132012
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
O Čepek, P Kučera
Discrete applied mathematics 149 (1-3), 14-52, 2005
112005
On hierarchies over the SLUR class
T Balyo, Š Gurský, P Kucera, V Vlcek
Twelfth International Symposium on Artificial Intelligence and Mathematics …, 2012
102012
Recognition of interval Boolean functions
O Čepek, D Kronus, P Kučera
Annals of Mathematics and Artificial Intelligence 52 (1), 1-24, 2008
92008
On the complexity of minimizing the number of literals in horn formulae
O Cepek, P Kucera
MIS 2004, 3, 2008
72008
Hydras: Complexity on general graphs and a subclass of trees
P Kučera
Theoretical Computer Science 658, 399-416, 2017
62017
Boolean functions with long prime implicants
O Čepek, P Kučera, S Kuřík
Information Processing Letters 113 (19-21), 698-703, 2013
52013
A lower bound on CNF encodings of the at-most-one constraint
P Kučera, P Savický, V Vorel
Theoretical Computer Science 762, 51-73, 2019
42019
Propagation complete encodings of smooth DNNF theories
P Kučera, P Savický
arXiv preprint arXiv:1909.06673, 2019
22019
Disjoint essential sets of implicates of a CQ Horn function
O Čepek, P Kučera
Annals of Mathematics and Artificial Intelligence 61 (3), 231-244, 2011
22011
Application of DES theory to verification of software components
K Hiraishi, P Kucera
IEICE transactions on fundamentals of electronics, communications and …, 2009
22009
Generating models of a matched formula with a polynomial delay
P Savický, P Kučera
Journal of Artificial Intelligence Research 56, 379-402, 2016
12016
On minimum representations of matched formulas
O Cepek, S Gursky, P Kucera
Journal of Artificial Intelligence Research 51, 707-723, 2014
12014
Analysing DNA microarray data using Boolean techniques
O Čepek, D Kronus, P Kučera
Annals of Operations Research 188 (1), 77-110, 2011
12011
Renamable interval extensions of partially defined boolean functions
O Cepek, D Kronus, P Kucera
WSEAS Transactions on Mathematics 6 (4), 559, 2007
12007
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20