{"type":"ScholarlyArticle","title":"Solving \"How to Clear a Block\" with Constructive Matching Methodology","authors":[{"name":"Marta Franová","slug":"marta-franova","given":"Marta","family":"Franová","affiliation":""},{"name":"Yves Kodratoff","slug":"yves-kodratoff","given":"Yves","family":"Kodratoff","affiliation":""}],"abstract":"Constructive Matcliinfj is a methodology for proving by induction Specifications Theorems (ST), i.e., theorems of the fonn 'Vx 3z (P(x) ~ Q(x,z)). ST fonnalize the problem of constructing a program specified by given an input vector x, an input condition P, find an output vector z verifying Q(x,z), whenever P(x) holds. Till now , we have applied our method to the so-called Constnu:tiEJfe 'DomtJins, for which one disposes of a unique way of building any input and output data. The goal of this paper is to enlarge our methodology to well-founded domains which are not constructible. As a simple example, Manna and Waldinger's \"How to Clear a Block\" problem 2 is solved. As opposed to theirs, our method does consider strategic aspects of program derivation from a fonnal specification.","doi":null,"url":"https://ijcai.org/proceedings/1991/35","pdf":"https://ijcai.org/proceedings/1991/0035.pdf","markdown":"https://ijcai.org/proceedings/1991/35.md","bibtex":"https://ijcai.org/proceedings/1991/bibtex/35","volume":{"slug":"1991","title":"Proceedings of the Twelfth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1991","url":"https://ijcai.org/proceedings/1991/","year":1991,"location":"Sydney, New South Wales, Australia","dates":"24-30 August 1991","editors":"John Mylopoulos and Ray Reiter","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":35,"pages":{"first":232,"last":238},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}