Остановите войну!
for scientists:
default search action
Petr Kucera
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c15]Petr Illner, Petr Kucera:
A Compiler for Weak Decomposable Negation Normal Form. AAAI 2024: 10562-10570 - 2023
- [c14]Petr Kucera:
Binary Constraint Trees and Structured Decomposability. CP 2023: 22:1-22:19 - 2022
- [j21]Petr Kucera, Petr Savický:
Propagation complete encodings of smooth DNNF theories. Constraints An Int. J. 27(3): 327-359 (2022) - [j20]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Approximating Minimum Representations of Key Horn Functions. SIAM J. Comput. 51(1): 116-138 (2022) - [j19]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Unique key Horn functions. Theor. Comput. Sci. 922: 170-178 (2022) - [c13]Petr Kucera:
Learning a Propagation Complete Formula. CPAIOR 2022: 214-231 - 2021
- [j18]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: 68-74 (2021) - [c12]Petr Kucera, Petr Savický:
Backdoor Decomposable Monotone Circuits and Propagation Complete Encodings. AAAI 2021: 3832-3840 - 2020
- [j17]Petr Kucera, Petr Savický:
Bounds on the Size of PC and URC Formulas. J. Artif. Intell. Res. 69: 1395-1420 (2020) - [c11]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Approximating minimum representations of key Horn functions. ISAIM 2020 - [c10]Petr Kucera, Petr Savický:
On the size of CNF formulas with high propagation strength. ISAIM 2020 - [i8]Petr Kucera, Petr Savický:
Bounds on the size of PC and URC formulas. CoRR abs/2001.00819 (2020) - [i7]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino:
Generating clause sequences of a CNF formula. CoRR abs/2002.06727 (2020) - [i6]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Unique key Horn functions. CoRR abs/2002.06964 (2020)
2010 – 2019
- 2019
- [j16]Petr Kucera, Petr Savický, Vojtech Vorel:
A lower bound on CNF encodings of the at-most-one constraint. Theor. Comput. Sci. 762: 51-73 (2019) - [c9]Milos Chromý, Petr Kucera:
Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability. SOFSEM 2019: 108-121 - [i5]Petr Kucera, Petr Savický:
Propagation complete encodings of smooth DNNF theories. CoRR abs/1909.06673 (2019) - 2018
- [i4]Milos Chromý, Petr Kucera:
Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability. CoRR abs/1808.01774 (2018) - [i3]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Approximating minimum representations of key Horn functions. CoRR abs/1811.05160 (2018) - [i2]Petr Kucera, Petr Savický:
Backdoor Decomposable Monotone Circuits and their Propagation Complete Encodings. CoRR abs/1811.09435 (2018) - 2017
- [j15]Petr Kucera:
Hydras: Complexity on general graphs and a subclass of trees. Theor. Comput. Sci. 658: 399-416 (2017) - [c8]Ondrej Cepek, Stefan Gurský, Petr Kucera:
On Minimum Representations of Matched Formulas (Extended Abstract). IJCAI 2017: 4980-4984 - [c7]Petr Savický, Petr Kucera:
Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract). IJCAI 2017: 5055-5059 - [c6]Petr Kucera, Petr Savický, Vojtech Vorel:
A Lower Bound on CNF Encodings of the At-Most-One Constraint. SAT 2017: 412-428 - [i1]Petr Kucera, Petr Savický, Vojtech Vorel:
A lower bound on CNF encodings of the at-most-one constraint. CoRR abs/1704.08934 (2017) - 2016
- [j14]Petr Savický, Petr Kucera:
Generating Models of a Matched Formula With a Polynomial Delay. J. Artif. Intell. Res. 56: 379-402 (2016) - [c5]Petr Savický, Petr Kucera:
Generating models of a matched formula with a polynomial delay. ISAIM 2016 - 2014
- [j13]Ondrej Cepek, Stefan Gurský, Petr Kucera:
On Minimum Representations of Matched Formulas. J. Artif. Intell. Res. 51: 707-723 (2014) - [c4]Petr Kucera:
Hydras: Complexity on general graphs and a subclass of trees. ISAIM 2014 - 2013
- [j12]Martin Babka, Tomás Balyo, Ondrej Cepek, Stefan Gurský, Petr Kucera, Václav Vlcek:
Complexity issues related to propagation completeness. Artif. Intell. 203: 19-34 (2013) - [j11]Ondrej Cepek, Petr Kucera, Stanislav Kurik:
Boolean functions with long prime implicants. Inf. Process. Lett. 113(19-21): 698-703 (2013) - [j10]Endre Boros, Ondrej Cepek, Petr Kucera:
A decomposition method for CNF minimality proofs. Theor. Comput. Sci. 510: 111-126 (2013) - 2012
- [j9]Ondrej Cepek, Petr Kucera, Petr Savický:
Boolean functions with a simple certificate for CNF complexity. Discret. Appl. Math. 160(4-5): 365-382 (2012) - [c3]Ondrej Cepek, Petr Kucera, Stanislav Kurik:
Boolean functions with long prime implicants. ISAIM 2012 - [c2]Václav Vlcek, Tomás Balyo, Stefan Gurský, Petr Kucera:
On hierarchies over the SLUR class. ISAIM 2012 - [c1]Ondrej Cepek, Petr Kucera, Václav Vlcek:
Properties of SLUR Formulae. SOFSEM 2012: 177-189 - 2011
- [j8]Ondrej Cepek, Petr Kucera:
Disjoint essential sets of implicates of a CQ Horn function. Ann. Math. Artif. Intell. 61(3): 231-244 (2011) - [j7]Ondrej Cepek, David Kronus, Petr Kucera:
Analysing DNA microarray data using Boolean techniques. Ann. Oper. Res. 188(1): 77-110 (2011) - 2010
- [j6]Endre Boros, Ondrej Cepek, Alexander Kogan, Petr Kucera:
Exclusive and essential sets of implicates of Boolean functions. Discret. Appl. Math. 158(2): 81-96 (2010)
2000 – 2009
- 2009
- [j5]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): 249-291 (2009) - [j4]Kunihiko Hiraishi, Petr Kucera:
Application of DES Theory to Verification of Software Components. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(2): 604-610 (2009) - 2008
- [j3]Ondrej Cepek, David Kronus, Petr Kucera:
Recognition of interval Boolean functions. Ann. Math. Artif. Intell. 52(1): 1-24 (2008) - 2005
- [j2]Ondrej Cepek, Petr Kucera:
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing. Discret. Appl. Math. 149(1-3): 14-52 (2005) - [j1]Petr Kucera:
On the size of maximum renamable Horn sub-CNF. Discret. Appl. Math. 149(1-3): 126-130 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint