Compiling bottom-up and mixed derivations into top-down executable logic programs | Zendy

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

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Compiling bottom-up and mixed derivations into top-down executable logic programs

Author(s) -

Danny De Schreye,

Bern Martens,

Gunther Sablon,

Maurice Bruynooghe

Publication year - 1991

Publication title -

journal of automated reasoning

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.497

H-Index - 56

eISSN - 1573-0670

pISSN - 0168-7433

DOI - 10.1007/bf00249018

Subject(s) - executable , programming language , extension (predicate logic) , prolog , top down and bottom up design , computer science , logic program , transformation (genetics) , logic programming , program transformation , theoretical computer science , biochemistry , chemistry , gene

We present a techmque for the compilation of bottom-up and m~xed logic derlvatmns into PROLOG-programs It is obtained as an extension of a program transformation technique called Compd#1g Control. We illustrate its applications m three different domains: solving numerical problems, integrity checking in deductive databases and theorem proving The aim is to obtain efficient PROLOG programs for problems in which a non-top-down control is most appropriate.

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