Minimizing clutter using absence in Venn- i^ e

DOI10.1007/978-3-319-42333-3_9MaRDI QIDQ1664372zbMATH OpenOpenAlexFDO

Authors Jim Burton, Mihir K. Chakraborty, Lopamudra Choudhury, Gem Stapleton

Publication date 27 August 2018

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-319-42333-3_9

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Recommendations

• The minimally non-ideal binary clutters with a triangle
• On a certain class of nonideal clutters
• Measuring and reducing clutter in Euler diagrams
• A tight lower bound for the hardness of clutters
• A new infinite class of ideal minimally non-packing clutters
• scientific article; zbMATH DE number 3959489
• Binary clutter inequalities for integer programs
• Intersecting and dense restrictions of clutters in polynomial time
• Ehrhart clutters: regularity and max-flow min-cut

Cited in

(5)

• \(\mathrm{Venn}_{i_{o1}} \): a diagram system for universe without boundary
• The Representation of Negative Terms with Euler Diagrams
• Venn diagram with names of individuals and their absence: a non-classical diagram logic
• Presence and absence of individuals in diagrammatic logics: an empirical comparison
• On the diagrammatic representation of existential statements with Venn diagrams

This page was built for publication: Minimizing clutter using absence in Venn-\(\text i^{\text e}\)

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