Composing and Controlling Search in Reasoning Theories using Mappings (1998)
BibTeX
@MISC{Meseguer98composingand,
author = {Coglio Giunchiglia Meseguer and Scientifica E Tecnologica and A. Coglio and F. Giunchiglia and J. Meseguer and C. Talcott and Alessandro Coglio and Fausto Giunchiglia and Jose Meseguer and Carolyn L. Talcott},
title = {Composing and Controlling Search in Reasoning Theories using Mappings},
year = {1998}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Reasoning theories can be used to specify heterogeneous reasoning systems. In this paper we present an equational version of reasoning theories, and we study their structuring and composition, and the use of annotated assertions for the control of search, as mappings between reasoning theories. We define composability and composition using the notion of faithful inclusion mapping, we define annotated reasoning theories using the notion of erasing mapping, and we lift composability and composition to consider also annotations. As an example, we give a modular specification of the top-level control (known as waterfall) of NQTHM, the Boyer-Moore theorem prover.
