Structured Incremental Proof Planning
نویسندگان
چکیده
We extend our framework of incremental proof planning. By employing nested sets of metarules the formulation of strategies may be structured. By switching to another metarule set the planner can adjust to a new situation within the proof. The new metarule set represents a more specialized strategy better suited for the current situation. We deene the semantics of our framework by an inference system.
منابع مشابه
A TLA+ Proof System
We describe an extension to the TLA specification language with constructs for writing proofs and a proof environment, called the Proof Manager (PM), to checks those proofs. The language and the PM support the incremental development and checking of hierarchically structured proofs. The PM translates a proof into a set of independent proof obligations and calls upon a collection of back-end pro...
متن کاملSeki Report Island Planning and Reenement Island Planning and Reenement
Proof planning is an alternative to classical theorem proving. Proof planning is classical planning with no goal interaction. It faces search problems because of long solutions and possibly innnite branching. It is also required to provide plans comprehensible for the user. This article introduces new planning strategies inspired by proof planning examples in order to tackle the search-space-pr...
متن کاملSoftware project initiation and planning - an empirical study
This paper describes a study of 14 software companies, on how they initiate and pre-plan software projects. The aim was to obtain an indication of the range of planning activities carried out. The study, using a convenience sample, was carried out using structured interviews, with questions about early software project planning activities. The study offers evidence that an iterative and increme...
متن کاملThe DeltaUp Constraint Solver : Correctness Proof
The DeltaBlue algorithm is known as a fast incremental constraint solver based on local propagation and is widely used for constructing graphical user interface and algorithm animation. The primary tasks of the planning phase of DeltaBlue are method selections. In this paper, we prove that DeltaUp, which is a modi cation of DeltaBlue, minimizes the number of method selections in every planning ...
متن کاملProof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal Logic (FOLTL), which can be seen as a quantified version of Linear Temporal Logic, overcoming its finitary limitation. Automated reasoning in FOLTL is hard, since it is non-recursively enumerable; but its expressivenes...
متن کامل