| Presentation | 2003/6/11 Density Condensation of Boolean Formulas Yoichi HANATANI, Takashi HORIYAMA, Kazuo IWAMA, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The following problem is considered: Given a Boolean formula &fnof:, generate another formula q such that: (i)If &fnof: is unsatisfiable then q is also unsatisfiable. (ii) If &fnof: is satisfiable then q is also satisfiable and furthermore is "easier" than &fnof:. For the measure of this easiness, we use the density of a formula &fnof: which is defined as (the number of satisfying assignments) / 2^n, where n is the number of Boolean variables of &fnof:. In this paper, we mainly consider the case that the input formula &fnof: is given as a 3-CNF formula and the output formula q may be any formula using Boolean AND, OR and negation. Two different approaches to this problem are presented: One is to obtain q by reducing the number of variables and the other by increasing the number of variables, both of which are based on existing SAT algorithms. Our performance evaluation shows that, a little surprisingly, better SAT algorithms do not always give us better density-condensation algorithms. This is a preliminary report of the on-going research. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Boolean formulas / Satisfiability problems / Computational complexity |
| Paper # | COMP2003-20 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2003/6/11(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Density Condensation of Boolean Formulas |
| Sub Title (in English) | |
| Keyword(1) | Boolean formulas |
| Keyword(2) | Satisfiability problems |
| Keyword(3) | Computational complexity |
| 1st Author's Name | Yoichi HANATANI |
| 1st Author's Affiliation | Graduate School of Informatics Kyoto University() |
| 2nd Author's Name | Takashi HORIYAMA |
| 2nd Author's Affiliation | Graduate School of Informatics Kyoto University |
| 3rd Author's Name | Kazuo IWAMA |
| 3rd Author's Affiliation | Graduate School of Informatics Kyoto University |
| Date | 2003/6/11 |
| Paper # | COMP2003-20 |
| Volume (vol) | vol.103 |
| Number (no) | 119 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |