Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Ondřej Čepek"'
Autor:
Miloš Chromý, Ondřej Čepek
Publikováno v:
Journal of Artificial Intelligence Research. 69
In this paper, we focus on a less usual way to represent Boolean functions, namely on representations by switch-lists, which are closely related to interval representations. Given a truth table representation of a Boolean function f the switch-list r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8acb7680d51ef23246abfcfd56ae8f52
https://doi.org/10.1613/jair.1.12199
https://doi.org/10.1613/jair.1.12199
Given a relational database, a key is a set of attributes such that a value assignment to this set uniquely determines the values of all other attributes. The database uniquely defines a pure Horn function $h$, representing the functional dependencie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::046617c08240f343174b66978da4a746
http://arxiv.org/abs/2002.06964
http://arxiv.org/abs/2002.06964
Autor:
Ondřej Čepek, Radek Hušek
Publikováno v:
Discrete Optimization. 23:1-19
In this paper we focus on a less common way how to represent Boolean functions, namely on representations by intervals of truepoints and by switch-lists. There are two problems connected to such representation: (1) a knowledge compilation problem, i.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f8ce9190949e26b8ab85f1ad9dfcff6b
https://doi.org/10.1016/j.disopt.2016.11.002
https://doi.org/10.1016/j.disopt.2016.11.002
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 dependencies. Finding minimum sized representations for such functions with resp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f249584a004ee5caef0f55b831cb7497
http://arxiv.org/abs/1811.05160
http://arxiv.org/abs/1811.05160
Publikováno v:
IJCAI
A Boolean formula in conjunctive normal form (CNF) is called matched if the system of sets of variables which appear in individual clauses has a system of distinct representatives. We present here two results for matched CNFs: The first result is a s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d6579e88f1e568ede7e03941ad3cc71
https://doi.org/10.24963/ijcai.2017/706
https://doi.org/10.24963/ijcai.2017/706
Publikováno v:
Fundamentals of Computation Theory ISBN: 9783662557501
FCT
FCT
A pure Horn CNF is minimal if no shorter pure Horn CNF representing the same function exists, where the CNF length may mean several different things, e.g. the number of clauses, or the total number of literals (sum of clause lengths), or the number o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b2f35be461ca7bec90aa164ae3abd33
https://doi.org/10.1007/978-3-662-55751-8_11
https://doi.org/10.1007/978-3-662-55751-8_11
Publikováno v:
Discrete Applied Mathematics. 160:365-382
In this paper we study relationships between CNF representations of a given Boolean function f and essential sets of implicates of f . It is known that every CNF representation and every essential set must intersect. Therefore the maximum number of p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::30a80991be33dc23b10d39abe28ab1a1
https://doi.org/10.1016/j.dam.2011.05.013
https://doi.org/10.1016/j.dam.2011.05.013
Autor:
Petr Kučera, Ondřej Čepek
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 61:231-244
In this paper we study a class of CQ Horn functions introduced in Boros et al. (Ann Math Artif Intell 57(3---4):249---291, 2010). We prove that given a CQ Horn function f, the maximal number of pairwise disjoint essential sets of implicates of f equa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::352a0bc0f46d69137924b783e147ac38
https://doi.org/10.1007/s10472-011-9263-9
https://doi.org/10.1007/s10472-011-9263-9
Publikováno v:
Annals of Operations Research. 188:77-110
We address in this manuscript a problem arising in molecular biology, namely a problem of discovering dependencies among gene expression levels. The problem is formulated in mathematical terms as a search for a fully defined three valued function def
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f19e1c1638b2456a6e5926c53724b728
https://doi.org/10.1007/s10479-010-0723-0
https://doi.org/10.1007/s10479-010-0723-0
Autor:
Ondřej Čepek, Roman Barták
Publikováno v:
Transactions of the Institute of Measurement and Control. 32:73-96
Constraint-based scheduling is a powerful tool for solving complex real-life scheduling problems thanks to a natural integration of special solving algorithms encoded in so-called global constraints. Global constraints describe subproblems of the sch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::648aba1eb23dfe25d668ba3e905b77c5
https://doi.org/10.1177/0142331208100099
https://doi.org/10.1177/0142331208100099