Generalizing allowedness while retaining completeness of SLDNF-resolution

DOI10.1007/3-540-52753-2_35MaRDI QIDQ4268489zbMATH OpenFDO

Authors Hendrik Decker, Lawrence Cavedon

Publication date 28 October 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-52753-2_35

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

This page was built for publication: Generalizing allowedness while retaining completeness of SLDNF-resolution

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