We show that the expressive power of well-founded Datalog does not decrease when restricted to total programs (it is known to decrease from Π 11 to Δ 11 on infinite Herbrand structures) thereby affirmatively answering an open question posed by Abiteboul, Hull, and Vianu [AHV95]. In particular, we show that for every well-founded Datalog program there exists an equivalent total program whose only recursive rule is of the form (equation presented) where move is definable by a quantifier-free first-order formula. This yields a nice new normal form for well-founded Datalog and implies that it is sufficient to consider draw-free games in order to evaluate arbitrary Datalog programs under the well-founded semantics.
CITATION STYLE
Flum, J., Kubierschky, M., & Ludäscher, B. (1997). Total and partial well-founded datalog coincide. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1186, pp. 113–124). Springer Verlag. https://doi.org/10.1007/3-540-62222-5_40
Mendeley helps you to discover research relevant for your work.