Barklund, J., Boberg, K., Dell'Acqua, P., and Veanes, M. Meta-programming with theory systems, In MetaLogics and Logic Programming, K. Apt and F. Turini (Eds.), Logic Programming, MIT Press, pp. 195--224, 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....that, due to their great similarity with OM pairs, demand a speci c discussion. This is the case of the approaches which use re ection principles in a more generative way. A paradigmatic example of this class is the work of Brogi et al. described in [10] and that of Barklund et al. described in [4]. In [10] the metatheory formalizes provability of a set of primitive object programs in the usual way (i.e. via the Vanilla Meta Interpreter) The metatheory formalizes how composite programs can be built from primitive programs with a set of operators (i.e. etc. An example of the ....

....not only on the basis of provability but also on the basis of other properties such as consistency and truth. 39 For instance we might be interested in de ning a composite program P which proves the theorems of another program P 1 and the formulas which are consistent with the program P 2 . In [4] inference rules similar to re ection rules are fully exploited for the generation of the object theory and the metatheory in the same spirit of OM pairs. Barklund introduces the concept of theory system as a collection of interdependent theories, some of which stand in a object meta relation, ....

[Article contains additional citation context not shown here]

J. Barklund, K. Boberg, P. Dell'Acqua, and M. Veanes. Meta-programming with Theory Systems. In Meta-logics and Logic Programming, chapter 8, pages 195-226. MIT Press, 1995. 42

....nitions and where context extension formulae support the dynamic modi cation of contexts. The mechanism of context extension can be compared to the in formulae proposed in our approach. In Sect. 4 we have shown how contextual logic programming can be reconstructed in our language. Barklund et al. [19] propose the logic programming language Alloy that supports multi level programming with multi theory systems. The support for an arbitrary number of meta levels makes Alloy a powerful tool for developing knowledge based applications. The relation between Alloy and the program composition approach ....

....language Alloy that supports multi level programming with multi theory systems. The support for an arbitrary number of meta levels makes Alloy a powerful tool for developing knowledge based applications. The relation between Alloy and the program composition approach of [3] is discussed in [19] where it is shown how compositions of de nite programs can be expressed in Alloy. Finally, as far as the semantics of program compositions is concerned, it is worth recalling that the idea of extending the immediate consequence operator into a mapping over sets of Herbrand interpretations was ....

J. Barklund, K. Boberg, P. Dell'Acqua, and M. Veanes. Metaprogramming with theory systems. In K.R. Apt and F. Turini, editors, Meta-logics and Logic Programming, chapter 5, pages 195-226. The MIT Press, 1995.

....metalevel reasoning, we obtain query answering systems that behave more rationally and flexibly towards users. 2 Logic languages with metalogical extensions The examples in this paper are written in two similar extensions of Horn clause logic. The example of Section 5 is expressed in Alloy [3, 4], a language designed for specifying systems of interrelated theories. The examples of Sections 3 and 4 are written in Reflective Prolog [6, 7] Alloy Syntactically we can characterize the Alloy language as follows: ffl A program consists of a set of statements on the form or 1 j 2 , ....

....it. It means that the variable is not part of the represented formula but rather part of the representation, which is then nonground. It is only meaningful to substitute a name term for such a variable. An inference system (although not the most efficient conceivable) for Alloy is given elsewhere [4]. An Alloy program specifies a theory or a collection of theories that typically will be (or can be thought of as) the beliefs of one of more agents. The nonlogical axioms of a theory A need not be given by an explicit listing but may instead be given implicitly as the solutions for p of a ....

Jonas Barklund, Katrin Boberg, Pierangelo Dell'Acqua, and Margus Veanes. Meta-programming with theory systems. In Krzysztof Apt and Franco Turini, editors, Meta-logics and Logic Programming, pages 195--226. MIT Press, Cambridge, Mass., 1995.

No context found.

Barklund, J., Boberg, K., Dell'Acqua, P., and Veanes, M. Meta-programming with theory systems, In MetaLogics and Logic Programming, K. Apt and F. Turini (Eds.), Logic Programming, MIT Press, pp. 195--224, 1995.

No context found.

J. Barklund, K. Boberg, P. Dell'Acqua, and M. Veanes. Meta-programming with theory systems. In Meta-logics and Logic Programming, chapter 8, pp. 195--226. MIT Press, 1995.

No context found.

Barklund, J., Boberg, K., Dell'Acqua, P., Veanes, M.: Meta-programming with theory systems. In Apt, K., Turini, F., eds.: Meta-Logics and Logic Programming. The MIT Press, Cambridge, Mass. (1995) 195--224

No context found.

J. Barklund, K. Boberg, P. Dell'Acqua, and M. Veanes. Meta-programming with theory systems. In K.R. Apt and F. Turini, editors, Meta-Logics and Logic Programming, pages 195--224. The MIT Press, Cambridge, Mass., 1995.

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