Tight, consistent, and computable completions for unrestricted logic programs

From MaRDI portal

(Redirected from Publication:4036289)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Tight,_consistent,_and_computable_completions_for_unrestricted_logic_programs&oldid=81376901"