There are several ways of classifying theorem-proving strategies. The primary classification key in this taxonomy is to distinguish between those strategies that work on a set of objects (e.g., clauses) and develop implicitly many proof attempts, and those strategies that work on one object at a time (e.g., a goal clause, or a tableau) and develop one proof attempt at a time, backtracking when the current proof attempt cannot be completed into a proof.
Theorem proving strategies: a search-oriented taxonomy (Position paper)
BONACINA, Maria Paola
1998-01-01
Abstract
There are several ways of classifying theorem-proving strategies. The primary classification key in this taxonomy is to distinguish between those strategies that work on a set of objects (e.g., clauses) and develop implicitly many proof attempts, and those strategies that work on one object at a time (e.g., a goal clause, or a tableau) and develop one proof attempt at a time, backtracking when the current proof attempt cannot be completed into a proof.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
FTP1998taxonomy.pdf
accesso aperto
Descrizione: Articolo
Tipologia:
Documento in Post-print
Licenza:
Creative commons
Dimensione
66.61 kB
Formato
Adobe PDF
|
66.61 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.