Impasse-Driven Reasoning in Proof Planning

2006 ◽  
pp. 143-158
Author(s):  
Andreas Meier ◽  
Erica Melis
Keyword(s):  
Proof Planning

Future-proof planning of foreign plants

2012 ◽  
Vol 1 (6) ◽  
pp. 42-46
Author(s):  
Heiko Barth
Keyword(s):  
Proof Planning

scholarly journals The Use of Proof Planning for Co-operative Theorem Proving

1998 ◽  
Vol 25 (2) ◽  
pp. 239-261 ◽  
Author(s):  
H. Lowe ◽  
A. Bundy ◽  
D. McLean
Keyword(s):  
Theorem Proving ◽  
Proof Planning

scholarly journals Proof planning for maintainable configuration systems

1998 ◽  
Vol 12 (4) ◽  
pp. 345-356 ◽  
Author(s):  
HELEN LOWE ◽  
MICHAL PECHOUCEK ◽  
ALAN BUNDY
Keyword(s):  
Case Studies ◽  
Constraint Satisfaction ◽  
Soft Constraints ◽  
Complex Task ◽  
Knowledge Based Systems ◽  
Proof Of Concept ◽  
Proof Planning ◽  
Knowledge Based ◽  
Planning Technique ◽  
Configuration Systems

Configuration is a complex task generally involving varying measures of constraint satisfaction, optimization, and the management of soft constraints. Although many successful systems have been developed, these are often difficult to maintain and to generalize in rapidly changing domains. In this paper, we consider building intelligent knowledge-based systems with maintainability well to the fore in our requirements for such systems. We introduce two case studies: the initial proof of concept, which was in the domain of computer configuration, and a further field-tested study, the configuration of compressors. Central to our approach is the use of the proof planning technique, and the clean separation of different kinds of knowledge: factual, heuristic, and strategic.

Refinement and Term Synthesis in Loop Invariant Generation

10.29007/5wpt ◽  
2018 ◽  
Author(s):  
Ewen Maclean ◽  
Andrew Ireland ◽  
Lucas Dixon ◽  
Robert Atkey
Keyword(s):  
Program Analysis ◽  
Loop Invariant ◽  
Proof Planning ◽  
Invariant Generation ◽  
Correctness Proofs ◽  
Complex Problems

We present a technique for refining incorrect or insufficiently strong loop invariants in correctness proofs for imperative programs. We rely on previous work [16] in combining program analysis and Proof Planning, and exploit IsaPlanner’s use of meta-variables and goal-naming to generate correct loop invariants. We present a simple example in detail and show how this scales to more complex problems.

scholarly journals Knowledge-based proof planning

1999 ◽  
Vol 115 (1) ◽  
pp. 65-105 ◽  
Author(s):  
Erica Melis ◽  
Jörg Siekmann
Keyword(s):  
Proof Planning ◽  
Knowledge Based
Sign in / Sign up

Export Citation Format

Share Document