Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs

DOI10.1137/S0097539797322140zbMath0943.68045OpenAlexW2001372818WikidataQ121086450 ScholiaQ121086450MaRDI QIDQ4268878

Jerzy Marcinkowski

Publication date: 28 October 1999

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539797322140

zbMATH Keywords

decidabilityquery optimizationDATALOG

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (5)

A tetrachotomy of ontology-mediated queries with a covering axiom ⋮ On the k-Boundedness for Existential Rules ⋮ Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic ⋮ Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation ⋮ Characterizing Boundedness in Chase Variants

Uses Software

• Datalog

This page was built for publication: Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs