https://twitter.com/quoll

• Relationships and Predicate Logic
• Create a Datalog example with the ontology for Food
• Axioms:

cuisine(Italian)
food(Pasta)
ingredient(Flour)
ingredient(Milk)
ingredient(Egg)

• Rules application as an edge between data nodes
• Rete

The Rete algorithm [72,56] was originally conceived by Charles L. Forgy in 1974 as an optimized algorithm for inference engines of rule based expert systems.

• Implementation: https://github.com/threatgrid/naga
• OWL as relationsip managment: https://www.w3.org/TR/owl-ref/#TransitiveProperty-def
• Example ontology specified in OWL: https://github.com/ailabitmo/food-ontology/blob/master/food.owl

lein run --jason data/in.json --out data/out.json data/family.pl

• Goal: create identied entities with all relationships explicitly exported

• Datomic tables for recording transactions
• entity property value transaction operation
• Example: http://blog.datomic.com/2015/01/datalog-enhancements.html
• https://www.youtube.com/watch?v=VNTQ-M_uSo8
• https://www.meetup.com/clojure-pdx/events/234818929/

**

• Jython
• Developer knowledge transfer

• Convert core tooling for obfuscation and size
• Figwheel for reduced build times
• Defer the performcne

https://lvdmaaten.github.io/tsne/

• use core.matrix

• Biased Coin Problem: find when coin swapped
• Transitions
  • Car on hill
  • Disconnected battery
  • Bouncy switch

http://2016.clojure-conj.org/powderkeg/

• provide example with (defn) then (s/fdef) for signatures

• amen break chardonnay

• Set up the core document processing as (defresource)
• Standard API end-point for the pixel servers

• start with a base test
• indicate when the data isn't relevant for the tests with ,g1 ,g2
• indicate recursion cases
• provide names and formal parameters in the Definitions section
• speed up a recursive definition with an accumulator
• apply heursitics like using fold-left or fold-right
• even proof solvers look reasonable with the minikanren
• use parsimony as a desired value of a program