#### [[Laws of form automated semantic reasoner]] --- 1\. Parse strings of text to produce a transcription of the text into a representation in a computer compatible format as expresssed in the calculus of indications. 4\. Lewis Carroll's last sorties: The problem is to draw the conclusion from the following set of premisses. 2\. Process this representation with a reduction engine applying the basic laws of condensation and cancellation. (1) The only animals in ths house are cats; (2) Every animal is suitable for a pet, that loves to gaze at the moon; (3) When I detest and animal, I avoid it; (4) No animals are carnivorous, unless they prowl at night; (5) No cat fails to kill mice; (6) No animals ever take to me, except what are in this house; (7) Kangaroos are not suitable for pets; (8) None but carnivora kill mice; (9) I detest animals that do not take to me; (10) Animals, that prowl at night, always love to gaze at the moon. Conclusion: (Kangaroos are avoided by me) 3\. Re-transcribe the reduced expression back to english language strings. --- Tags: Reference: http://www.ii.uib.no/~michal/phil/LoF/ [[@spencer-brownLawsForm2014]] Related: [[Augmented sensemaking through ubiquitous context delivered by IoT connectivity and Heads Up Display]]