#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2010

2013

- This year (0)
- Last 5 years (3)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ondrej Cepek, Petr Kucera, Václav Vlcek
- SOFSEM
- 2012

- Václav Vlcek, Tomas Balyo, Stefan Gurský, Petr Kucera
- ISAIM
- 2012

SLUR is a class of the CNF formulae on which the single lookahead unit resolution algorithm for satisfiability (SAT) testing never fails. It is known that the SLUR class contains classes of Horn, hidden Horn, (hidden) extended Horn and balanced formulae as a subclass. In recent paper it was proven that the SLUR class contains all canonical formulae. In this… (More)

- Martin Babka, Tomas Balyo, Ondrej Cepek, Stefan Gurský, Petr Kucera, Václav Vlcek
- Artif. Intell.
- 2013

Knowledge compilation is a process of adding more information to a knowledge base in order to make it easier to deduce facts from the compiled base than from the original one. One type of knowledge compilation occurs when the knowledge in question is represented by a Boolean formula in conjunctive normal form (CNF). The goal of knowledge compilation in this… (More)

- Václav Vlcek
- 2010

We present an overview of known classes of Boolean formulae for which polynomial time algorithms for satisfiability testing (SAT) are known. We will summarize basic properties of these classes and their mutual relations with respect to inclusion. One of these classes on which we focus our attention in particular is the class of Single Lookahead Unit… (More)

- Tomas Balyo, Štefan Gurský, Petr Kucera, Václav Vlcek
- 2011

Single look-ahead unit resolution (SLUR) algorithm is a nondeterministic polynomial time algorithm which for a given input formula in a conjunctive normal form (CNF) either outputs its satisfying assignment or gives up. A CNF formula belongs to the SLUR class if no sequence of nondeterministic choices causes the SLUR algorithm to give up on it. The SLUR… (More)

- ‹
- 1
- ›