Computing prime implicates incrementally

DOI10.1007/3-540-55602-8_170MaRDI QIDQ4264736zbMATH OpenFDO

Authors P. S. Jackson

Publication date 10 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-55602-8_170

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Logic in artificial intelligence (68T27)

Cited in

(8)

• Mathematical applications of inductive logic programming
• Quantifier-free equational logic and prime implicate generation
• The dynamics of relevance: adaptive belief revision
• On modularity in term rewriting and narrowing
• Temporal logic modeling of biological systems
• Abductive reasoning on molecular interaction maps
• A new class of explanations for classifiers with non-binary features
• Efficient query processing with reduced implicate tries

This page was built for publication: Computing prime implicates incrementally

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