Proving termination for logic programs by the query-mapping pairs approach

From MaRDI portal









Describes a project that uses

Uses Software






This page was built for publication: Proving termination for logic programs by the query-mapping pairs approach

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