0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Mathematical foundations

Buy Now

Automated Mathematical Induction (Paperback, Softcover reprint of the original 1st ed. 1996) Loot Price: R2,988
Discovery Miles 29 880
Automated Mathematical Induction (Paperback, Softcover reprint of the original 1st ed. 1996): Hantao Zhang

Automated Mathematical Induction (Paperback, Softcover reprint of the original 1st ed. 1996)

Hantao Zhang

 (sign in to rate)
Loot Price R2,988 Discovery Miles 29 880 | Repayment Terms: R280 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

It has been shown how the common structure that defines a family of proofs can be expressed as a proof plan [5]. This common structure can be exploited in the search for particular proofs. A proof plan has two complementary components: a proof method and a proof tactic. By prescribing the structure of a proof at the level of primitive inferences, a tactic [11] provides the guarantee part of the proof. In contrast, a method provides a more declarative explanation of the proof by means of preconditions. Each method has associated effects. The execution of the effects simulates the application of the corresponding tactic. Theorem proving in the proof planning framework is a two-phase process: 1. Tactic construction is by a process of method composition: Given a goal, an applicable method is selected. The applicability of a method is determined by evaluating the method's preconditions. The method effects are then used to calculate subgoals. This process is applied recursively until no more subgoals remain. Because of the one-to-one correspondence between methods and tactics, the output from this process is a composite tactic tailored to the given goal. 2. Tactic execution generates a proof in the object-level logic. Note that no search is involved in the execution of the tactic. All the search is taken care of during the planning process. The real benefits of having separate planning and execution phases become appar ent when a proof attempt fails.

General

Imprint: Springer
Country of origin: Netherlands
Release date: September 2011
First published: 1996
Editors: Hantao Zhang
Dimensions: 240 x 160 x 12mm (L x W x T)
Format: Paperback
Pages: 222
Edition: Softcover reprint of the original 1st ed. 1996
ISBN-13: 978-9401072502
Categories: Books > Humanities > Philosophy > Topics in philosophy > Logic
Books > Science & Mathematics > Mathematics > Mathematical foundations > General
Books > Computing & IT > Applications of computing > Artificial intelligence > General
Books > Philosophy > Topics in philosophy > Logic
LSN: 9401072507
Barcode: 9789401072502

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners