Tight, consistent, and computable completions for unrestricted logic programs

From MaRDI portal

(Redirected from Publication:4036289)

Jump to:navigation, search

MaRDI QID[[Item:|]]

Authors

No records found

Cited in

No records found

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item )

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