About Boundedness for some Datalog and Datalogneg Programs
Irène Guessarian, MARCOS VELOSO-PEIXOTO · Journal of Logic and Computation · 1994
We prove that boundedness is decidable for uniformly connected Datalog programs. We study various semantics (cumulative, non-deterministic, well-founded and stratified) for Datalogneg programs. We compare the various boundedness notions for Datalogneg programs according to these semantics and we show that boundedness is undecidable for Datalogneg programs.