SAT-Inspired Higher-Order Eliminations
We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations. These techniques eliminate literals, clauses, or predicate symbols from the problem, with the aim of making it more amenable to automatic proof search. We also introd...
| 發表在: | Logical Methods in Computer Science |
|---|---|
| Main Authors: | , |
| 格式: | Article |
| 語言: | 英语 |
| 出版: |
Logical Methods in Computer Science e.V.
2023-05-01
|
| 主題: | |
| 在線閱讀: | https://lmcs.episciences.org/9928/pdf |