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...
| Published in: | Logical Methods in Computer Science |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2023-05-01
|
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/9928/pdf |