Pubblicazioni

Autori:

Bonacina, Maria Paola

Titolo:

Towards a unified model of search in theorem proving: subgoal-reduction strategies

Anno:

2005

Tipologia prodotto:

Articolo in Rivista

Tipologia ANVUR:

Articolo su rivista

Lingua:

Inglese

Formato:

A Stampa

Referee:

Sì

Nome rivista:

Journal of Symbolic Computation

ISSN Rivista:

0747-7171

N° Volume:

39

Numero o Fascicolo:

2

Editore:

Elsevier

Intervallo pagine:

209-255

Parole chiave:

Automated theorem proving; search complexity; analysis of; subgoal-reduction strategies; tableau-based strategies; model elimination; marked search-graphs; bounded search spaces; analytic and synthetic strategies

Breve descrizione dei contenuti:

This paper advances the design of a unified model for the representation of search in first-order clausal theorem proving, by extending to tableau-based subgoal-reduction strategies (e.g., model-elimination tableaux), the marked search-graph model, already introduced for ordering-based strategies, those that use (ordered) resolution, paramodulation/superposition, simplification, and subsumption. The resulting analytic marked search-graphs subsume AND-OR graphs, and allow us to represent those dynamic components, such as backtracking and instantiation of rigid variables, that have long been an obstacle to model subgoal-reduction strategies properly. The second part of the paper develops for analytic marked search graphs the bounded search spaces approach to the analysis of infinite search spaces. We analyze how tableau inferences and backtracking affect the bounded search spaces during a derivation. Then, we apply this analysis to measure the effects of regularity and lemmatization by folding-up on search complexity, by comparing the bounded search spaces of strategies with and without these features. We conclude with a discussion comparing the marked search-graphs for tableaux, linear resolution and ordering-based strategies, showing how this search model applies across these classes of strategies.

Pagina Web:

http://dx.doi.org/10.1016/j.jsc.2004.11.001
https://mariapaola.github.io/

Id prodotto:

20899

Handle IRIS:

11562/300528

depositato il:

15 marzo 2012

ultima modifica:

16 settembre 2023

Citazione bibliografica:

Bonacina, Maria Paola, Towards a unified model of search in theorem proving: subgoal-reduction strategies «Journal of Symbolic Computation» , vol. 39 , n. 2 , 2005 , pp. 209-255

Consulta la scheda completa presente nel repository istituzionale della Ricerca di Ateneo