5 citations · 9 across the 3 of their papers we have counts for
5 papers
Bounds on the size of PC and URC formulas
Petr Kučera, Petr Savický
In this paper we investigate CNF formulas, for which the unit propagation is strong enough to derive a contradiction if the formula together with a partial assignment of the variab…
Propagation complete encodings of smooth DNNF theories
Petr Kučera, Petr Savický
We investigate conjunctive normal form (CNF) encodings of a function represented with a decomposable negation normal form (DNNF). Several encodings of DNNFs and decision diagrams w…
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.…
A lower bound on CNF encodings of the at-most-one constraint
Petr Kučera, Petr Savický, Vojtěch Vorel
Constraint "at most one" is a basic cardinality constraint which requires that at most one of its boolean inputs is set to . This constraint is widely used when translating…
Term satisfiability in FL-algebras
Zuzana Haniková, Petr Savický
FL-algebras form the algebraic semantics of the full Lambek calculus with exchange and weakening. We investigate two relations, called satisfiability and positive sat…