## A Closed Form Evaluation For Datalog Queries With Integer (GAP)-Order Constraints (1993)

Venue: | Theoretical Computer Science |

Citations: | 27 - 8 self |

### BibTeX

@ARTICLE{Revesz93aclosed,

author = {Peter Z. Revesz},

title = {A Closed Form Evaluation For Datalog Queries With Integer (GAP)-Order Constraints},

journal = {Theoretical Computer Science},

year = {1993},

volume = {116},

pages = {117--149}

}

### Years of Citing Articles

### OpenURL

### Abstract

: We provide a generalization of Datalog based on generalizing databases by adding integer order constraints to relational tuples. For Datalog queries with integer (gap)-order constraints (denoted Datalog !Z ) we show that there is a closed form evaluation. We also show that the tuple recognition problem can be done in PTIME in the size of the generalized database, assuming that the size of the constants in the query is logarithmic in the size of the database. Note that the absence of negation is critical, Datalog : queries with integer order constraints can express any Turing computable function. 1 Introduction In this paper we consider a generalization of Datalog based on the notion of a constraint tuple. The important idea of a constraint tuple comes from constraint logic programming systems, e.g. CLP [14], Prolog III [4], and CHIP [8], and it generalizes the notion of a ground fact. This allows the declarative programming of new applications, including various combinatorial se...