3 citations · 5 across the 6 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.AI2018
Backdoor Decomposable Monotone Circuits and their Propagation Complete Encodings
Petr Kučera, Petr Savický
We describe a compilation language of backdoor decomposable monotone circuits (BDMCs) which generalizes several concepts appearing in the literature, e.g. DNNFs and backdoor trees.…
cs.DS2018★ 1 cited
Approximating minimum representations of key Horn functions
Kristóf Bérczi, Endre Boros, Ondřej Čepek +2
Horn functions form a subclass of Boolean functions and appear in many different areas of computer science and mathematics as a general tool to describe implications and dependenci…
cs.DS2018
Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability
Miloš Chromý, Petr Kučera
A matched formula is a CNF formula whose incidence graph admits a matching which matches a distinct variable to every clause. We study phase transition in a context of matched form…