A. Nonnengard. How to use Modalities and Sorts in Prolog. In C. MacNish, D. Pearce, and L. M. Pereira, editors, Proc. of the JELIA'94: Logics in Artificial Intelligence, volume 838 of LNAI, pages 365--378, York, UK, 1994. Springer Verlag. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Translating a Modal Language with Embedded Implication.. - Baldoni, Giordano.. (1995) (2 citations) (Correct)
....Keywords: Multimodal Logic, Embedded Implication, Translation. 1 Introduction Modal logics are widely used in computer science and artificial intelligence to deal with knowledge and beliefs, time, actions, and several researchers have proposed modal extensions of logic programming languages [7, 1, 13, 19, 17, 6]. In particular, in [5] we have defined a modal logic programming language which allows both multiple modalities and embedded implications. The language has been shown to be well suited for structuring knowledge, and, in particular, for defining module constructs within programs, for representing ....
....case, a variable F2 can match any sequence of functions, whereas a variable Fm can match only a function of sort m. An advantage of the functional method with respect to other translation methods is that it keeps the structure of the original formula. A variant of this approach is presented in [17]. It is easy to see that this approach closely corresponds to the second step of our translation. Sequences of functions in the functional approach correspond to sequences of modal operators in our case, Skolem constants correspond to the new modal operators, and the equational unification is ....
A. Nonnengard. How to use modalities and sorts in Prolog. In Proc. of the JELIA'94: Logics in Artificial Intelligence, volume 838 of LNAI, pages 365--378, York, UK, 1994. Springer Verlag.
A Modal Extension of Logic Programming: Modularity.. - Baldoni, Giordano.. (1995) (4 citations) (Correct)
....the most common properties, such as transitivity or reflexivity, can be taken into account by an equational unification algorithm. An advantage of the functional method is that it keeps the structure of the original formula. In the case of modal logic programming, this approach has been used in [13, 40] to obtain a standard Prolog program starting form Horn clauses extended with modal operators. In particular Nonnengart [40] has proposed a mixed approach based on a relational and functional translation. In our case however, since the modal language allows embedded implication, it is not possible ....
....An advantage of the functional method is that it keeps the structure of the original formula. In the case of modal logic programming, this approach has been used in [13, 40] to obtain a standard Prolog program starting form Horn clauses extended with modal operators. In particular Nonnengart [40] has proposed a mixed approach based on a relational and functional translation. In our case however, since the modal language allows embedded implication, it is not possible to apply directly the translation approach to obtain standard Horn clauses. Therefore, we have developed a translation ....
A. Nonnengard. How to use modalities and sorts in Prolog. In C. MacNish, D. Pearce, and L. M. Pereira, editors, Proc. of the JELIA'94: Logics in Artificial Intelligence, volume 838 of LNAI, pages 365--378, York, UK, 1994. Springer Verlag.
A Modal Extension of Logic Programming: Modularity.. - Baldoni, Giordano.. (1998) (4 citations) (Correct)
No context found.
A. Nonnengard. How to use Modalities and Sorts in Prolog. In C. MacNish, D. Pearce, and L. M. Pereira, editors, Proc. of the JELIA'94: Logics in Artificial Intelligence, volume 838 of LNAI, pages 365--378, York, UK, 1994. Springer Verlag.
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