6 citations found. Retrieving documents...
S.--E. Bornscheuer. Generating Rational Models. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP), p. 547. MIT Press, 1996.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Approximating the Semantics of Logic Programs by Recurrent.. - Hölldobler, Störr (1999)   (2 citations)  (Correct)

....is that the interpretations that must be represented can become infinite during one step of the computation of the function TP . This will fill our finite memory after one step of computing TP . A solution to this problem is to use finite representations for infinite interpretations as shown in [2]. The results presented in this article consider logic programs which are recursive and admit an injective level mapping. These conditions are sufficient, but it is an open question whether they are necessary as well. We expect that they can be weakened. This research problem will be addressed in ....

S.--E. Bornscheuer. Generating Rational Models. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP), p. 547. MIT Press, 1996.


Approximating the Semantics of Logic Programs by Recurrent.. - Hölldobler (1999)   (2 citations)  (Correct)

....and this may happen after a single application of TP to a finite interpretation. This would already exceed our finite memory after one computation step of TP . A solution to this problem is to use finite representations for the infinite interpretations occuring in such a computation as shown in [6]. However, the problem of how this approach can be realized in a connectionist system is not yet solved. Taken all these arguments and open problems into account our future work will focus on the representational problem. Because the theoretical results formulated in this paper state the ....

S.--E. Bornscheuer. Generating Rational Models. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP), p. 547. MIT Press, 1996.


Recurrent Neural Networks to Approximate the Semantics.. - Hölldobler, Kalinke..   (Correct)

....RNN is that the interpretations that must be represented can become in nite during one step of the computation of the function TP . This will ll our nite memory after one step of computing TP . A solution to this problem is to use nite representations for in nite interpretations as shown in [2]. ....

S.{E. Bornscheuer. Generating Rational Models. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP), p. 547. MIT Press, 1996.


Recurrent Neural Networks to Approximate the Semantics.. - Hölldobler, Kalinke..   (Correct)

....is that the interpretations that must be represented can become infinite during one step of the computation of the function TP . This will fill our finite memory after one step of computing TP . A solution to this problem is to use finite representations for infinite interpretations as shown in [2]. ....

S.--E. Bornscheuer. Generating Rational Models. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP), p. 547. MIT Press, 1996.


Approximating the Semantics of Logic Programs by.. - Hölldobler, Störr.. (1999)   (2 citations)  (Correct)

....is that the interpretations that must be represented can become infinite during one step of the computation of the function TP . This will fill our finite memory after one step of computing TP . A solution to this problem is to use finite representations for infinite interpretations as shown in [2]. The results presented in this article consider logic programs which are recursive and admit an injective level mapping. These conditions are sufficient, but it is an open question whether they are necessary as well. We expect that they can be weakened. This research problem will be addressed in ....

S.--E. Bornscheuer. Generating Rational Models. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP), p. 547. MIT Press, 1996.


Using Connectionist Term Representations for First-Order.. - Kalinke (1997)   (3 citations)  (Correct)

....to be represented can increase to infinite length during one step of the computation of TP . This will fill the finite memory of our architecture after one computation step of TP . A solution to this problem is to use finite representations for infinite interpretations as for instance shown in [2]. 3 Requirements to Connectionist Term Representations Beside the use of the unit value principle another possibility to represent terms is to assign a natural number to each of the function constant symbols used in the program P and decode each term by the vector of the assigned natural ....

S.-E. Bornscheuer. Generating Rational Models. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP), page 547. MIT Press, 1996.

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