# Datalog on infinite structures

@inproceedings{Schwandtner2008DatalogOI, title={Datalog on infinite structures}, author={Goetz Schwandtner}, year={2008} }

- Published 2008
DOI:10.18452/15836

Datalog is the relational variant of logic programming and has become a standard query language in database theory. The (program) complexity of datalog in its main context so far, on finite databases, is well known to be in EXPTIME. We research the complexity of datalog on infinite databases, motivated by possible applications of datalog to infinite structures (e.g. linear orders) in temporal and spatial reasoning on one hand and the upcoming interest in infinite structures in problems related… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-3 OF 3 CITATIONS

## Non-dichotomies in Constraint Satisfaction Complexity

VIEW 6 EXCERPTS

CITES RESULTS & BACKGROUND

HIGHLY INFLUENCED

## Complexity Classification in Infinite-Domain Constraint Satisfaction

VIEW 1 EXCERPT

CITES BACKGROUND

## The Complexity of Datalog on Linear Orders

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 51 REFERENCES