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...
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Logical Methods in Computer Science e.V.
2023-05-01
|
| coleção: | Logical Methods in Computer Science |
| Assuntos: | |
| Acesso em linha: | https://lmcs.episciences.org/9928/pdf |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|