5 citations found. Retrieving documents...
S. Costantini, P. Dell'Acqua, and G. A. Lanzarone. Extending Horn clause theories by reflection principles. In C. MacNish, D. Pearce, and L. M. Pereira, editors, Logics in Artificial Intelligence, LNAI 838, Berlin, 1994. Springer-Verlag.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
A Program Specialiser for Meta-level Compositions of Logic.. - Brogi, Contiero (1996)   (2 citations)  (Correct)

....as very promising, at least for some applications. Another interesting direction for future work is the study of more sophisticated strategies of global (and local) control for specialising our meta interpreters. A further (even more) promising direction is to introduce reflection mechanisms [1, 11, 25] in order to integrate meta level and object level computations in the specialised programs. This would allow considerable speed ups even when the specialised program cannot be directly converted into an equivalent object level program. Acknowledgements We would like to thank the anonymous ....

S. Costantini, P. Dell'Acqua, and G. A. Lanzarone. Extending Horn Clauses Theories by Reflection Principles. In M. C. MacNish, D. Pearce, and L. M. Pereira, editors, Lecture Notes in Artificial Intelligence n.838, pages 400--413. Springer-Verlag, 1994.


A Program Specialiser for Meta-level Compositions of Logic.. - Brogi, Contiero (1996)   (2 citations)  (Correct)

....the representation of substitutions is hidden at the meta level. The results reported in [23] indicate such a representation as very promising, at least for some applications. Another interesting direction for future work is to introduce reflection mechanisms, as for instance those studied in [1, 11, 22], in order to integrate meta level and object level derivations in the specialised programs. This could allow us to further improve the speed up even when the specialised program cannot be directly converted into an equivalent object level program. Acknowledgements This work has been partly ....

S. Costantini, P. Dell'Acqua, and G. A. Lanzarone. Extending Horn Clauses Theories by Reflection Principles. In M. C. MacNish, D. Pearce, and L. M. Pereira, editors, Lecture Notes in Artificial Intelligence n.838, pages 400--413. Springer-Verlag, 1994.


Reflection Principles in Computational Logic - Barklund, Dell'Acqua, Costantini (1997)   Self-citation (Costantini Dell'acqua Lanzarone)   (Correct)

.... this reflective logic was elaborated in [25] Reflection was used to represent communication among different theories agents in [10, 20] The very idea that a common view underlying such diverse contexts could be systematized in the unifying framework of reflection principles was first advanced in [21]. In order to achieve a more language independent formulation of reflection principles, the system s syntactical apparatus (language and proof theory) was then parametrized, using equational name theories for encoding facilities, and associated rewriting systems for substitution facilities [8, ....

S. Costantini, P. Dell'Acqua, and G. A. Lanzarone. Extending Horn clause theories by reflection principles. In C. MacNish, D. Pearce, and L. M. Pereira, editors, Logics in Artificial Intelligence, LNAI 838, Berlin, 1994. Springer-Verlag.


Semantical Properties of Encodings in Logic Programming - Barklund, Costantini.. (1995)   Self-citation (Costantini Dell'acqua Lanzarone)   (Correct)

....: s n ] g; E) for every predicate symbol p in (P; E) distinct from solve. Such additional axioms of the form ff e 1 ; e q ; solve(fi) are called reflection axioms. In the field of AI, a number of forms of reasoning can be modeled by means of different kinds of reflection axioms [8]. In this approach, we define the reflection axioms in such a way that whenever solve(ff) is provable at the metalevel, ff is provable at the object level. Reflective E models are clearly models in the usual sense [17] as they are obtained by extending a given logic program with a set of ....

Costantini, S., Dell'Acqua, P. and Lanzarone, G. A., Extending Horn Clause Theories by Reflection Principles, in: C. MacNish, D. Pearce and L. M. Pereira (eds.), Logics in Artificial Intelligence, LNAI 838, Springer-Verlag, Berlin, 1994.


Meta-programming with Theory Systems - Jonas Barklund (1995)   (6 citations)  Self-citation (Dell'acqua)   (Correct)

.... Pi t 2 Pi t 3 Phi t 1 Pi t 2 pt 3 Phi q Psi t 1 p t 2 pt 3 Phi q q pt 2 Psi q Figure 2: Three meta levels of theories. a better name is reflection rules or linking rules (cf. the discussions by Giunchiglia, Serafini Simpson [18] and Costantini, Dell Acqua Lanzarone [15]) However, in Sect. 4.3 we will present two reflection rules corresponding to the two implications of the theoremhood reflection principle. Fig. 2 depicts part of a theory system in which a theory t contains a theorem p u pv Phi q q . The reflection principle requires that the theory t ....

Costantini, S., Dell'Acqua, P. and Lanzarone, G. A., Extending Horn Clause Theories by Reflection Principles, in: C. MacNish, D. Pearce and L. M. Pereira (eds.), Logics in Artificial Intelligence, LNAI 838, Springer-Verlag, Berlin, 1994.

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