A general criterion for avoiding infinite unfolding during partial deduction | Zendy

Maurice Bruynooghe | Zendy; Danny De Schreye | Zendy; Bern Martens | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A general criterion for avoiding infinite unfolding during partial deduction

Author(s) -

Maurice Bruynooghe,

Danny De Schreye,

Bern Martens

Publication year - 1992

Publication title -

new generation computing

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.277

H-Index - 27

eISSN - 1882-7055

pISSN - 0288-3635

DOI - 10.1007/bf03037527

Subject(s) - computer science , constructive , partial evaluation , contrast (vision) , basis (linear algebra) , automated theorem proving , algorithm , theoretical computer science , formal methods , calculus (dental) , programming language , artificial intelligence , mathematics , medicine , dentistry , process (computing) , geometry

Well-founded orderings are a commonly used tool for proving the termination of programs. We introduce related concepts specialised to SLD-trees- Based on these concepts, we formulate formal and practical criteria for controlling the unfolding during the construction of SLD-trees that form the basis of a partial deduction. We provide algorithms thaL allow to use these criteria in a constructive way. In contrast to the many ad hoc techniques proposed in the literature, our technique provides both a formal and practically applicable framework.status: publishe

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research