Publications

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

Authors:
Maria Paola Bonacina
Title:
Towards a unified model of search in theorem proving: subgoal-reduction strategies
Year:
2005
Type of item:
Articolo in Rivista
Tipologia ANVUR:
Articolo su rivista
Language:
Inglese
Format:
A Stampa
Referee:
Name of journal:
Journal of Symbolic Computation
ISSN of journal:
0747-7171
N° Volume:
39
Number or Folder:
2
:
Elsevier
Page numbers:
209-255
Short description of contents:
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.
Web page:
http://dx.doi.org/10.1016/j.jsc.2004.11.001; http://profs.sci.univr.it/~bonacina/
Product ID:
20899
Handle IRIS:
11562/300528
Deposited On:
March 15, 2012
Last Modified:
May 22, 2017
Bibliographic citation:
Maria Paola Bonacina, Towards a unified model of search in theorem proving: subgoal-reduction strategies «Journal of Symbolic Computation» , vol. 39 , n. 22005pp. 209-255

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

Related projects
Title Department Managers
Sintesi di procedure di decisione basate sulla deduzione con applicazioni all'analisi formale automatica di programmi (PRIN 2003) Department Informatica Maria Paola Bonacina
<<back

Activities

Research facilities