Sterling, L. & Beer, R. (1986), Incremental flavor-mixing of metainterpreters for expert system construction, in `Proceedings of the Third Symposium on Logic Programming, Salt Lake City', pp. 20-- 27.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....meta programming in Prolog could be removed by partially evaluating the meta program with respect to a specific object program. This important development and other research concerning program transformations en10 couraged further development of many kinds of meta programming tools. For example, Sterling and Beer (1986) and (1989) developed tools for transforming a knowledge base together with a collection of meta programs for interpreting an arbitrary knowledge base into a program with the functionality of all the interpreters specialized for the given knowledge base. It is clear that many of the ....

Sterling, L. & Beer, R. (1986), Incremental flavor-mixing of metainterpreters for expert system construction, in `Proceedings of the Third Symposium on Logic Programming, Salt Lake City', pp. 20-- 27.

....clauses as a unit, and an ordered set of units as a context. Nadathur et al. 30] create a new context adding clauses in an implication goal to the current context in their system. Some other researchers in the logic programming community have sought meta level facilities in meta interpreters [11, 35, 37, 38, 39, 44] based on Prolog. Even standard Prolog [10, 16, 36] has some meta level facilities. The predicates assert and retract add and remove clauses from a system wide database by destroying the old version of that database. The meta predicate call tries to prove an explicitly given goal with respect to ....

....in the system developed by Lamma et al. Since we are not aware of any WAM based system which collects proofs and uses them to shrink search spaces of goals in the literature, we are not able to compare our implementation with any other system. There are meta interpreters which collect proofs [36, 37, 38, 39, 40], but they do not efficiently implement proofs because of the extra layer of interpretation. To the best of our knowledge, our system is the only system in the literature which deals with proofs at WAM level. To handle proofs, we use extra registers and assign different meanings to procedural ....

Sterling, L.S., and Beer, R.D., Incremental Flavor-Mixing of Meta-Interpreters for Expert System Construction, in: Proc. of the 3rd Symp. on Logic Programming, IEEE Computer Society Press, Washington D.C., 1986, pp. 20-27.

....deduction techniques allow us to get rid of the overhead by specializing the metainterpreter wrt a given program. There exist several partial deduction procedures for logic programs (see for example [3,36] Some of them have special features oriented towards the partial deduction of metaprograms [17,24,31]. The partial deduction of metaprograms has been used in several systems [9,30,31,33] but was never treated in a formal way. We first formalize the application of these techniques to the vanilla metainterpreter. Our result is a kind of folk theorem which is however a useful step in the ....

....wrt a given program. There exist several partial deduction procedures for logic programs (see for example [3,36] Some of them have special features oriented towards the partial deduction of metaprograms [17,24,31] The partial deduction of metaprograms has been used in several systems [9,30,31,33] but was never treated in a formal way. We first formalize the application of these techniques to the vanilla metainterpreter. Our result is a kind of folk theorem which is however a useful step in the derivation of the corresponding result in the case of the inheritance enhanced ....

L. Sterling and R. D. Beer. Incremental Flavor-Mixing of Meta-interpreters for Expert System Construction. In Proc. Third Logic Programming Symposium, pages 20--27, 1986.

....and manipulate the object level entities. The representation issue is achieved by means of a naming schema: each entity of the object level is given a name used at the meta level as the (only) way to operate on the object it denotes. Prolog has been used for a long time for writing meta programs [14,15]. Nevertheless, the use of Prolog as a meta programming language for non trivial programs reveals flaws and limitations in the effective meta level facilities offered by this language [6,12] Therefore, in the last ten years, a number of extensions or completely new definitions of Prolog have been ....

Sterling L., Beer R.D., "Incremental Flavor-Mixing of Meta-Interpreter for Expert System Construction", in Proc. of the 1986 IEEE Symposium on Logic Programming, Salt Lake City, pp 20-27, 1986.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC