Fast subsumption checks using anti-links

DOI10.1023/A:1005711712356MaRDI QIDQ679247zbMATH OpenOpenAlexFDO

Authors Anavai Ramesh, Bernhard Beckert, Reiner Hähnle, Neil V. Murray

Publication date 7 September 1997

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1005711712356

zbMATH Keywords

anti-link

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 970722
• On anti-subsumptive knowledge enforcement
• scientific article; zbMATH DE number 4072424
• Subsumption algorithms based on search trees
• Logic for Programming, Artificial Intelligence, and Reasoning

Cited in

(2)

• A temporal negative normal form which preserves implicants and implicates
• On anti-subsumptive knowledge enforcement

This page was built for publication: Fast subsumption checks using anti-links

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