Skip to main content
Article thumbnail
Location of Repository

Parameterized abstractions used for proof-planning

By Serge Autexier and Dieter Hutter


In order to cope with large case studies arising from the application of formal methods in an industrial setting, this paper presents new techniques to support hierarchical proof planning. Following the paradigm of difference reduction, proofs are obtained by removing syntactical differences between parts of the formula to be proven step by step. To guide this manipulation we introduce dynamic abstractions of terms. These abstractions are parameterized by the individual goals of the manipulation and are especially designed to ease the proof search based on heuristics. The hierarchical approach and thus the decomposition of the original goal into several subgoals enables the use of different abstractions or different parameters of an abstraction within the proof search. In this paper we will present one of these dynamic abstractions together with heuristics to guide the proof search in the abstract space

Topics: Künstliche Intelligenz, Data processing Computer science
Publisher: Sonstige Einrichtungen. DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Year: 1997
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.