Skip Navigation

Journal of Logic and Computation 1994 4(4):375-403; doi:10.1093/logcom/4.4.375
© 1994 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by GUESSARIAN, I.
Right arrow Articles by VELOSO-PEIXOTO, M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Articles

About Boundedness for some Datalog and Datalogneg Programs

IRÈNE GUESSARIAN and MARCOS VELOSO-PEIXOTO, L.I.T.P.

Université Paris 6, 4 Place Jussieu 75252 Paris Cédex 05, France. E-mail: ig{at}litp.ibp frveloso{at}dmi.ens.fr

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.

Keywords: Semantics of Datalog programs,; negation,; boundedness.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.