Multi-Resolution on Compressed Sets of Clauses (2000)
| Venue: | Proc. of 12th International Conference on Tools with Artificial Intelligence (ICTAI-2000 |
| Citations: | 28 - 4 self |
BibTeX
@INPROCEEDINGS{Chatalic00multi-resolutionon,
author = {Philippe Chatalic and Laurent Simon},
title = {Multi-Resolution on Compressed Sets of Clauses},
booktitle = {Proc. of 12th International Conference on Tools with Artificial Intelligence (ICTAI-2000},
year = {2000},
pages = {2--10}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper presents a system based on new operators for handling sets of propositional clauses represented by means of ZBDDs. The high compression power of such data structures allows efficient encodings of structured instances. A specialized operator for the distribution of sets of clauses is introduced and used for performing multi-resolution on clause sets. Cut eliminations between sets of clauses of exponential size may then be performed using polynomial size data structures. The ZRES system, a new implementation of the Davis-Putnam procedure of 1960, solves two hard problems for resolution, that are currently out of the scope of the best SAT provers. 1
