Extending Datalog with arrays

Greco, Sergio; Palopoli, Luigi; Spadafora, Eugenio

doi:10.1016/0169-023x(95)00027-p

Cited by 5 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the case of logic programming with sets, an input may be a set whose elements may be sets too and so on. Various models and languages for dealing with complex values in databases have been proposed, for example, Abiteboul and Kanellakis [1989], Abiteboul and Grumbach [1988], Kifer and Wu [1993], Kifer et al [1995], Abiteboul and Beeri [1995], Buneman et al [1995], Suciu [1997], Greco et al [1995], Libkin et al [1996], and Abiteboul et al [1995]. The functional approach to such languages dominates the logic programming one.…”

Section: Expressive Power Of Logic Programming With Complex Valuesmentioning

confidence: 99%

Complexity and expressive power of logic programming

et al. 2001

View full text Add to dashboard Cite

This article surveys various complexity and expressiveness results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results on plain logic programming (pure Horn clause programs), more recent results on various important extensions of logic programming are surveyed. These include logic programming with different forms of negation, disjunctive logic programming, logic programming with equality, and constraint logic programming.

show abstract

Section: Expressive Power Of Logic Programming With Complex Valuesmentioning

confidence: 99%

Complexity and expressive power of logic programming

et al. 2001

View full text Add to dashboard Cite

show abstract

“…More recently, Barklund and Hill [4] proposed to add arrays and restricted quantification, a generalization of the bounded quantification, to Giidel, the programming language which does use types. Also Greco et al [9] suggested to extend Datalog, a simple logic programming based database language, with arrays.…”

Section: Arrays In Logic Programmingmentioning

confidence: 99%

“…. ., three 9's in sequence so that for all i E [ 1,9] there are exactly i numbers between successive occurrences of i (see [7, p. 1931 Here, X is the given sequence. Note the similarity in the structure between this program and the one that solves This solution states that A is an onto function from El.…”

Section: Arrays In Logic Programmingmentioning

confidence: 99%

Arrays, bounded quantification and iteration in logic and constraint logic programming

Apt

1996

Science of Computer Programming

View full text Add to dashboard Cite

We claim that programming within the logic programming paradigm suffers from lack of attention given to iteration and arrays. To convince the reader about their merits we present several examples of logic and constraint logic programs which use iteration and arrays instead of explicit recursion and lists. These programs are substantially simpler than their counterparts written in the conventional way. They are easier to write and to understand, are guaranteed to terminate and their declarative character makes it simpler to argue about their correctness. Iteration is implemented by means of bounded quantification.

show abstract

A Comparative Analysis of Array Models for Databases

Baumann

Holsten

2011

Communications in Computer and Information Science

View full text Add to dashboard Cite

Extending Datalog with arrays

Cited by 5 publications

References 6 publications

Complexity and expressive power of logic programming

Complexity and expressive power of logic programming

Arrays, bounded quantification and iteration in logic and constraint logic programming

A Comparative Analysis of Array Models for Databases

Contact Info

Product

Resources

About