About Boundedness for some Datalog and DatalognegPrograms

摘要

We prove that boundedness is decidable for uniformly connected Datalog programs. We study various semantics (cumulative, non-deterministic, well-founded and stratified) for Datalognegprograms. We compare the various boundedness notions for Datalognegprograms according to these semantics and we show that boundedness is undecidable for Datalognegprograms.