G. M. Kuper. An Extension of LPS to Arbitrary Sets. Technical Report to appear, IBM, Watson Research Center, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....attr 1 and attr 2 , are scalar and are defined so as to flatten the structure of the original objects in class c. Set comparison. Grouping is not only easy to express in F logic, but it is also computationally more efficient than in some other languages, such as LDL [85] COL [2] or LPS [67]. The reason for this is that, in those languages, grouping is a second order operation that requires stratification. We refer the reader to [60] for a more complete discussion. However, this gain in efficiency has a price. For instance, in LDL, set equality is easy to express because LDL treats ....

G.M. Kuper. An extension of LPS to arbitrary sets. Technical report, IBM, Yorktown Heights, 1987.

....deductive databases normally use flat data model and do not support object identity and data abstraction. It therefore can be expected that combining the two paradigms will yield significant benefits. A number of attempts to combine the two approaches [AB88, AG87, BK89, BNST87, BNT88, CW89] KW89, Kup87, KV84, Mai86, RKS85] have been reported in the literature, but, in our opinion, none of them succeeds in meeting all of the above goals. These approaches either do not support object identity, or restrict the kinds of complex objects and queries one can use, or do not support inheritance, limit ....

G.M. Kuper. An extension of LPS to arbitrary sets. Technical report, IBM, Yorktown Heights, 1987.

....We propose a novel logic, called HiLog, which provides a clean declarative semantics to much of this higher order logic programming. From the outset, even the terminology of higher orderness seems ill defined. A number of works have proposed various higher order constructs in the logic framework [1, 5, 13, 7, 23, 24, 30, 31, 42, 45] but with such a diversity of syntax and semantics, it is not always clear what kind of higher orderness is being claimed. In our opinion, there are at least two different facets to the issue: a higher order This paper is an expanded version of the work previously reported in [10, 11] y ....

Kuper, G., An Extension of LPS to Arbitrary Sets, IBM Research Report, 1987.

....certain approaches to DOODs. The fact that we have not taken them as examples should not be taken as an implicit judgment of comparative merit. Other proposals are more difficult to classify within a general framework of DOODs. Among these, proposals exist to integrate sets in logic programming [24, 39, 40, 41], to handle non first normal form relations in a deductive language [14] and to extend (pure) Datalog to handle nested relations [15, 16] Others are, strictly speaking, programming languages: the SQL extension towards deduction and abstract data types (ADTs) proposed in [28] and the ....

Gabriel M. Kuper. An Extension of LPS to Arbitrary Sets. Technical report, IBM, 1987.

....the Expressive Power of Logic Programming Languages with Sets Gabriel M. Kuper IBM T. J. Watson Research Laboratory Yorktown Heights, New York 1 Introduction Several recent papers [Kup87a] [Kup87b] BNR 87] have proposed adding sets to logic programming. Their motivation was to combine recent work on extending relational database theory to more general structures, with work on using logic programming as a database query language. While the motivation was similar, the languages ....

....they show that these programs have a unique minimal model. In this paper we investigate the relationship between these, and other ways, of adding sets to logic programming. We first look at languages that have semantics similar to ELPS (the extension of LPS to arbitrary finite sets described in [Kup87a]) We show that the use of quantification is equivalent to having primitive union or scons (see [BNR 87] predicates in an ordinary Horn clause language. We then examine languages with negation. We show that for unstratified programs, adding negation directly to ELPS, 1 or indirectly, by allowing ....

[Article contains additional citation context not shown here]

G. M. Kuper. An Extension of LPS to Arbitrary Sets. Technical Report to appear, IBM, Watson Research Center, 1987.

No context found.

G. M. Kuper. An Extension of LPS to Arbitrary Sets. Technical Report to appear, IBM, Watson Research Center, 1987.

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