The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics

From MaRDI portal
Publication:2851230












This page was built for publication: The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics

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