R. Carmona, A. Dovier, and G. Rossi. Dealing with infinite intensional sets in clp. In Proceedings of the joint conference on declarative programming APIA-GULP-PRODE'97, pages 467--477, Grado, Italy, June 16-19 1997. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Solving Inclusion Constraints between intensional sets - Tellez-Arenas Lifo (Correct)
....such a facility to be provided. Furthermore, since the finiteness of a first order predicate is a well known undecidable problem, either a careful programming style is necessary to avoid generation of infinite sets or the class of admissible programs is restricted using syntactic properties. In [8], satisfiability tests of ground formulas (without set variables) handling infinite intensional sets are possible, by transforming them into equivalent logical formulas. But our aim is different since we want to deal with set constraints on set variables, and thus to solve them: in that case, it ....
R. Carmona, A. Dovier, and G. Rossi. Dealing with infinite intensional sets in clp. In Proceedings of the joint conference on declarative programming APIA-GULP-PRODE'97, pages 467--477, Grado, Italy, June 16-19 1997.
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