论文信息 - Extending automatic theorem proving by planning

Extending automatic theorem proving by planning

A general concept for combining planning with automatic theorem provingis introduced. From this a system architecture based on the notion of planningtrees, methods and sensors is developed. It is illustrated by examples taken fromthe domain of sorting algorithms.

Jörg Denzinger | J. Denzinger | Inger Sonntag | Inger Sonntag

[1] Leo Bachmair. Proof methods for equational theories , 1987 .

[2] A. Newell. The heuristic of George Polya and its relation to artificial intelligence , 1981 .

[3] Leo Bachmair,et al. Proof by consistency in equational theories , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[4] Alan Bundy,et al. The Use of Explicit Plans to Guide Inductive Proofs , 1988, CADE.

[5] Robert S. Boyer,et al. A computational logic handbook , 1979, Perspectives in computing.

[6] Maritta Heisel,et al. An Interactive Verification System Based on Dynamic Logic , 1986, CADE.

[7] Jürgen Müller,et al. EQTHEOPOGLES - A Completion Theorem Prover for PLIEQ , 1989, GWAI.