Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Savický, Petr"'
Autor:
Savický, Petr
Two CNF formulas are called ucp-equivalent, if they behave in the same way with respect to the unit clause propagation (UCP). A formula is called ucp-irredundant, if removing any clause leads to a formula which is not ucp-equivalent to the original o
Externí odkaz:
http://arxiv.org/abs/2309.01750
Autor:
Savický, Petr
A distance magic labeling of an $n$-dimensional hypercube is a labeling of its vertices by natural numbers from $\{0, \ldots, 2^n-1\}$, such that for all vertices $v$ the sum of the labels of the neighbors of $v$ is the same. Such a labeling is calle
Externí odkaz:
http://arxiv.org/abs/2102.08212
Autor:
Kučera, Petr, Savický, Petr
Publikováno v:
Journal of Artificial Intelligence Research 69 (2020) 1395-1420
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 variables is unsatisfiable (unit refutation complete or URC formulas) or add
Externí odkaz:
http://arxiv.org/abs/2001.00819
Autor:
Kučera, Petr, Savický, Petr
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 were considered by (Abio et al. 2016). The authors differentiate betwee
Externí odkaz:
http://arxiv.org/abs/1909.06673
Autor:
Kučera, Petr, Savický, Petr
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 $\mathcal{C}$-BDMC sentence is a monotone circuit which satisfies d
Externí odkaz:
http://arxiv.org/abs/1811.09435
Publikováno v:
Theoretical Computer Science, Volume 762, 2019, pp. 51-73
Constraint "at most one" is a basic cardinality constraint which requires that at most one of its $n$ boolean inputs is set to $1$. This constraint is widely used when translating a problem into a conjunctive normal form (CNF) and we investigate its
Externí odkaz:
http://arxiv.org/abs/1704.08934
Autor:
Haniková, Zuzana, Savický, Petr
Publikováno v:
Theoretical Computer Science, Vol. 631, June 2016, pp. 1-15
FL$_\mathrm{ew}$-algebras form the algebraic semantics of the full Lambek calculus with exchange and weakening. We investigate two relations, called satisfiability and positive satisfiability, between FL$_\mathrm{ew}$-terms and FL$_\mathrm{ew}$-algeb
Externí odkaz:
http://arxiv.org/abs/1501.02250
Publikováno v:
In Theoretical Computer Science 1 March 2019 762:51-73
Autor:
Šíma, Jiří, Savický, Petr
Publikováno v:
In Theoretical Computer Science 11 April 2018 720:1-23
Autor:
Haniková, Zuzana, Savický, Petr
Publikováno v:
In Theoretical Computer Science 6 June 2016 631:1-15