The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs

DOI10.1007/3-540-60922-9_35zbMath1379.68077OpenAlexW1516055111MaRDI QIDQ4593950

Jerzy Marcinkowski

Publication date: 16 November 2017

Published in: STACS 96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60922-9_35

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Logic programming (68N17) Turing machines and related notions (03D10)

Related Items (2)

A semantic approach to optimize linear datalog programs ⋮ On the complexity of single-rule datalog queries.

This page was built for publication: The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs