About Boundedness for some Datalog and Datalogneg Programs

DOI10.1093/LOGCOM/4.4.375zbMATH Open0988.68560OpenAlexW2143793338MaRDI QIDQ4305348

Irène Guessarian, Marcos Veloso-Peixoto

Publication date: 22 November 1995

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/4.4.375

zbMATH Keywords

undecidabilityboundednessnegationsemantics of Datalog programs

Mathematics Subject Classification ID

Database theory (68P15) Undecidability and degrees of sets of sentences (03D35) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (2)

The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs ⋮ Characterizing Boundedness in Chase Variants

Uses Software

• Datalog

This page was built for publication: About Boundedness for some Datalog and Datalog^neg Programs