Fast subsumption checks using anti-links

DOI10.1023/A:1005711712356zbMATH Open0870.68135OpenAlexW1554654858MaRDI QIDQ679247FDOQ679247

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

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

zbMATH Keywords

anti-link

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (1)

• A temporal negative normal form which preserves implicants and implicates

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)