Загрузка...
Short Q-Resolution Proofs with Homomorphisms
We introduce new proof systems for quantified Boolean formulas (QBFs) by enhancing Q-resolution systems with rules which exploit local and global symmetries. The rules are based on homomorphisms that admit non-injective mappings between literals. This results in systems that are stronger than Q-reso...
Сохранить в:
| Опубликовано в: : | Theory and Applications of Satisfiability Testing – SAT 2020 |
|---|---|
| Главные авторы: | , , |
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
2020
|
| Предметы: | |
| Online-ссылка: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7326547/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-51825-7_29 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|