Author SHA1 Message Date
Roman Volosovskyi cbb6962bfa task preprocessing 2016-04-21 12:19:57 +03:00
Roman Volosovskyi edefca55b4 ranking/revision first attempt 2016-04-20 17:45:13 +03:00
Roman Volosovskyi ae67c2aa32 quests LI 2016-04-14 17:21:16 +03:00
Roman Volosovskyi 5a20fd4b51 questions LI 2016-04-14 17:02:19 +03:00
Roman Volosovskyi d947c82ad3 goals LI tasklinks, update-quests-budgets, update-belief-budget 2016-04-14 16:37:44 +03:00
Roman Volosovskyi 5bdd2c4362 beliefs LI update-questions-budgets 2016-04-14 14:38:03 +03:00
Roman Volosovskyi d6975b6486 beliefs LI update-goal-budget 2016-04-14 14:29:44 +03:00
Roman Volosovskyi b1a49b7edd test new tasklinks 2016-04-14 13:12:10 +03:00
Roman Volosovskyi 1cf7c7b4d3 beliefs LI check-questions 2016-04-14 12:45:45 +03:00
Roman Volosovskyi 5a6a1ead36 LI jobs refactoring 2016-04-14 11:47:54 +03:00
Roman Volosovskyi 99e32287d1 goals/beliefs LI refactoring 2016-04-14 09:54:18 +03:00
Roman Volosovskyi b87ea44138 quests LI proto 2016-04-13 12:03:48 +03:00
Roman Volosovskyi 6677f41a12 questions LI proto 2016-04-13 11:31:57 +03:00
Roman Volosovskyi 181e690a65 goals LI proto 2016-04-13 10:02:08 +03:00
Roman Volosovskyi b204657325 beliefs LI proto 2016-04-12 18:10:56 +03:00
Roman Volosovskyi 333ef9a145 tableless memory 2016-04-08 18:31:45 +03:00
Roman Volosovskyi d88c402696 local inference mock 2016-04-07 18:58:39 +03:00
Roman Volosovskyi bfbbb14084 travis-ci upgrade 2016-04-07 12:50:27 +03:00
Roman Volosovskyi a6a3777915 selection of data from redis 2016-04-07 11:42:43 +03:00
Roman Volosovskyi e0cef19049 flow conditions & injections 2016-04-07 09:31:40 +03:00
Roman Volosovskyi 5b221cdfb8 jdk8 2016-04-06 17:17:43 +03:00
Roman Volosovskyi aeb037b8ce at least kafka works 2016-04-06 17:07:06 +03:00
Roman Volosovskyi ee666d4012 api updates 2016-04-04 15:14:10 +03:00
Roman Volosovskyi 0cee460fb6 redis mem tests 2016-04-01 11:29:29 +03:00
Jarrad Hope 85b4de8666 test push 2016-03-29 17:35:07 +02:00
Jarrad Hope af66fdf663 basic travis.yml 2016-03-29 17:30:27 +02:00
Roman Volosovskyi 06a14467de fix typos 2016-03-29 18:07:12 +03:00
Roman Volosovskyi e3988d8454 Memory protocol & first redis implementation 2016-03-29 17:56:54 +03:00
48 changed files with 2821 additions and 1524 deletions
+1
View File
@@ -15,3 +15,4 @@ pom.xml.asc
\#*\#
.\#*
/src/nal/experiments.clj
*.log
+14
View File
@@ -0,0 +1,14 @@
language: clojure
# Notify #nars
notifications:
slack:
secure: eI5hj2PABtAUkpeYwiAHcFMa5pNvHFuU87uqe4qBtv0upPtu22/dLpw8l6EhhcMZlW6C8D2irrj6W5C1lujCy7u3Vpu1FeBPZbqzapyU1Hpe8YgSRdCY1dbygawZp/Av/HWzpi0aTket83F5/0dvTZK0fQTBRmAfyx17DEJscYEBH61dKVqdwBy5OVYvhQ1+QtEnt1TRJcT0AA8von9lanzx5/mWdQ6O+3BrKURWG6vvQUYEMZH43NU6lNGNV+PBGV1PSqZqbzCh/6C6/d6HauQdewr4Oubez90OquyCDpCZDoVG8eCAsZtZt+tzfJ5gjtz8+HA6GQeQB6QMLAp89m1bPwSZCqdnmQp9S8TNgm8Io3jREBh+5JIdpDXwukKT1kMPFrdDiPTEhHNJojyK3/BERGyrhf8azow+brPq0EIM9Fi/SkGa0gb9mUXY/BZ1MF7ulxxbzpLxHJYlT9QVlV9Q09/uhH4tIh0kPQhe+ntkMT1uLTfDur7CZakB5270ibreRSeK4RKdpy5SjaIN70hSwyrWoZHiED6aKEJJSO1t9Ve1jTDyWbcUZYewtBi+APcqAraja9NIlFApjBRO1jUneS4/BzNqxWZAFS7MOwMrk1xFft47hMIHoNYd7IgyB7TWSxhloNTwMyOWkdOhnPIqqCvds6M0yQCDKNBiVeM=
services:
- redis-server
jdk:
- oraclejdk8
sudo: required
dist: precise
group: edge
Binary file not shown.
Binary file not shown.
+3
View File
@@ -0,0 +1,3 @@
# Introduction to narjure
TODO: write [great documentation](http://jacobian.org/writing/what-to-write/)
+12 -4
View File
@@ -9,15 +9,23 @@
[org.clojure/tools.nrepl "0.2.12"]
[org.clojure/data.priority-map "0.0.7"]
[org.clojure/core.match "0.3.0-alpha4"]
[org.clojure/core.unify "0.5.5"]]
[org.clojure/core.unify "0.5.5"]
[org.onyxplatform/onyx "0.9.0"]
[org.onyxplatform/onyx-kafka "0.9.0.1"]
[com.taoensso/carmine "2.12.2"]
[clj-kafka "0.3.4" :exclusions [org.apache.zookeeper/zookeeper zookeeper-clj]]
[mount "0.1.10"]
[aero "0.2.1"]
[com.taoensso/timbre "4.1.4"]]
:main ^:skip-aot narjure.core
:plugins [[lein-cloverage "1.0.6"]
[jonase/eastwood "0.2.3"]
[lein-kibit "0.1.2"]
[cider/cider-nrepl "0.11.0-SNAPSHOT"]
[michaelblume/lein-marginalia "0.9.0"]]
[cider/cider-nrepl "0.11.0-SNAPSHOT"]]
:eastwood {:exclude-namespaces [nal.rules]}
:target-path "target/%s"
:repl-options {:init-ns narjure.repl
:nrepl-middleware [narjure.repl/narsese-handler]}
:profiles {:uberjar {:aot :all}})
:profiles {:uberjar {:aot :all}
:test {:dependencies [[com.stuartsierra/component "0.3.1"]]}
:dev {:dependencies [[com.stuartsierra/component "0.3.1"]]}})
+29
View File
@@ -0,0 +1,29 @@
{:env-config
{:onyx/tenancy-id #env [ONYX_ID "testcluster"]
:onyx.bookkeeper/server? true
:onyx.bookkeeper/local-quorum? #cond {:default false
:test true}
:onyx.bookkeeper/delete-server-data? true
:onyx.bookkeeper/local-quorum-ports [3196 3197 3198]
:onyx.bookkeeper/port 3196
:zookeeper/address #cond {:default #env [ZOOKEEPER "zookeeper"]
:test "127.0.0.1:2188"}
:zookeeper/server? #cond {:default false
:test true}
:zookeeper.server/port 2188}
:peer-config
{:onyx/tenancy-id #env [ONYX_ID "testcluster"]
:zookeeper/address #cond {:default #env [ZOOKEEPER "zookeeper"]
:test "127.0.0.1:2188"}
:onyx.peer/job-scheduler :onyx.job-scheduler/greedy
:onyx.peer/zookeeper-timeout 60000
:onyx.messaging/allow-short-circuit? #cond {:default true
:test false}
:onyx.messaging/impl :aeron
:onyx.messaging/bind-addr #env [BIND_ADDR "localhost"]
:onyx.messaging/peer-port 40200
:onyx.messaging.aeron/embedded-driver? #cond {:default false
:test true}
:onyx.messaging/backpressure-strategy :high-restart-latency}
:redis-config
{:uri "redis://127.0.0.1:6379"}}
+1 -1
View File
@@ -2,7 +2,7 @@
task ::= [budget] sentence (* task to be processed *)
sentence ::= statement"." [tense] [truth] (* belief to be remembered *)
sentence ::= statement"." [tense] [truth] (* judgement to be remembered *)
| statement"?" [tense] [truth] (* question to be answered, tense added in OpenNARS 1.7 *)
| statement"@" [tense] [truth] (* question on desire value to be answered, tense added in OpenNARS 1.7 *)
| statement"!" [tense] [truth] (* goal to be realized, tense added in OpenNARS 1.7 *)
+3 -4
View File
@@ -1,13 +1,12 @@
(ns nal.core
(:require [nal.deriver.truth :as t]
[nal.deriver :refer [generate-conclusions]]
[nal.rules :as r]))
[nal.deriver :refer [generate-conclusions]]))
(defn choice [[f1 c1] [f2 c2]]
(if (>= c1 c2) [f1 c1] [f2 c2]))
(defn inference
[{:keys [task-type] :as task} belief]
(generate-conclusions (r/rules task-type) task belief))
[rules {:keys [task-type] :as task} belief]
(generate-conclusions (rules task-type) task belief))
(def revision t/revision)
+2 -1
View File
@@ -8,7 +8,8 @@
(defn get-matcher [rules p1 p2]
(let [matchers (->> (mall-paths p1 p2)
(filter rules)
(map rules))]
(map rules)
(map (fn [el] (:matcher el))))]
(case (count matchers)
0 (constantly [])
1 (first matchers)
+5 -9
View File
@@ -1,7 +1,6 @@
(ns nal.deriver.backward-rules
(:require [nal.deriver.key-path :refer [rule-path]]
[clojure.string :as s]
[nal.deriver.utils :as u]))
[clojure.string :as s]))
;http://pastebin.com/3zLX7rPx
(defn allow-backward?
@@ -30,25 +29,22 @@
"If rule allows backward inference it will be expanded to three rules,
where first one is the rule itself, and rest rules will be generated by
swapping conclusion with every premise."
[{:keys [p1 p2 conclusions pre id] :as rule}]
[{:keys [p1 p2 conclusions pre] :as rule}]
(mapcat (fn [{:keys [conclusion post] :as fc}]
(let [post (reduce #(remove (partial has-prefix? %2) %1)
post [":t/" ":d/"])]
(conj (map
(fn [r] (update r :pre conj :question?))
[(assoc rule :conclusions [(assoc fc :post post)]
:id (u/concat-kw id :q))
[(assoc rule :conclusions [(assoc fc :post post)])
(assoc rule :p1 conclusion
:conclusions [{:conclusion p1
:post post}]
:full-path (rule-path conclusion p2)
:pre (check-not-equal pre p1)
:id (u/concat-kw id :backward1))
:pre (check-not-equal pre p1))
(assoc rule :p2 conclusion
:conclusions [{:conclusion p2
:post post}]
:full-path (rule-path p1 conclusion)
:pre (check-not-equal pre p2)
:id (u/concat-kw id :backward2))])
:pre (check-not-equal pre p2))])
rule)))
conclusions))
+7 -16
View File
@@ -1,7 +1,6 @@
(ns nal.deriver.list-expansion
(:require [nal.deriver.utils :refer [walk]]
[clojure.string :as s]
[nal.deriver.utils :as u]))
[clojure.string :as s]))
(def max-elements-in-list 7)
@@ -37,26 +36,18 @@
"Expands :from/ element in rule, so as a result will be created n rules, in
each of them :form/A will be replaced with A1 or A2 or A3, etc."
[statement from-name list-name n]
(let [st (butlast statement)
id (last statement)]
(map (fn [idx]
(let [sym (str list-name idx)
new-id (u/concat-kw id sym)]
(walk (concat st [new-id])
(= from-name el) (symbol sym))))
(range 1 (inc n)))))
(map (fn [idx]
(walk statement
(= from-name el) (symbol (str list-name idx))))
(range 1 (inc n))))
(defn generate-all-lists
"Expands rules with :list/ elements, as a result will be created 5 rules,
where :list/ will be replaced with A1, A1 A2, ..., A1..A5."
[r]
(let [list (get-list ":list" r)
l-name (list-name list)
id (last r)
r-without-id (butlast r)]
(mapcat #(let [new-id (u/concat-kw id (str l-name %))
r (concat r-without-id [new-id])
st (replace-list-elemets r list l-name %)]
l-name (list-name list)]
(mapcat #(let [st (replace-list-elemets r list l-name %)]
(if-let [from-name (get-list ":from" st)]
(expand-:from-element st from-name l-name %)
[st]))
+14 -18
View File
@@ -19,7 +19,7 @@
#{`= `not= `seq? `first `and `let `pos? `> `>= `< `<= `coll? `set `quote
`count 'aops `- `not-empty-diff? `not-empty-inter? `walk `munification-map
`substitute `sets `some `deref `do `vreset! `volatile! `fn `mapv `if
`sort-commutative `n/reduce-ext-inter `n/reduce-similarity `complement
`sort-commutative `n/reduce-ext-inter `n/reduce-symilarity `complement
`n/reduce-int-dif `n/reduce-and `n/reduce-ext-dif `n/reduce-image
`n/reduce-int-inter `n/reduce-neg `n/reduce-or `nil? `not `or `abs
`implications-and-equivalences `get-terms `empty? `intersection
@@ -50,14 +50,14 @@
(defn form-conclusion
"Formation of cocnlusion in terms of task and truth/desire functions"
[{:keys [t1 t2 task-type]}
{c :statement tf :t-function pj :p/belief df :d-function
{c :statement tf :t-function pj :p/judgement df :d-function
sc :shift-conditions}]
(let [conclusion-type (if pj :belief task-type)
(let [conclusion-type (if pj :judgement task-type)
conclusion {:statement c
:task-type conclusion-type
:occurrence :t-occurrence}
conclusion (case conclusion-type
:belief (assoc conclusion :truth (list tf t1 t2))
:judgement (assoc conclusion :truth (list tf t1 t2))
:goal (assoc conclusion :desire (list df t1 t2))
conclusion)]
(if sc
@@ -67,24 +67,19 @@
(defn traverse-node
"Generates code for precondition node."
[vars result {:keys [conclusions children condition]}]
(let [conclusions (remove
nil?
[(when-not (zero? (count conclusions))
`(vswap! ~result concat
~@(set (map #(mapv (partial form-conclusion vars) %)
(quote-operators conclusions)))))])
children (mapcat (fn [n] (traverse-node vars result n)) children)]
(if (true? condition)
(concat conclusions children)
[`(when ~(quote-operators condition)
~@(concat conclusions children))])))
`(when ~(quote-operators condition)
~(when-not (zero? (count conclusions))
`(vswap! ~result concat
~@(set (map #(mapv (partial form-conclusion vars) %)
(quote-operators conclusions)))))
~@(map (fn [n] (traverse-node vars result n)) children)))
(defn traversal
"Walk through preconditions tree and generates code for matcher."
[vars tree]
(let [results (gensym)]
`(let [~results (volatile! [])]
~@(traverse-node vars results tree)
~(traverse-node vars results tree)
@~results)))
(defn replace-occurrences
@@ -267,7 +262,7 @@
sym-map)
:t-function (t/tvtypes (get-truth-fn post))
:d-function (t/dvtypes (get-desire-fn post))
:p/belief (some #{:p/belief} post)}
:p/judgement (some #{:p/judgement} post)}
:conditions (remove nil?
(walk (concat (check-conditions sym-map) pre)
(and (coll? el) (= \a (first (str (first el)))))
@@ -345,5 +340,6 @@
match-fn-code (-> main-pattern
(gen-rules rules)
(match-rules main-pattern task-type))]
[k (eval match-fn-code)])))
[k (assoc v :matcher (eval match-fn-code)
:matcher-code match-fn-code)])))
(into {})))
+3 -3
View File
@@ -111,7 +111,7 @@
[_ ['ext-set & l1] ['ext-set & l2]] (diff 'ext-set l1 l2)
:else st))
(defn reduce-similarity
(defn reduce-symilarity
[st]
(m/match st
['<-> ['ext-set s] ['ext-set p]] ['<-> s p]
@@ -169,7 +169,7 @@
'| `reduce-int-inter
'- `reduce-ext-dif
'int-dif `reduce-int-dif
'<-> `reduce-similarity
'<-> `reduce-symilarity
'* `reduce-production
'int-image `reduce-image
'ext-image `reduce-image
@@ -185,7 +185,7 @@
| (reduce-int-inter st)
- (reduce-ext-dif st)
int-dif (reduce-int-dif st)
<-> (reduce-similarity st)
<-> (reduce-symilarity st)
* (reduce-production st)
int-image (reduce-image st)
ext-image (reduce-image st)
+8 -8
View File
@@ -5,7 +5,7 @@
[nal.deriver.substitution :refer [substitute munification-map]]
[nal.deriver.terms-permutation :refer [implications equivalences]]
[clojure.set :refer [union intersection]]
[narjure.defaults :refer [duration]]
[narjure.defaults :refer [temporal-window-duration]]
[clojure.core.match :as m]
[nal.deriver.normalization :refer [reduce-seq-conj]]))
@@ -88,11 +88,11 @@
[_]
[`(not= :eternal :t-occurrence)
`(not= :eternal :b-occurrence)
`(<= ~duration (abs (- :t-occurrence :b-occurrence)))])
`(<= ~temporal-window-duration (abs (- :t-occurrence :b-occurrence)))])
(defmethod compound-precondition :concurrent
[_]
[`(> ~duration (abs (- :t-occurrence :b-occurrence)))])
[`(> ~temporal-window-duration (abs (- :t-occurrence :b-occurrence)))])
;-------------------------------------------------------------------------------
(defmulti precondition-transformation (fn [arg1 _] (first arg1)))
@@ -164,11 +164,11 @@
(m/match (mapv #(if (and (coll? %) (= 'quote (first %)))
(second %) %) (rest args))
[(:or '=|> '==>)] concl
['pred-impl] `(let [:t-occurrence (+ :t-occurrence ~duration)] ~concl)
['retro-impl] `(let [:t-occurrence (- :t-occurrence ~duration)] ~concl)
['pred-impl] `(let [:t-occurrence (+ :t-occurrence ~temporal-window-duration)] ~concl)
['retro-impl] `(let [:t-occurrence (- :t-occurrence ~temporal-window-duration)] ~concl)
[sym (:or '=|> '==>)] (shift-forward-let sym concl)
[sym 'pred-impl] (shift-forward-let sym `+ concl duration)
[sym 'retro-impl] (shift-forward-let sym `- concl duration)))
[sym 'pred-impl] (shift-forward-let sym `+ concl temporal-window-duration)
[sym 'retro-impl] (shift-forward-let sym `- concl temporal-window-duration)))
(defn backward-interval-check [sym]
`(and (coll? ~sym) (= (first ~sym) (quote ~'seq-conj))
@@ -190,7 +190,7 @@
(defmethod conclusion-transformation :shift-occurrence-backward
[args concl]
(let [duration (- duration)]
(let [duration (- temporal-window-duration)]
(m/match (mapv #(if (and (coll? %) (= 'quote (first %)))
(second %) %) (rest args))
[(:or '=|> '==>)] concl
+4 -6
View File
@@ -1,11 +1,10 @@
(ns nal.deriver.premises-swapping
(:require [nal.deriver.key-path :refer [rule-path]]
[nal.deriver.normalization :refer [commutative-ops]]
[nal.deriver.utils :as u]))
[nal.deriver.normalization :refer [commutative-ops]]))
;the set of keys which prevent premises swapping for rule
(def anti-swapping-keys
#{:question? :belief? :goal? :measure-time :t/belief-structural-deduction
#{:question? :judgement? :goal? :measure-time :t/belief-structural-deduction
:t/structural-deduction :t/belief-structural-difference :t/identity
:t/negation :union :intersection :t/intersection :t/union})
@@ -17,10 +16,9 @@
(not-any? commutative-ops (flatten conclusion)))))
(defn swap-premises
[{:keys [p1 p2 id] :as rule}]
[{:keys [p1 p2] :as rule}]
(assoc rule :p1 p2
:p2 p1
:full-path (rule-path p2 p1)
:id (u/concat-kw id :swap)))
:full-path (rule-path p2 p1)))
(defn swap [rule] [rule (swap-premises rule)])
+43 -60
View File
@@ -1,17 +1,15 @@
(ns nal.deriver.rules
(:require [clojure.string :as s]
[clojure.set :refer [map-invert]]
[clojure.core.match :as m]
[nal.deriver
[key-path :refer [rule-path all-paths path-invariants path]]
[utils :refer [walk concat-kw]]
[utils :refer [walk]]
[list-expansion :refer [contains-list? generate-all-lists]]
[premises-swapping :refer [allow-swapping? swap]]
[matching :refer [generate-matching]]
[backward-rules :refer [allow-backward? expand-backward-rules]]
[normalization :refer [infix->prefix replace-negation]]
[terms-permutation :refer [order-for-all-same? generate-all-orders]]]
[nal.deriver.utils :as u]))
[terms-permutation :refer [order-for-all-same? generate-all-orders]]]))
(defn options
"Generates map from rest of the rule's args."
@@ -26,48 +24,29 @@
(map (fn [[c _ post]] {:conclusion c :post post}) (partition 3 c))
[{:conclusion c :post (:post opts)}]))
(defn rule*
([p1 p2 c other] (rule* p1 p2 c other ""))
([p1 p2 c other pf]
(let [p1 (infix->prefix p1)
p2 (infix->prefix p2)
c (infix->prefix c)
opts (options other)
conclusions (get-conclusions c opts)
id (concat-kw (opts :id) pf)
cnt (count conclusions)]
(for [n (range 0 cnt)]
{:p1 p1
:p2 p2
:conclusions [(nth conclusions n)]
:full-path (rule-path p1 p2)
:pre (infix->prefix (:pre opts))
:origin (opts :origin)
:id (if (zero? n)
id
(u/concat-kw id (str (inc n))))}))))
(defn get-second-premises [p1]
(m/match (vec p1)
[_ ([fp2 _ sp2] :seq)] [fp2 sp2]
[fp2 _ sp2] [fp2 sp2]))
(defn rule
"Generates rule from #R statement."
[data]
(m/match (vec (replace-negation data))
[p1 '|- c & other]
(let [[fp2 sp2] (get-second-premises p1)]
(concat (rule* p1 fp2 c other :prem1)
(rule* p1 sp2 c other :prem2)))
[p1 p2 '|- c & other] (rule* p1 p2 c other)))
(let [[p1 p2 _ c & other] (replace-negation data)]
(let [p1 (infix->prefix p1)
p2 (infix->prefix p2)
c (infix->prefix c)
opts (options other)
conclusions (get-conclusions c opts)]
(map (fn [c]
{:p1 p1
:p2 p2
:conclusions [c]
:full-path (rule-path p1 p2)
:pre (infix->prefix (:pre opts))})
conclusions))))
(defn check-duplication
"Checks if there are rules with same premises and preconditions but with
different conclusions, merges them if they exist."
[rules]
(vals (reduce (fn [ac {:keys [p1 p2 pre conclusions id origin] :as r}]
(let [k [p1 p2 (set pre)]]
(vals (reduce (fn [ac {:keys [p1 p2 pre conclusions] :as r}]
(let [k [p1 p2 pre]]
(if (ac k)
(update-in ac [k :conclusions] concat conclusions)
(assoc ac k r))))
@@ -78,12 +57,6 @@
[{:keys [pre]}]
(some #{:question?} pre))
(defn quest?
"Return true if rule allows only quest as task."
[{:keys [pre] [{post :post}] :conclusions}]
(and (some #{:question?} pre)
(every? #(not (#{:p/judgement} %)) post)))
(defn goal?
"Return true if rule allows only goal as task."
[{pre :pre [{post :post}] :conclusions}]
@@ -92,11 +65,26 @@
(s/starts-with? (str el) ":d/")))
post)))
(defn belief?
"Return true if rule allows only belief as task."
(defn judgement?
"Return true if rule allows only judgement as task."
[{:keys [pre] :as rule}]
(not (or (question? rule) (some #{:goal} pre))))
(defn add-possible-paths
"Selects all rules that will match the same path as current rule and adds
these rules to the set of rules that matches path.
For instance:
current rule's path [[--> [- :any :any] :any] :and [--> [:any :any]]]
so, if we find rule with path [[--> :any :any] :and [--> [:any :any]]],
it matches to current's rule path too, hence it should be added to the set
of rules that matches [[--> [- :any :any] :any] :and [--> [:any :any]]] path."
[ac [k {:keys [all]}]]
(let [rules (mapcat :rules (vals (select-keys ac all)))]
(-> ac
(update-in [k :rules] concat rules)
(update-in [k :rules] set))))
(defn rule->map
"Adds rule to map of rules, conjoin rule to set of rules that
matches to pattern. Rules paths are keys in this map."
@@ -129,7 +117,7 @@
`~raw-rules
pairs)))
(defmacro defrules [name rules]
(defmacro defrules [name & rules]
`(def ~name (quote ~rules)))
(defn compile-rules
@@ -144,17 +132,12 @@
order-for-all-same? generate-all-orders
allow-swapping? swap
allow-backward? expand-backward-rules)
judgement-rules# (check-duplication (filter belief? rules))
judgement-rules# (check-duplication (filter judgement? rules))
question-rules# (check-duplication (filter question? rules))
goal-rules# (check-duplication (filter goal? rules))
quest-rules# (check-duplication (filter quest? rules))]
(println "Beliefs rules:" (count judgement-rules#))
(println "Questions rules:" (count question-rules#))
(println "Goal rules:" (count goal-rules#))
(println "Quests rules:" (count quest-rules#))
{:belief (rules-map judgement-rules# :belief)
:question (rules-map question-rules# :question)
:goal (rules-map goal-rules# :goal)
:quest (rules-map quest-rules# :quest)
:origin (group-by :origin rules)
:id (group-by :id rules)})))
goal-rules# (check-duplication (filter goal? rules))]
(println "Q rules:" (count question-rules#))
(println "J rules:" (count judgement-rules#))
(println "G rules:" (count goal-rules#))
{:judgement (rules-map judgement-rules# :judgement)
:question (rules-map question-rules# :question)
:goal (rules-map goal-rules# :goal)})))
+9 -30
View File
@@ -1,6 +1,5 @@
(ns nal.deriver.terms-permutation
(:require [nal.deriver.utils :refer [walk]]
[nal.deriver.utils :as u]))
(:require [nal.deriver.utils :refer [walk]]))
(defn contains-op?
"Checks if statement contains operators from set."
@@ -18,28 +17,11 @@
[statement from to]
(walk statement (= from el) to))
(def names
{'conj :conj
'&| :parallel-conj
'seq-conj :seq-conj
'<=> :equiv
'</> :pred-equiv
'<|> :conc-equiv
'==> :impl
'pred-impl :pred-impl
'=|> :concur-impl
'retro-impl :retro-impl})
(defn permute-op
"Makes permuatation of operators from s in statement."
[statement s]
(if-let [op (contains-op? statement s)]
(let [id (last statement)
st (butlast statement)]
(map (fn [new-op]
(let [new-id (u/concat-kw id :perm (names new-op))]
(replace-op (concat st [new-id]) op new-op)))
s))
(map #(replace-op statement op %) s)
[statement]))
;equivalences, implications, conjunctions - sets of operators that are use in
@@ -50,21 +32,18 @@
(defn generate-all-orders
"Permutes all operators in statement with :order-for-all-same precondition."
[{:keys [p1 p2 conclusions full-path pre id origin] :as rule}]
[{:keys [p1 p2 conclusions full-path pre] :as rule}]
(let [{:keys [conclusion] :as c1} (first conclusions)
statements
(->> (permute-op [p1 p2 conclusion full-path pre id] equivalences)
(mapcat (fn [st] (permute-op st conjunctions)))
(mapcat (fn [st] (permute-op st implications)))
set)]
(map (fn [[p1 p2 c full-path pre id]]
statements (->> (permute-op [p1 p2 conclusion full-path pre] equivalences)
(mapcat (fn [st] (permute-op st conjunctions)))
(mapcat (fn [st] (permute-op st implications)))
set)]
(map (fn [[p1 p2 c full-path pre]]
(assoc rule :p1 p1
:p2 p2
:full-path full-path
:conclusions [(assoc c1 :conclusion c)]
:pre pre
:id id
:origin origin))
:pre pre))
statements)))
(defn order-for-all-same?
+11 -9
View File
@@ -3,6 +3,7 @@
;https://github.com/opennars/opennars/blob/6611ee7f0b1428676b01ae4a382241a77ae3a346/nars_logic/src/main/java/nars/nal/meta/BeliefFunction.java
;https://github.com/opennars/opennars/blob/7b27dacec4cdbe77ca03d89296323d49875ac213/nars_logic/src/main/java/nars/truth/TruthFunctions.java
;https://github.com/opennars/opennars/blob/b3d97d1543b70dac604aff75eca7fe3d38f1e823/nars_logic/src/main/java/nars/truth/Truth.java#L87
(defn t-and
(^double [^double a ^double b] (* a b))
@@ -94,11 +95,11 @@
(defn difference [[^double f1 ^double c1] [^double f2 ^double c2]]
[(t-and f1 (- 1 f2)) (t-and c1 c2)])
(defn structual-intersection [_ p2] (deduction p2 [1 d/belief-confidence]))
(defn structual-intersection [_ p2] (deduction p2 [1 d/judgement-confidence]))
(defn structual-deduction [p1 _] (deduction p1 [1 d/belief-confidence]))
(defn structual-deduction [p1 _] (deduction p1 [1 d/judgement-confidence]))
(defn structual-abduction [p1 _] (abduction p1 [1 d/belief-confidence]))
(defn structual-abduction [p1 _] (abduction p1 [1 d/judgement-confidence]))
(defn reduce-conjunction [p1 p2]
(-> (negation p1 p2)
@@ -108,16 +109,14 @@
(defn t-identity [p1 _] p1)
(defn d-identity [p1 _] p1)
(defn belief-identity [p1 p2] (when p2 p1))
(defn belief-structural-deduction [_ p2]
(when p2 (deduction p2 [1 d/belief-confidence])))
(when p2 (deduction p2 [1 d/judgement-confidence])))
(defn belief-structural-difference [_ p2]
(when p2
(let [[^double f ^double c] (deduction p2 [1 d/belief-confidence])]
(let [[^double f ^double c] (deduction p2 [1 d/judgement-confidence])]
[(- 1 f) c])))
(defn belief-negation [_ p2] (when p2 (negation p2 nil)))
@@ -131,7 +130,10 @@
(defn desire-structural-strong
[t _]
(analogy t [1.0 d/belief-confidence]))
(analogy t [1.0 d/judgement-confidence]))
(defn expectation [[f c]]
(+ (* c (- f 0.5)) 0.5))
(def tvtypes
{:t/structural-deduction structual-abduction
@@ -168,6 +170,6 @@
:d/deduction intersection
:d/weak desire-weak
:d/induction desire-induction
:d/identity d-identity
:d/identity identity
:d/negation negation
:d/structural-strong desire-structural-strong})
+1 -9
View File
@@ -1,13 +1,5 @@
(ns nal.deriver.utils
(:require [clojure.walk :as w]
[clojure.string :as s]))
(defn concat-kw [& kws]
(->> (remove nil? kws)
(map name)
(remove #{""})
(s/join "-")
keyword))
(:require [clojure.walk :as w]))
(defn not-operator?
"Checks if element is not operator"
+18 -34
View File
@@ -10,6 +10,18 @@
nil)]
(aset dm (int ch) fun)))
(defn fetch-rule
([rdr] (fetch-rule rdr "" 0))
([rdr prev cnt]
(let [c (.read rdr)
cnt (case (char c)
\] (dec cnt)
\[ (inc cnt)
cnt)]
(if (neg? cnt)
prev
(recur rdr (str prev (char c)) cnt)))))
(defn add-brackets [s]
(str "[" s "]"))
@@ -35,38 +47,10 @@
(defn read-rule [s]
(-> s replacements add-brackets read-string))
(defn fetch-rules
([rdr] (fetch-rules rdr "" nil 0))
([rdr prev prev-char cnt]
(let [n (.read rdr)
c (char n)]
(if (and (= c \#) (= \R prev-char))
prev
(recur rdr (str prev c) c cnt)))))
(defn comment->key [comment]
(-> comment
(s/replace #"\s" "-")
(s/replace #";" "")
keyword))
(defn rules [rdr _ _ & _]
(->> (reduce (fn [{:keys [prev-comment prev-not-comment]
:as ac} l]
(if (or (s/starts-with? l ";")
(s/starts-with? l "R"))
(-> (assoc ac :prev-comment l
:prev-not-comment "")
(update :rules conj {:comment prev-comment
:rule prev-not-comment}))
(update ac :prev-not-comment str l)))
{:prev-not-comment ""}
(map s/trim (s/split-lines (fetch-rules rdr))))
:rules
(remove (fn [{c :comment r :rule}] (or (nil? c) (empty? r))))
(map (fn [{:keys [comment rule]}]
(let [id (comment->key comment)]
(vec (concat (read-rule rule) [:origin id :id id])))))))
(dispatch-reader-macro \R rules)
(defn rule [rdr letter-R opts & other]
(let [c (.read rdr)]
(if (= c (int \[))
(read-rule (fetch-rule rdr))
(throw (Exception. (str "Reader barfed on " (char c)))))))
(dispatch-reader-macro \R rule)
+343 -892
View File
File diff suppressed because it is too large Load Diff
+128
View File
@@ -0,0 +1,128 @@
(ns narjure.control.general-inference
(:require
[onyx.job :refer [add-task]]
[onyx.plugin.kafka]
[onyx.tasks.kafka :refer [consumer producer]]
[narjure.system :refer [inference]]
[taoensso.timbre :refer [info]]
[narjure.memory.api :as m]
[narjure.control.utils :refer [leaf-function intermediate-function
inject-memory kafka-consumer
kafka-producer]]))
(def workflow
[[:select-active-concepts :select-task-link]
[:select-task-link :update-tasklink-budget]
[:select-task-link :select-term-link]
[:select-term-link :update-termlink-budget]
[:select-term-link :do-general-inference]
[:do-general-inference :write-tasks]
[:select-term-link :choose-answer]
[:choose-answer :write-answer]])
(def flow-conditions
[{:flow/from :select-term-link
:flow/to [:do-general-inference]
:flow/predicate [:not ::question-with-query-var?]}
{:flow/from :select-term-link
:flow/to [:choose-answer]
:flow/predicate ::question-with-query-var?}])
(defn question-with-query-var? [_ _ segment _]
(if (:question-with-query-var segment) true false))
(defn catalog [batch-settings]
(mapv #(merge % batch-settings)
[(intermediate-function :select-task-link ::select-task-link)
(leaf-function :update-tasklink-budget ::update-tasklink-budget batch-settings)
(intermediate-function :select-term-link ::select-term-link)
(leaf-function :update-termlink-budget ::update-termlink-budget batch-settings)
(intermediate-function :do-general-inference ::do-general-inference)
(intermediate-function :choose-answer ::choose-answer)]))
(def tasks-with-redis-access
(disj (set (flatten workflow))
:select-active-concepts
:write-tasks
:write-answer
:do-general-inference))
(def lifecycles
(concat
(map #(hash-map :lifecycle/task %
:lifecycle/calls :narjure.control.utils/memory-call)
tasks-with-redis-access)
[{:lifecycle/task :do-general-inference
:lifecycle/calls ::inference-call}]))
(defn inject-inference
[{params :onyx.core/params} _]
{:onyx.core/params (conj params inference)})
(def inference-call
{:lifecycle/before-task-start inject-inference})
(defn build-job
[zk-address concepts-topic tasks-topic ansers-topic batch-size batch-timeout]
(let [batch-settings {:onyx/batch-size batch-size
:onyx/batch-timeout batch-timeout}
base-job (merge {:workflow workflow
:catalog (catalog batch-settings)
:lifecycles lifecycles
:windows []
:triggers []
:flow-conditions flow-conditions
:task-scheduler :onyx.task-scheduler/balanced})]
(-> base-job
(add-task (kafka-consumer :select-active-concepts concepts-topic
zk-address batch-settings 1))
(add-task (kafka-producer :write-tasks tasks-topic zk-address
batch-settings))
(add-task (kafka-producer :write-answer ansers-topic zk-address
batch-settings)))))
;-------------------------------------------------------------------------------
;functions
(defn select-task-link [mem {:keys [concept] :as segment}]
(let [task (m/select-task mem concept)]
(merge segment {:task task
:concept concept})))
(defn update-tasklink-budget [mem segment]
(info :update-tasklink-budget))
(defn select-term-link
[mem {:keys [concept task] :as segment}]
(let [{linked-concept :concept} (m/select-termlink mem concept)
occurrence (:occurrence task)
belief (m/select-belief mem linked-concept occurrence)]
(info :belief belief)
(assoc segment :belief belief)))
(defn update-termlink-budget [mem segment]
(info :update-termlink-budget))
(defn do-general-inference
[inference {:keys [task belief]}]
(let [belief (:task belief)
{:keys [frequency confidence plausibility statement
desirability task-type occurrence]} (:task task)
task {:statement statement
:desire [plausibility desirability]
:truth [frequency confidence]
:task-type task-type
:occurrence occurrence}
{:keys [confidence frequency]} belief
belief (assoc belief :truth [frequency confidence])]
(info :inference task belief)
(mapv (fn [conclusion] {:message conclusion})
(inference task belief))))
(defn choose-answer [mem segment]
(info :choose-answer)
{:message {:some-answer true}})
@@ -0,0 +1,129 @@
(ns narjure.control.local-inference.beliefs
(:require
[onyx.plugin.kafka]
[narjure.memory.api :as m]
[taoensso.timbre :refer [info]]
[narjure.control.local-inference.utils :as u]))
(def workflow
[[:read-beliefs :check-satisfaction]
[:check-satisfaction :revise-anticipations]
[:revise-anticipations :revise-beliefs]
[:revise-beliefs :check-questions]
[:check-questions :add-tasklink]
[:check-questions :add-revised-tasklink]
[:check-questions :update-questions-budgets]
[:check-questions :update-goal-budget]
[:check-questions :prepare-answers]
[:prepare-answers :write-answers]
[:check-questions :add-anticipation-tasklink]])
(def flow-conditions
[{:flow/from :check-questions
:flow/to [:add-revised-tasklink]
:flow/predicate :narjure.control.local-inference.utils/has-revised-task?}
{:flow/from :check-questions
:flow/to [:add-anticipation-tasklink]
:flow/predicate ::observable?}
{:flow/from :check-questions
:flow/to [:add-tasklink]
:flow/predicate :narjure.control.local-inference.utils/constantly-true}
{:flow/from :check-questions
:flow/to [:update-questions-budgets :prepare-answers]
:flow/predicate :narjure.control.local-inference.utils/has-answers?}
{:flow/from :check-questions
:flow/to [:update-goal-budget]
:flow/predicate ::satisfied-goal?}])
(def kafka-io #{:read-beliefs :write-answers})
(def leaves
#{:add-tasklink :add-revised-tasklink :add-anticipation-tasklink
:update-questions-budgets :update-goal-budget})
(def build-job
(u/get-job-builder (namespace ::k) workflow kafka-io leaves flow-conditions))
;-------------------------------------------------------------------------------
;predicates
(defn observable? [_ _ {:keys [revised-task]} _]
;TODO implement
false)
(defn satisfied-goal? [_ _ {:keys [satisfied-goal]} _]
satisfied-goal)
;-------------------------------------------------------------------------------
;functions
(defn check-satisfaction
[mem {{:keys [statement] :as task} :task :as segment}]
(if-let [goals (m/goals mem statement)]
(let [goal-tasklink (u/rank goals task)
satisfaction (u/satisfaction (:task goal-tasklink) task)]
(-> segment
(update-in [:task :durability] u/increase-durability satisfaction)
(assoc :satisfied-goal
{:goal goal-tasklink
:priority-diff (u/priority-diff goal-tasklink satisfaction)})))
segment))
;TODO implement
(defn revise-anticipations [_ segment]
segment)
(defn revise-beliefs
[mem {{:keys [statement] :as task} :task :as segment}]
(let [beliefs (m/beliefs mem statement)]
(if-let [revised-task (u/revise beliefs task)]
(assoc segment :revised-task (dissoc revised-task :id))
segment)))
(defn answer-question
[question-tasklink answer]
(let [satisfaction (u/q-satisfaction answer)]
{:question question-tasklink
:satisfaction satisfaction
:priority-diff (u/priority-diff question-tasklink satisfaction)}))
(defn check-questions
[mem {{:keys [statement] :as task} :task
revised-task :revised-task
:as segment}]
(if-let [questions (m/questions mem statement)]
(let [answer (or revised-task task)
results (mapv #(answer-question % answer) questions)
answer (reduce
(fn [answer {:keys [satisfaction]}]
(update answer :durability u/increase-durability satisfaction))
answer
results)]
(assoc segment
:answers results
(if revised-task :revised-task :task) answer))
segment))
(defn prepare-answers [_ {:keys [answers]}]
(mapv (fn [answer] {:message answer}) answers))
(defn add-tasklink
[mem {:keys [task]}]
(u/add-tasklink* mem (:statement task) task "belief"))
(defn add-revised-tasklink
[mem {:keys [revised-task]}]
(let [id (m/add-task mem revised-task)
revised-task' (assoc revised-task :id id)]
(u/add-tasklink* mem (:statement revised-task) revised-task' "belief")))
(defn update-questions-budgets
[mem {:keys [answers]}]
(mapv (fn [{:keys [question priority-diff]}]
(m/increment-value mem (question :id) :priority priority-diff))
answers))
(defn update-goal-budget
[mem {{:keys [goal priority-diff]} :satisfied-goal}]
(m/increment-value mem (goal :id) :priority priority-diff))
;TODO implement
(defn add-anticipation-tasklink [mem segment])
@@ -0,0 +1,135 @@
(ns narjure.control.local-inference.goals
(:require
[onyx.plugin.kafka]
[narjure.memory.api :as m]
[taoensso.timbre :refer [info]]
[narjure.control.local-inference.utils :as u]))
(def workflow
[[:read-goals :check-solution]
[:check-solution :revise-goals]
[:revise-goals :check-quests]
[:check-quests :check-operator]
[:check-operator :add-tasklink]
[:check-operator :add-revised-tasklink]
[:check-operator :update-quests-budgets]
[:check-operator :update-belief-budget]
[:check-operator :prepare-answers]
[:prepare-answers :write-answers]
[:check-operator :send-operator]])
(def flow-conditions
[{:flow/from :check-operator
:flow/to [:add-revised-tasklink]
:flow/predicate ::narjure.control.local-inference.utils/has-revised-task?}
{:flow/from :check-operator
:flow/to [:send-operator]
:flow/predicate ::has-operator-to-execute?}
{:flow/from :check-operator
:flow/to [:add-tasklink]
:flow/predicate :narjure.control.local-inference.utils/constantly-true}
{:flow/from :check-operator
:flow/to [:update-quests-budgets :prepare-answers]
:flow/predicate :narjure.control.local-inference.utils/has-answers?}
{:flow/from :check-operator
:flow/to [:update-belief-budget]
:flow/predicate ::has-solution?}])
(def io #{:read-goals :write-answers})
(def leaves
#{:add-tasklink :add-revised-tasklink :send-operator
:update-quests-budgets :update-belief-budget})
(def build-job
(u/get-job-builder (namespace ::k) workflow io leaves flow-conditions))
;-------------------------------------------------------------------------------
;predicates
(defn has-operator-to-execute? [_ _ _ _]
;TODO implement
false)
(defn has-solution? [_ _ {:keys [belief-solution]} _]
belief-solution)
;-------------------------------------------------------------------------------
;functions
(defn durability-diff
[{:keys [durability]} satisfaction]
(-> durability
(u/increase-durability satisfaction)
(- durability)))
(defn check-solution
[mem {{:keys [statement] :as task} :task :as segment}]
(if-let [beliefs (m/beliefs mem statement)]
(let [belief-tasklink (u/rank beliefs task)
satisfaction (u/satisfaction task (:task belief-tasklink))]
(-> segment
(update-in [:task :priority] u/reduce-priority satisfaction)
(assoc :belief-solution
{:belief belief-tasklink
:durability-diff (durability-diff belief-tasklink
satisfaction)})))
segment))
(defn revise-goals
[mem {{:keys [statement] :as task} :task :as segment}]
(let [goals (m/goals mem statement)]
(if-let [revised-task (u/revise goals task)]
(assoc segment :revised-task (dissoc revised-task :id))
segment)))
(defn answer-question
[quest-tasklink answer]
(let [satisfaction (u/q-satisfaction answer)]
{:quest quest-tasklink
:satisfaction satisfaction
:priority-diff (u/priority-diff quest-tasklink satisfaction)}))
(defn check-quests
[mem {{:keys [statement] :as task} :task
revised-task :revised-task
:as segment}]
(if-let [quests (m/quests mem statement)]
(let [answer (or revised-task task)
results (mapv #(answer-question % answer) quests)
answer (reduce
(fn [answer {:keys [satisfaction]}]
(update answer :durability u/increase-durability satisfaction))
answer
results)]
(assoc segment
:answers results
(if revised-task :revised-task :task) answer))
segment))
;TODO implement
(defn check-operator [_ segment]
segment)
(defn prepare-answers [_ {:keys [answers]}]
(mapv (fn [answer] {:message answer}) answers))
(defn add-tasklink
[mem {:keys [task]}]
(u/add-tasklink* mem (:statement task) task "goal"))
(defn add-revised-tasklink
[mem {:keys [revised-task]}]
(let [id (m/add-task mem revised-task)
revised-task' (assoc revised-task :id id)]
(u/add-tasklink* mem (:statement revised-task) revised-task' "goal")))
(defn update-quests-budgets
[mem {:keys [answers]}]
(mapv (fn [{:keys [quest priority-diff]}]
(m/increment-value mem (quest :id) :priority priority-diff))
answers))
(defn update-belief-budget
[mem {{:keys [belief durability-diff]} :belief-solution}]
(m/increment-value mem (belief :id) :durability durability-diff))
(defn send-operator [mem segment])
@@ -0,0 +1,57 @@
(ns narjure.control.local-inference.questions
(:require
[narjure.memory.api :as m]
[onyx.job :refer [add-task]]
[taoensso.timbre :refer [info]]
[narjure.control.local-inference.utils :as u]))
(def workflow
[[:read-questions :check-answer]
[:check-answer :add-tasklink]
[:check-answer :update-belief-budget]
[:check-answer :prepeare-answer]
[:prepeare-answer :write-answer]])
(def flow-conditions
[{:flow/from :check-answer
:flow/to [:update-belief-budget :prepeare-answer]
:flow/predicate :narjure.control.local-inference.utils/has-answer?}
{:flow/from :check-answer
:flow/to [:add-tasklink]
:flow/predicate :narjure.control.local-inference.utils/constantly-true}])
(def kafka-io #{:read-questions :write-answer})
(def leaves #{:add-tasklink :update-belief-budget})
(def build-job
(u/get-job-builder (namespace ::k) workflow kafka-io leaves flow-conditions))
;-------------------------------------------------------------------------------
;functions
(defn check-answer
[mem {{:keys [statement] :as task} :task
:as segment}]
(if-let [beliefs (m/beliefs mem statement)]
(let [belief-tasklink (u/rank beliefs task)
satisfaction (u/q-satisfaction (:task belief-tasklink))
task' (update task :priority u/reduce-priority satisfaction)]
(assoc segment
:task task'
:answer {:belief belief-tasklink
:question task'
:durability-diff (u/durability-diff belief-tasklink
satisfaction)}))
segment))
(defn add-tasklink
[mem {:keys [task]}]
(u/add-tasklink* mem (:statement task) task "question"))
(defn prepeare-answer [_ {:keys [answer]}]
;TODO check if input question
{:message answer})
(defn update-belief-budget
[mem {{:keys [belief durability-diff]} :answer}]
(m/increment-value mem (belief :id) :durability durability-diff))
@@ -0,0 +1,57 @@
(ns narjure.control.local-inference.quests
(:require
[narjure.memory.api :as m]
[onyx.job :refer [add-task]]
[taoensso.timbre :refer [info]]
[narjure.control.local-inference.utils :as u]))
(def workflow
[[:read-quests :check-answer]
[:check-answer :add-tasklink]
[:check-answer :update-goal-budget]
[:check-answer :prepeare-answer]
[:prepeare-answer :write-answer]])
(def flow-conditions
[{:flow/from :check-answer
:flow/to [:update-goal-budget :prepeare-answer]
:flow/predicate :narjure.control.local-inference.utils/has-answer?}
{:flow/from :check-answer
:flow/to [:add-tasklink]
:flow/predicate :narjure.control.local-inference.utils/constantly-true}])
(def kafka-io #{:read-quests :write-answer})
(def leaves #{:add-tasklink :update-goal-budget})
(def build-job
(u/get-job-builder (namespace ::k) workflow kafka-io leaves flow-conditions))
;-------------------------------------------------------------------------------
;functions
(defn check-answer
[mem {{:keys [statement] :as task} :task
:as segment}]
(if-let [goals (m/goals mem statement)]
(let [goal-tasklink (u/rank goals task)
satisfaction (u/q-satisfaction (:task goal-tasklink))
task' (update task :priority u/reduce-priority satisfaction)]
(assoc segment
:task task'
:answer {:goal goal-tasklink
:quest task'
:durability-diff (u/durability-diff goal-tasklink
satisfaction)}))
segment))
(defn add-tasklink
[mem {:keys [task]}]
(u/add-tasklink* mem (:statement task) task "quest"))
(defn prepeare-answer [_ {:keys [answer]}]
;TODO check if input question
{:message answer})
(defn update-goal-budget
[mem {{:keys [goal durability-diff]} :answer}]
(m/increment-value mem (goal :id) :durability durability-diff))
@@ -0,0 +1,197 @@
(ns narjure.control.local-inference.utils
(:require
[onyx.plugin.kafka]
[narjure.memory.api :as m]
[nal.deriver.truth :as t]
[onyx.job :refer [add-task]]
[narjure.control.utils :refer [leaf-function intermediate-function
kafka-consumer kafka-producer]]
[clojure.set :as s]))
(defn has-answers? [_ _ {:keys [answers]} _] (seq answers))
(defn has-answer? [_ _ {:keys [answer]} _] answer)
(defn has-revised-task? [_ _ {:keys [revised-task]} _] revised-task)
(def constantly-true (constantly true))
(defn add-tasklink* [mem concept task type]
(let [link (-> (select-keys task [:priority :durability])
(assoc :task (:id task)))
id (m/add-tasklink mem concept link (or type "task"))]
id))
(defn get-frequency [{:keys [frequency plausibility]}]
[(if frequency :frequency :plausibility)
(or frequency plausibility)])
(defn get-confidence [{:keys [confidence desirability]}]
[(if confidence :confidence :desirability)
(or confidence desirability)])
(defn revision
[revised task2]
(let [[f1k f1] (get-frequency revised)
[_ f2] (get-frequency task2)
[c1k c1] (get-confidence revised)
[_ c2] (get-confidence task2)
c2' (- 1 c2)
c1' (- 1 c1)
c1-c2' (* c1 c2')
c2-c1' (* c2 c1')
x (+ c1-c2' c2-c1')
f (/ (+ (* f1 c1-c2') (* f2 c2-c1'))
x)
c (/ x (+ x (* c1' c2')))]
{f1k f
c1k c}))
(defn overlaps? [evidences1 evidences2]
(seq (s/intersection (set evidences1)
(set evidences2))))
(defn merge-evidences
[ev1 ev2]
(vec (s/union (set ev1) (set ev2))))
(defn eternalize
[{:keys [confidence desirability] :as task}]
(let [k (if confidence :confidence :desirability)
val (or confidence desirability)]
(assoc task k (t/w2c val))))
(defn project-confidence
[source-time target-time current-time confidence]
(let [kc (/ (Math/abs (- source-time target-time))
(+ (Math/abs (- source-time current-time))
(Math/abs (- target-time current-time))))]
(* (- 1 kc) confidence)))
(defn project
[{source :occurrence
eternal-source :eternal
:as projected}
{target :occurrence
eternal-target :eternal
creation :creation-time}]
(case [eternal-target eternal-source]
[true false] (eternalize projected)
[false false]
(if (= source target)
projected
(let [[k value] (get-confidence projected)
new-value (project-confidence source target creation value)]
(assoc projected k new-value)))
:else projected))
(defn revise [tasklinks task]
(let [revised (reduce (fn [{:keys [evidences] :as input}
{:keys [task]}]
(if (overlaps? evidences (:evidences task))
input
(let [
evidences (merge-evidences evidences
(:evidences task))
projected (project task input)
revised-tv (revision input projected)]
(-> input
(assoc :evidences evidences)
(merge revised-tv)))))
task tasklinks)]
(when-not (= revised task) revised)))
(defn rank [tasklinks input]
(reduce (fn [{ac-task :task :as ac}
{:keys [task] :as tasklink}]
(let [projected (project task input)
[_ p-confidence] (get-confidence projected)
[_ ac-confidence] (get-confidence ac-task)]
(if (and (not (nil? ac)) (> ac-confidence p-confidence))
ac
(assoc tasklink :task projected))))
nil
tasklinks))
(defn satisfaction* [d t]
(- 1 (Math/abs (- (t/expectation d) (t/expectation t)))))
(defn satisfaction
[{:keys [plausibility desirability]}
{:keys [frequency confidence]}]
(satisfaction* [plausibility desirability]
[frequency confidence]))
(defn q-satisfaction [{:keys [confidence desirability]}]
(- 1 (or confidence desirability)))
(defn reduce-priority [priority satisfaction]
(t/t-and priority (- 1 satisfaction)))
(defn priority-diff
[{:keys [priority]} satisfaction]
(-> priority
(reduce-priority satisfaction)
(- priority)))
(defn increase-durability [durability satisfaction]
;TODO define k somewhere
(let [k 1]
(t/t-or durability (* k satisfaction))))
(defn durability-diff
[{:keys [durability]} satisfaction]
(-> durability
(increase-durability satisfaction)
(- durability)))
(defn save-task
[mem {:keys [task] :as segment}]
(assoc-in segment [:task :id] (m/add-task mem task)))
(defn get-catalog-builder
[functions-ns all leaves io]
(fn [batch-settings]
(let [add-ns #(keyword (str functions-ns "/" (name %)))
intermediates (s/difference all leaves io)
leaf-tasks (map #(leaf-function % (add-ns %) batch-settings) leaves)
inter-tasks (map #(intermediate-function % (add-ns %)) intermediates)]
(mapv #(merge % batch-settings) (concat leaf-tasks inter-tasks)))))
(defn job-builder
[workflow catalog-f lifecycles flow-conditions io]
(fn [zk-address {:keys [input output]} batch-size batch-timeout]
(let [batch-settings {:onyx/batch-size batch-size
:onyx/batch-timeout batch-timeout}
base-job (merge {:workflow workflow
:catalog (catalog-f batch-settings)
:lifecycles lifecycles
:windows []
:triggers []
:flow-conditions flow-conditions
:task-scheduler :onyx.task-scheduler/balanced})]
(let [parameters (s/union (set (keys input)) (set (keys output)))]
(assert
(= parameters io)
(format "All consumers/producers must be specified, %s are missed."
(s/difference io parameters))))
(reduce
add-task
base-job
(concat
(map (fn [[task topic]]
(kafka-consumer task topic zk-address batch-settings 1)) input)
(map (fn [[task topic]]
(kafka-producer task topic zk-address batch-settings)) output))))))
(defn get-job-builder
[functions-ns workflow io leaves flow-conditions]
(let [all (set (flatten workflow))
catalog (get-catalog-builder functions-ns all leaves io)
tasks-with-redis-access (s/difference all io)
lifecycles
(mapv #(hash-map :lifecycle/task %
:lifecycle/calls :narjure.control.utils/memory-call)
tasks-with-redis-access)]
(job-builder workflow catalog lifecycles flow-conditions io)))
@@ -0,0 +1,79 @@
(ns narjure.control.task-preprocessing
(:require [narjure.control.local-inference.utils :as u]
[narjure.memory.api :as m]
[taoensso.timbre :refer [info]]
[clojure.set :as s]))
(def workflow
[[:read-task :save-task]
[:save-task :prepare-task]
[:save-task :add-tasklinks]
[:prepare-task :write-belief]
[:prepare-task :write-goal]
[:prepare-task :write-question]
[:prepare-task :write-quest]])
(def flow-conditions
[{:flow/from :prepare-task
:flow/to [:write-belief]
:flow/predicate ::belief?}
{:flow/from :prepare-task
:flow/to [:write-goal]
:flow/predicate ::goal?}
{:flow/from :prepare-task
:flow/to [:write-question]
:flow/predicate ::question?}
{:flow/from :prepare-task
:flow/to [:write-quest]
:flow/predicate ::quest?}])
(def kafka-io
#{:read-task :write-belief :write-goal :write-question :write-quest})
(def leaves #{:add-tasklinks})
(def build-job
(u/get-job-builder (namespace ::k) workflow kafka-io leaves flow-conditions))
;-------------------------------------------------------------------------------
;predicates
(defn goal? [_ _ {{:keys [task-type]} :message} _]
(= :goal task-type))
(defn belief? [_ _ {{:keys [task-type]} :message} _]
(= :belief task-type))
(defn question? [_ _ {{:keys [task-type]} :message} _]
(= :question task-type))
(defn quest? [_ _ {{:keys [task-type]} :message} _]
(= :quest task-type))
;-------------------------------------------------------------------------------
;functions
(defn save-task [mem task]
(info :tsk task)
(let [id (m/add-task mem task)]
(assoc task :id id)))
(defn prepare-task [_ task]
(info :prep task)
{:message task})
(defn children-terms
([statement] (children-terms statement 0))
([statement level]
(if (and (> 2 level) (coll? statement))
(let [[f & tail] statement
next-level (if (= 'conj f) level (inc level))
children (map #(children-terms % next-level) tail)]
(apply s/union (set tail) children))
[statement])))
(defn add-tasklinks [mem {:keys [statement occurrence] :as task}]
(doseq [term (conj (children-terms statement) occurrence)]
(m/add-term mem term)
(u/add-tasklink* mem term task "link")))
+52
View File
@@ -0,0 +1,52 @@
(ns narjure.control.utils
(:require [narjure.system :refer [mem inference]]
[onyx.tasks.kafka :refer [consumer producer]]))
(defn intermediate-function
[name function]
{:onyx/name name
:onyx/fn function
:onyx/type :function})
(defn leaf-function
[name function batch-settings]
(merge {:onyx/name name
:onyx/fn function
:onyx/plugin :onyx.peer.function/function
:onyx/medium :function
:onyx/type :output
:onyx/batch-size 20}
batch-settings))
(defn inject-memory
[{params :onyx.core/params} _]
{:onyx.core/params (conj params mem)})
(defn kafka-consumer
[name topic zk-address batch-settings n-peers]
(consumer
name
(merge {:kafka/topic topic
:kafka/group-id "onyx-consumer"
:kafka/zookeeper zk-address
:kafka/offset-reset :smallest
:kafka/force-reset? true
:kafka/deserializer-fn :onyx.tasks.kafka/deserialize-message-edn
:onyx/max-peers n-peers
:onyx/min-peers n-peers}
batch-settings)))
(def default-producer-config
{:kafka/serializer-fn :onyx.tasks.kafka/serialize-message-edn
:kafka/request-size 307200})
(defn kafka-producer
[name topic zk-address batch-settings]
(producer name
(merge {:kafka/topic topic
:kafka/zookeeper zk-address}
default-producer-config
batch-settings)))
(def memory-call
{:lifecycle/before-task-start inject-memory})
+11 -11
View File
@@ -1,18 +1,18 @@
(ns narjure.defaults)
(def belief-frequency 1.0)
(def belief-confidence 0.9)
(def judgement-frequency 1.0)
(def judgement-confidence 0.9)
(def truth-value
[belief-frequency belief-confidence])
[judgement-frequency judgement-confidence])
(def belief-priority 0.5)
(def belief-durability 0.8)
(def judgement-priority 0.5)
(def judgement-durability 0.8)
;todo clarify this
(def belief-quality 0.5)
(def judgement-quality 0.5)
(def belief-budget
[belief-priority belief-durability belief-quality])
(def judgement-budget
[judgement-priority judgement-durability judgement-quality])
(def question-priority 0.5)
(def question-durability 0.9)
@@ -20,16 +20,16 @@
(def question-quality 0.5)
(def question-budget
[belief-priority belief-durability belief-quality])
[judgement-priority judgement-durability judgement-quality])
(def goal-confidence 0.9)
(def goal-priority 0.5)
(def goal-durability 0.8)
(def budgets
{:belief belief-budget
{:judgement judgement-budget
:question question-budget})
(def ^{:type double} horizon 1)
(def duration 80)
(def temporal-window-duration 80)
+24
View File
@@ -0,0 +1,24 @@
(ns narjure.memory.api)
(defprotocol Memory
(term [mem concept])
(beliefs [mem concept])
(goals [mem concept])
(questions [mem concept])
(quests [mem concept])
(tasklinks [mem concept])
(termlinks [mem concept])
(budget [mem concept])
(select-task [mem concept])
(select-termlink [mem concept])
(select-belief [mem concept occurrence])
(add-term [mem concept])
(add-task [mem task])
(add-tasklink [mem concept link type])
(add-termlink [mem concept link])
(remove-tasklink [mem concept id])
(remove-termlink [mem concept id])
(increment-value [mem id name value]))
+183
View File
@@ -0,0 +1,183 @@
(ns narjure.memory.redis
(:require [taoensso.carmine :as c]
[narjure.memory.api :refer [Memory] :as m]
[taoensso.timbre :refer [info]])
(:import (java.util UUID)))
;postfixes for keys
(def tasklinks-pf "_tkl")
(def termlinks-pf "_tml")
(def budget-pf "_bg")
(def task-pf "_tsk")
(def parse-float #(Float/parseFloat %))
(def parse-int #(Integer/parseInt %))
(defn parse-boolean
[val]
(info :opopop val (type val))
(Boolean/parseBoolean val))
(def task-schema
{:task-type :keyword
:evidences :vector
:eternal :boolean
:occurrence :int
:frequency :float
:confidence :float
:plausibility :float
:desirability :float
:statement :any
:creation-time :int})
(def termlink-schema
{:priority :float
:durability :float
:quality :float
:concept :string})
(def tasklink-schema
{:priority :float
:durability :float
:quality :float
:task :string})
(def deserialization-fn
{:float parse-float
:int parse-int
:keyword keyword})
(defn apply-schema [val]
(->> val
(map (fn [[k v]]
[k (get deserialization-fn v identity)]))
(into {})))
(def deserial-map
(reduce (fn [ac [key val]] (assoc ac key (apply-schema val)))
{}
{task-pf task-schema
tasklinks-pf tasklink-schema
termlinks-pf termlink-schema}))
(defn- check-hash [val]
(if (or (integer? val) (string? val)) val (hash val)))
(defn get-key [concept postfix]
(str (check-hash concept) postfix))
(defn- get-maps-ids-from-set [conn concept postfix]
(->> (get-key concept postfix)
c/smembers
(c/wcar conn)))
(defn- get-maps-ids-from-hash [conn concept postfix]
(->> (get-key concept postfix)
c/hgetall
(c/wcar conn)
(apply hash-map)))
(defn xf [trans-map]
(comp (partition-all 2)
(map (fn [[k v]]
(let [k (keyword k)
tf (get trans-map k identity)]
[k (tf v)])))))
(defn- get-map-by-key [conn trans-map k]
(into {} (xf trans-map) (c/wcar conn (c/hgetall k))))
(defn- get-maps-from-set [conn concept postfix]
(map (partial get-map-by-key conn (deserial-map postfix))
(get-maps-ids-from-set conn concept postfix)))
(defn- get-tasklinks [conn concept pred]
(let [links (->> (get-maps-ids-from-hash conn concept tasklinks-pf)
(filter (fn [[_ v]] (pred v)))
keys
(mapv (partial get-map-by-key conn (deserial-map tasklinks-pf))))]
(seq (mapv (fn [{:keys [task] :as link}]
(let [task (get-map-by-key conn (deserial-map task-pf) task)]
(assoc link :task task)))
links))))
(defn- get-map [conn concept postfix]
(get-map-by-key conn (deserial-map postfix) (get-key concept postfix)))
(defn- add-map [conn concept postfix data]
(let [id (str (UUID/randomUUID) postfix)]
(c/wcar conn (c/sadd (get-key concept postfix) id))
(c/wcar conn (c/hmset* id (assoc data :id id)))))
(defn- remove-map [conn concept postfix id]
(c/wcar conn (c/srem (get-key concept postfix) id))
(c/wcar conn (c/del id)))
(defn remove-tasklink* [conn concept id]
(c/wcar conn (c/hdel (get-key concept tasklinks-pf) id))
(c/wcar conn (c/del id)))
(defn- add-task* [conn task]
(let [id (str (UUID/randomUUID) task-pf)]
(c/wcar conn (c/hmset* id task))
id))
(defn- select-link [conn concept prefix]
(let [id (->> prefix
(get-key concept)
c/srandmember
(c/wcar conn))]
(get-map-by-key conn (deserial-map prefix) id)))
(defn- select-task [conn concept]
(let [link (->> (c/wcar conn (c/hkeys (get-key concept tasklinks-pf)))
(mapv (partial get-map-by-key conn (deserial-map tasklinks-pf)))
rand-nth)
task-id (:task link)]
(assoc link :task (get-map-by-key conn (deserial-map task-pf) task-id))))
(defn get-task [conn id]
(get-map-by-key conn (deserial-map task-pf) id))
(defn belief? [s] (= "belief" s))
(defn goal? [s] (= "goal" s))
(defn question? [s] (= "question" s))
(defn quest? [s] (= "quest" s))
(defn add-term* [conn concept]
(c/wcar conn (c/set (hash concept) concept)))
(defn add-tasklink* [conn concept link type]
(let [id (str (UUID/randomUUID) tasklinks-pf)]
(c/wcar conn (c/hset (get-key concept tasklinks-pf) id type))
(c/wcar conn (c/hmset* id (assoc link :id id)))
id))
(defn increment-value* [conn id name value]
(c/wcar conn (c/hincrbyfloat id name value)))
(defrecord RedisMemory
[conn]
Memory
(term [_ concept] (c/wcar conn (c/get (check-hash concept))))
(beliefs [_ concept] (get-tasklinks conn concept belief?))
(goals [_ concept] (get-tasklinks conn concept goal?))
(questions [_ concept] (get-tasklinks conn concept question?))
(quests [_ concept] (get-tasklinks conn concept quest?))
(tasklinks [_ concept] (get-tasklinks conn concept (constantly true)))
(termlinks [_ concept] (get-maps-from-set conn concept termlinks-pf))
(budget [_ concept] (get-map conn concept budget-pf))
(select-task [_ concept] (select-task conn concept))
(select-termlink [_ concept] (select-link conn concept termlinks-pf))
(select-belief [mem concept occurrence]
(let [beliefs (m/beliefs mem concept)]
(when (sequential? beliefs) (rand-nth beliefs))))
(add-term [_ concept] (add-term* conn concept))
(add-task [_ task] (add-task* conn task))
(add-tasklink [_ concept link type] (add-tasklink* conn concept link type))
(add-termlink [_ concept link] (add-map conn concept termlinks-pf link))
(remove-tasklink [_ concept id] (remove-tasklink* conn concept id))
(remove-termlink [_ concept id] (remove-map conn concept termlinks-pf id))
(increment-value [_ id name value] (increment-value* conn id name value)))
+1 -1
View File
@@ -43,7 +43,7 @@
(defn get-compound-term [[_ operator-srt]]
(compound-terms operator-srt))
(def actions {"." :belief
(def actions {"." :judgement
"?" :question})
(def ^:dynamic *action* (atom nil))
+24
View File
@@ -0,0 +1,24 @@
(ns narjure.system
(:require [mount.core :refer [defstate start]]
[narjure.memory.redis :as r]
[nal.deriver.rules :refer [compile-rules]]
[nal.rules :refer [all-rules]]
[nal.core :as c]
[aero.core :refer [read-config]]))
(declare mem inference)
(def config
(read-config (clojure.java.io/resource "config.edn") {:profile :dev}))
(defn get-config [path]
(get-in config path))
(def redis-config
{:spec {:uri (get-config [:redis-config :uri])}})
(defstate mem :start (r/->RedisMemory redis-config))
(defstate inference :start (let [rules (compile-rules all-rules)]
(partial c/inference rules)))
(start)
+195 -82
View File
@@ -1,158 +1,271 @@
(ns nal.test.core
(:require [clojure.test :refer :all]
[nal.core :refer :all]))
[nal.core :as c]
[nal.rules :as r]
[nal.deriver.rules :refer [compile-rules]]))
(def inference (partial c/inference (compile-rules r/all-rules)))
(deftest test-inference
(are [a1 a2] (= (set a1) (set (apply inference a2)))
'({:statement [==>
[&| [--> [ext-set tim] [int-set driving]]]
[--> [ext-set tim] [int-set dead]]]
:truth [1.0 0.81]
:task-type :belief
'({:statement [==>
[&| [--> [ext-set tim] [int-set driving]]]
[--> [ext-set tim] [int-set dead]]]
:truth [1.0 0.81]
:task-type :judgement
:occurrence 1})
'[{:statement [--> [ext-set tim] [int-set drunk]]
:truth [1 0.9]
:task-type :belief
'[{:statement [--> [ext-set tim] [int-set drunk]]
:truth [1 0.9]
:task-type :judgement
:occurrence 1}
{:statement [==> [&| [--> [ind-var X] [int-set drunk]] [--> [ind-var X] [int-set driving]]]
[--> [ind-var X] [int-set dead]]]
:truth [1 0.9]
{:statement [==> [&| [--> [ind-var X] [int-set drunk]] [--> [ind-var X] [int-set driving]]]
[--> [ind-var X] [int-set dead]]]
:truth [1 0.9]
:occurrence 0}]
'({:occurrence 1
:statement [&| a1 [--> [* a1 a2 a3] m]]
:task-type :belief
:task-type :judgement
:truth [1.0
0.81]}
{:occurrence 1
:statement [--> a1 [ext-image m _ a2 a3]]
:task-type :belief
:task-type :judgement
:truth [1
0.9]}
{:occurrence 1
:statement [<|> a1 [--> [* a1 a2 a3] m]]
:task-type :belief
:task-type :judgement
:truth [1.0
0.44751381215469616]}
{:occurrence 1
:statement [=|> [--> [* a1 a2 a3] m] a1]
:task-type :belief
:task-type :judgement
:truth [1
0.44751381215469616]}
{:occurrence 1
:statement [=|> a1 [--> [* a1 a2 a3] m]]
:task-type :belief
:task-type :judgement
:truth [1
0.44751381215469616]})
'[{:statement [--> [* a1 a2 a3] m]
:truth [1 0.9]
:task-type :belief
'[{:statement [--> [* a1 a2 a3] m]
:truth [1 0.9]
:task-type :judgement
:occurrence 1}
{:statement a1
:truth [1 0.9]
{:statement a1
:truth [1 0.9]
:occurrence 0}]
'[{:statement [=|> [--> [* a1 a2 a3] m] a1],
:task-type :belief,
'[{:statement [=|> [--> [* a1 a2 a3] m] a1],
:task-type :judgement,
:occurrence 1,
:truth [1 0.44751381215469616]}
{:statement [<|> a1 [--> [* a1 a2 a3] m]],
:task-type :belief,
:truth [1 0.44751381215469616]}
{:statement [<|> a1 [--> [* a1 a2 a3] m]],
:task-type :judgement,
:occurrence 1,
:truth [1.0 0.44751381215469616]}
{:statement [&| [--> [* a1 a2 a3] m] a1],
:task-type :belief,
:truth [1.0 0.44751381215469616]}
{:statement [&| [--> [* a1 a2 a3] m] a1],
:task-type :judgement,
:occurrence 1,
:truth [1.0 0.81]}
{:statement [=|> a1 [--> [* a1 a2 a3] m]],
:task-type :belief,
:truth [1.0 0.81]}
{:statement [=|> a1 [--> [* a1 a2 a3] m]],
:task-type :judgement,
:occurrence 1,
:truth [1 0.44751381215469616]}]
'[{:statement a1
:truth [1 0.9]
:task-type :belief
:truth [1 0.44751381215469616]}]
'[{:statement a1
:truth [1 0.9]
:task-type :judgement
:occurrence 1}
{:statement [--> [* a1 a2 a3] m]
:truth [1 0.9]
{:statement [--> [* a1 a2 a3] m]
:truth [1 0.9]
:occurrence 0}]
'({:occurrence 1
:statement [&| a1 [conj a1 a2 a3]]
:task-type :belief
:task-type :judgement
:truth [1.0 0.81]}
{:occurrence 1
:statement [<|> a1 [conj a1 a2 a3]]
:task-type :belief
:task-type :judgement
:truth [1.0 0.44751381215469616]}
{:occurrence 1
:statement [=|> [conj a1 a2 a3] a1]
:task-type :belief
:task-type :judgement
:truth [1
0.44751381215469616]}
{:occurrence 1
:statement [=|> a1 [conj a1 a2 a3]]
:task-type :belief
:task-type :judgement
:truth [1
0.44751381215469616]}
{:occurrence 1
:statement a1
:task-type :belief
:task-type :judgement
:truth [1 0.44751381215469616]})
'[{:statement [conj a1 a2 a3]
:truth [1 0.9]
:task-type :belief
'[{:statement [conj a1 a2 a3]
:truth [1 0.9]
:task-type :judgement
:occurrence 1}
{:statement a1
:truth [1 0.9]
{:statement a1
:truth [1 0.9]
:occurrence 0}]
'[{:statement [=|> [--> M S] [[--> M S] [--> M P]]],
:task-type :belief,
'[{:statement [=|> [--> M S] [[--> M S] [--> M P]]],
:task-type :judgement,
:occurrence 1,
:truth [1 0.44751381215469616]}
{:statement [<|> [--> M S] [[--> M S] [--> M P]]],
:task-type :belief,
:truth [1 0.44751381215469616]}
{:statement [<|> [--> M S] [[--> M S] [--> M P]]],
:task-type :judgement,
:occurrence 1,
:truth [1.0 0.44751381215469616]}
{:statement [&| [--> M S] [[--> M S] [--> M P]]],
:task-type :belief,
:truth [1.0 0.44751381215469616]}
{:statement [&| [--> M S] [[--> M S] [--> M P]]],
:task-type :judgement,
:occurrence 1,
:truth [1.0 0.81]}
{:statement [=|> [[--> M S] [--> M P]] [--> M S]],
:task-type :belief,
:truth [1.0 0.81]}
{:statement [=|> [[--> M S] [--> M P]] [--> M S]],
:task-type :judgement,
:occurrence 1,
:truth [1 0.44751381215469616]}]
'[{:statement [[--> M S] [--> M P]]
:truth [1 0.9]
:task-type :belief
:truth [1 0.44751381215469616]}]
'[{:statement [[--> M S] [--> M P]]
:truth [1 0.9]
:task-type :judgement
:occurrence 1}
{:statement [--> M S]
:truth [1 0.9]
{:statement [--> M S]
:truth [1 0.9]
:occurrence 0}]
'({:statement [conj [--> [dep-var Y] [int-set B]]
[==> [--> [ext-set A] [int-set Y]] [--> [dep-var Y] P]]]
:truth [1.0 0.81]
:task-type :belief
'({:statement [conj [--> [dep-var Y] [int-set B]]
[==> [--> [ext-set A] [int-set Y]] [--> [dep-var Y] P]]]
:truth [1.0 0.81]
:task-type :judgement
:occurrence 1}
{:statement [==>
[conj [--> [ext-set A] [int-set Y]] [--> [ind-var X] [int-set B]]]
[--> [ind-var X] P]]
:truth [1 0.44751381215469616]
:task-type :belief
{:statement [==>
[conj [--> [ext-set A] [int-set Y]] [--> [ind-var X] [int-set B]]]
[--> [ind-var X] P]]
:truth [1 0.44751381215469616]
:task-type :judgement
:occurrence 1})
'[{:statement [==> [--> [ext-set A] [int-set Y]] [--> [ext-set A] P]]
:truth [1 0.9]
:task-type :belief
'[{:statement [==> [--> [ext-set A] [int-set Y]] [--> [ext-set A] P]]
:truth [1 0.9]
:task-type :judgement
:occurrence 1}
{:statement [--> [ext-set A] [int-set B]]
:truth [1 0.9]
:occurrence 1}]))
{:statement [--> [ext-set A] [int-set B]]
:truth [1 0.9]
:occurrence 1}]
'({:statement [</>
[seq-conj [--> chess competition] [:interval 1000]]
[--> sport competition]],
:task-type :judgement,
:occurrence 1000,
:truth [1.0 0.44751381215469616]}
{:statement [seq-conj
[--> chess competition]
[:interval 1000]
[--> sport competition]],
:task-type :judgement,
:occurrence 1000,
:truth [1.0 0.81]}
{:statement [pred-impl
[seq-conj [--> chess competition] [:interval 1000]]
[--> sport competition]],
:task-type :judgement,
:occurrence 1000,
:truth [1 0.44751381215469616]}
{:statement [retro-impl
[--> sport competition]
[seq-conj [--> chess competition] [:interval 1000]]],
:task-type :judgement,
:occurrence 1000,
:truth [1 0.44751381215469616]}
{:statement [--> sport chess],
:task-type :judgement,
:occurrence 1000,
:truth [1 0.44751381215469616]}
{:statement [--> chess sport],
:task-type :judgement,
:occurrence 1000,
:truth [1 0.44751381215469616]}
{:statement [<=> [--> chess [ind-var X]] [--> sport [ind-var X]]],
:task-type :judgement,
:occurrence 1000,
:truth [1.0 0.44751381215469616]}
{:statement [conj [--> chess [dep-var Y]] [--> sport [dep-var Y]]],
:task-type :judgement,
:occurrence 1000,
:truth [1.0 0.81]}
{:statement [<-> sport chess],
:task-type :judgement,
:occurrence 1000,
:truth [1.0 0.44751381215469616]}
{:statement [==> [--> chess [ind-var X]] [--> sport [ind-var X]]],
:task-type :judgement,
:occurrence 1000,
:truth [1 0.44751381215469616]}
{:statement [==> [--> chess [ind-var X]] [--> sport [ind-var X]]],
:task-type :judgement,
:occurrence 1000,
:truth [1 0.44751381215469616]}
{:statement [==> [--> sport [ind-var X]] [--> chess [ind-var X]]],
:task-type :judgement,
:occurrence 1000,
:truth [1 0.44751381215469616]}
{:statement [==> [--> sport [ind-var X]] [--> chess [ind-var X]]],
:task-type :judgement,
:occurrence 1000,
:truth [1 0.44751381215469616]}
{:statement [--> [int-dif chess sport] competition],
:task-type :judgement,
:occurrence 1000,
:truth [0.0 0.81]}
{:statement [--> [| chess sport] competition],
:task-type :judgement,
:occurrence 1000,
:truth [1.0 0.81]}
{:statement [--> [int-dif sport chess] competition],
:task-type :judgement,
:occurrence 1000,
:truth [0.0 0.81]}
{:statement [--> [ext-inter chess sport] competition],
:task-type :judgement,
:occurrence 1000,
:truth [1.0 0.81]}
{:statement [pred-impl
[seq-conj [--> chess [ind-var X]] [:interval 1000]]
[--> sport [ind-var X]]],
:task-type :judgement,
:occurrence 1000,
:truth [1 0.44751381215469616]}
{:statement [</>
[seq-conj [--> chess [ind-var X]] [:interval 1000]]
[--> sport [ind-var X]]],
:task-type :judgement,
:occurrence 1000,
:truth [1.0 0.44751381215469616]}
{:statement [retro-impl
[--> sport [ind-var X]]
[seq-conj [--> chess [ind-var X]] [:interval 1000]]],
:task-type :judgement,
:occurrence 1000,
:truth [1 0.44751381215469616]}
{:statement [seq-conj
[--> chess [dep-var Y]]
[:interval 1000]
[--> sport [dep-var Y]]],
:task-type :judgement,
:occurrence 1000,
:truth [1.0 0.81]})
['{:statement [--> sport competition]
:truth [1 0.9]
:task-type :judgement
:occurrence 1000}
'{:statement [--> chess competition]
:truth [1 0.9]
:occurrence 0}]))
+11 -106
View File
@@ -1,119 +1,24 @@
(ns nal.test.deriver
(:require [clojure.test :refer :all]
[nal.deriver :refer :all]
[nal.deriver.rules :refer [compile-rules]]
[nal.rules :as r]))
(def result
'({:statement [</>
[seq-conj [--> chess competition] [:interval 1000]]
[--> sport competition]]
:task-type :belief
:occurrence 1000
:truth [1.0 0.44751381215469616]}
{:statement [seq-conj
[--> chess competition]
[:interval 1000]
[--> sport competition]]
:task-type :belief
:occurrence 1000
:truth [1.0 0.81]}
{:statement [pred-impl
[seq-conj [--> chess competition] [:interval 1000]]
[--> sport competition]]
:task-type :belief
:occurrence 1000
:truth [1 0.44751381215469616]}
{:statement [retro-impl
[--> sport competition]
[seq-conj [--> chess competition] [:interval 1000]]]
:task-type :belief
:occurrence 1000
:truth [1 0.44751381215469616]}
{:statement [--> sport chess]
:task-type :belief
:occurrence 1000
:truth [1 0.44751381215469616]}
{:statement [--> chess sport]
:task-type :belief
:occurrence 1000
:truth [1 0.44751381215469616]}
{:statement [<=> [--> chess [ind-var X]] [--> sport [ind-var X]]]
:task-type :belief
:occurrence 1000
:truth [1.0 0.44751381215469616]}
{:statement [conj [--> chess [dep-var Y]] [--> sport [dep-var Y]]]
:task-type :belief
:occurrence 1000
:truth [1.0 0.81]}
{:statement [<-> sport chess]
:task-type :belief
:occurrence 1000
:truth [1.0 0.44751381215469616]}
{:statement [==> [--> chess [ind-var X]] [--> sport [ind-var X]]]
:task-type :belief
:occurrence 1000
:truth [1 0.44751381215469616]}
{:statement [==> [--> chess [ind-var X]] [--> sport [ind-var X]]]
:task-type :belief
:occurrence 1000
:truth [1 0.44751381215469616]}
{:statement [==> [--> sport [ind-var X]] [--> chess [ind-var X]]]
:task-type :belief
:occurrence 1000
:truth [1 0.44751381215469616]}
{:statement [==> [--> sport [ind-var X]] [--> chess [ind-var X]]]
:task-type :belief
:occurrence 1000
:truth [1 0.44751381215469616]}
{:statement [--> [int-dif chess sport] competition]
:task-type :belief
:occurrence 1000
:truth [0.0 0.81]}
{:statement [--> [| chess sport] competition]
:task-type :belief
:occurrence 1000
:truth [1.0 0.81]}
{:statement [--> [int-dif sport chess] competition]
:task-type :belief
:occurrence 1000
:truth [0.0 0.81]}
{:statement [--> [ext-inter chess sport] competition]
:task-type :belief
:occurrence 1000
:truth [1.0 0.81]}
{:statement [pred-impl
[seq-conj [--> chess [ind-var X]] [:interval 1000]]
[--> sport [ind-var X]]]
:task-type :belief
:occurrence 1000
:truth [1 0.44751381215469616]}
{:statement [</>
[seq-conj [--> chess [ind-var X]] [:interval 1000]]
[--> sport [ind-var X]]]
:task-type :belief
:occurrence 1000
:truth [1.0 0.44751381215469616]}
{:statement [retro-impl
[--> sport [ind-var X]]
[seq-conj [--> chess [ind-var X]] [:interval 1000]]]
:task-type :belief
:occurrence 1000
:truth [1 0.44751381215469616]}
{:statement [seq-conj
[--> chess [dep-var Y]]
[:interval 1000]
[--> sport [dep-var Y]]]
:task-type :belief
:occurrence 1000
:truth [1.0 0.81]}))
(def rules
(compile-rules '([(P --> M) (S --> M) |- (S <-> P)
:post (:t/comparison :d/weak :allow-backward)
:pre ((:!= S P))])))
(deftest test-generate-conclusions
(is (= (set result)
(is (= (set [{:occurrence 1000
:statement '[<-> sport chess]
:task-type :judgement
:truth [1.0 0.44751381215469616]}])
(set (generate-conclusions
(r/rules :belief)
(rules :judgement)
'{:statement [--> sport competition]
:truth [1 0.9]
:task-type :belief
:task-type :judgement
:occurrence 1000}
'{:statement [--> chess competition]
+33 -29
View File
@@ -64,13 +64,11 @@
(deftest test-expand-:from-element
(are [a1 a2] (= a1 (apply expand-:from-element a2))
'(([--> k A1] :id :id-A1)
([--> k A2] :id :id-A2)
([--> k A3] :id :id-A3))
['[[--> k :from/A] :id :id] :from/A "A" 3]
'([--> k A1] [--> k A2] [--> k A3])
['[--> k :from/A] :from/A "A" 3]
'(([--> k [conj d A1]] :id :id-A1))
['[[--> k [conj d :from/A]] :id :id] :from/A "A" 1]))
'([--> k [conj d A1]])
['[--> k [conj d :from/A]] :from/A "A" 1]))
(deftest test-generate-all-lists
(are [a1 a2] (= a1 (generate-all-lists a2))
@@ -79,51 +77,58 @@
(W --> B)
|-
(W --> (| B A1))
:pre (:question?)
:post (:t/belief-structural-deduction :p/judgment)
:id :id-A1]
:pre
(:question?)
:post
(:t/belief-structural-deduction :p/judgment)]
[(W --> (| B A1 A2))
(W --> B)
|-
(W --> (| B A1 A2))
:pre (:question?)
:post (:t/belief-structural-deduction :p/judgment)
:id :id-A2]
:pre
(:question?)
:post
(:t/belief-structural-deduction :p/judgment)]
[(W --> (| B A1 A2 A3))
(W --> B)
|-
(W --> (| B A1 A2 A3))
:pre (:question?)
:post (:t/belief-structural-deduction :p/judgment)
:id :id-A3]
:pre
(:question?)
:post
(:t/belief-structural-deduction :p/judgment)]
[(W --> (| B A1 A2 A3 A4))
(W --> B)
|-
(W --> (| B A1 A2 A3 A4))
:pre (:question?)
:post (:t/belief-structural-deduction :p/judgment)
:id :id-A4]
:pre
(:question?)
:post
(:t/belief-structural-deduction :p/judgment)]
[(W --> (| B A1 A2 A3 A4 A5))
(W --> B)
|-
(W --> (| B A1 A2 A3 A4 A5))
:pre (:question?)
:post (:t/belief-structural-deduction :p/judgment)
:id :id-A5]
:pre
(:question?)
:post
(:t/belief-structural-deduction :p/judgment)]
[(W --> (| B A1 A2 A3 A4 A5 A6))
(W --> B)
|-
(W --> (| B A1 A2 A3 A4 A5 A6))
:pre (:question?)
:post (:t/belief-structural-deduction :p/judgment)
:id :id-A6]
:pre
(:question?)
:post
(:t/belief-structural-deduction :p/judgment)]
[(W --> (| B A1 A2 A3 A4 A5 A6 A7))
(W --> B)
|-
(W --> (| B A1 A2 A3 A4 A5 A6 A7))
:pre (:question?)
:post (:t/belief-structural-deduction :p/judgment)
:id :id-A7])
:pre
(:question?)
:post
(:t/belief-structural-deduction :p/judgment)])
'[(W --> (| B :list/A))
(W --> B)
|-
@@ -131,5 +136,4 @@
:pre
(:question?)
:post
(:t/belief-structural-deduction :p/judgment)
:id :id]))
(:t/belief-structural-deduction :p/judgment)]))
+6 -18
View File
@@ -27,9 +27,7 @@
(def trule (rule '[(D pred-impl R) (D --> K) |- ((K pred-impl R) :post (:t/abduction)
(R --> K) :post (:t/induction)
(K </> R) :post (:t/comparison))
:pre ((:!= R K))
:origin :ok
:id :ok]))
:pre ((:!= R K))]))
(deftest test-rule
(both-equal
@@ -37,36 +35,26 @@
:p2 (<-> S P),
:conclusions [{:conclusion (--> S P), :post (:t/struct-int :p/judgment)}],
:full-path [(--> :any :any) :and (<-> :any :any)],
:pre (:question?)
:origin :ok
:id :ok}]
:pre (:question?)}]
(rule '[(S --> P) (S <-> P) |- (S --> P) :post (:t/struct-int :p/judgment)
:pre (:question?)
:origin :ok
:id :ok])
:pre (:question?)])
'({:conclusions [{:conclusion (pred-impl K R)
:post (:t/abduction)}]
:full-path [(pred-impl :any :any) :and (--> :any :any)]
:p1 (pred-impl D R)
:p2 (--> D K)
:pre ((:!= R K))
:origin :ok
:id :ok}
:pre ((:!= R K))}
{:conclusions [{:conclusion (--> R K)
:post (:t/induction)}]
:full-path [(pred-impl :any :any) :and (--> :any :any)]
:p1 (pred-impl D R)
:p2 (--> D K)
:pre ((:!= R K))
:origin :ok
:id :ok-2}
:pre ((:!= R K))}
{:conclusions [{:conclusion (</> K R)
:post (:t/comparison)}]
:full-path [(pred-impl :any :any) :and (--> :any :any)]
:p1 (pred-impl D R)
:p2 (--> D K)
:pre ((:!= R K))
:origin :ok
:id :ok-3})
:pre ((:!= R K))})
trule))
+126 -173
View File
@@ -20,40 +20,27 @@
(deftest test-premure-op
(both-equal
'(([=|> A B] :id :id-perm-concur-impl)
([retro-impl A B] :id :id-perm-retro-impl)
([==> A B] :id :id-perm-impl)
([pred-impl A B] :id :id-perm-pred-impl))
(permute-op '[[==> A B] :id :id] implications)
'([=|> A B] [retro-impl A B] [==> A B] [pred-impl A B])
(permute-op '[==> A B] implications)
'(([=|> A B] :id :id-perm-concur-impl)
([retro-impl A B] :id :id-perm-retro-impl)
([==> A B] :id :id-perm-impl)
([pred-impl A B] :id :id-perm-pred-impl))
(permute-op '[[=|> A B] :id :id] implications)
'([=|> A B] [retro-impl A B] [==> A B] [pred-impl A B])
(permute-op '[=|> A B] implications)
'((conj :id :id-perm-conj)
(&| :id :id-perm-parallel-conj)
(seq-conj :id :id-perm-seq-conj))
(permute-op '[&| :id :id] conjunctions)))
'(conj &| seq-conj) (permute-op '&| conjunctions)))
(def rule1
'{:p1 (==> M P)
:p2 (==> S M)
:conclusions [{:conclusion (==> S P)
:post (:t/deduction :order-for-all-same :allow-backward)}]
:full-path [(==> :any :any) :and (==> :any :any)]
:origin :rule1
:id :rule1})
:full-path [(==> :any :any) :and (==> :any :any)]})
(def rule2
'{:p1 (==> M P)
:p2 (==> S M)
:conclusions [{:conclusion (==> S P)
:post (:allow-backward)}]
:full-path [(==> :any :any) :and (==> :any :any)]
:origin :rule2
:id :rule2})
:full-path [(==> :any :any) :and (==> :any :any)]})
(def rule3
'{:p1 (==> S M)
@@ -62,171 +49,137 @@
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}]
:full-path [(==> :any :any) :and (==> (conj :any :any) :any)]
:origin :rule3
:id :rule3})
:full-path [(==> :any :any) :and (==> (conj :any :any) :any)]})
(deftest test-order-for-all-same?
(is ((complement nil?) (order-for-all-same? rule1)))
(is (nil? (order-for-all-same? rule2))))
(def res1
'({:p1 (=|> M P)
:p2 (=|> S M)
:conclusions [{:conclusion (=|> S P)
:post (:t/deduction :order-for-all-same :allow-backward)}]
:full-path [(=|> :any :any) :and (=|> :any :any)]
:origin :rule1
:id :rule1-perm-concur-impl
'({:p1 (=|> M P),
:p2 (=|> S M),
:conclusions [{:conclusion (=|> S P),
:post (:t/deduction :order-for-all-same :allow-backward)}],
:full-path [(=|> :any :any) :and (=|> :any :any)],
:pre nil}
{:p1 (pred-impl M P)
:p2 (pred-impl S M)
:conclusions [{:conclusion (pred-impl S P)
:post (:t/deduction :order-for-all-same :allow-backward)}]
:full-path [(pred-impl :any :any) :and (pred-impl :any :any)]
:origin :rule1
:id :rule1-perm-pred-impl
{:p1 (==> M P),
:p2 (==> S M),
:conclusions [{:conclusion (==> S P),
:post (:t/deduction :order-for-all-same :allow-backward)}],
:full-path [(==> :any :any) :and (==> :any :any)],
:pre nil}
{:p1 (retro-impl M P)
:p2 (retro-impl S M)
:conclusions [{:conclusion (retro-impl S P)
:post (:t/deduction :order-for-all-same :allow-backward)}]
:full-path [(retro-impl :any :any) :and (retro-impl :any :any)]
:origin :rule1
:id :rule1-perm-retro-impl
{:p1 (retro-impl M P),
:p2 (retro-impl S M),
:conclusions [{:conclusion (retro-impl S P),
:post (:t/deduction :order-for-all-same :allow-backward)}],
:full-path [(retro-impl :any :any) :and (retro-impl :any :any)],
:pre nil}
{:p1 (==> M P)
:p2 (==> S M)
:conclusions [{:conclusion (==> S P)
:post (:t/deduction :order-for-all-same :allow-backward)}]
:full-path [(==> :any :any) :and (==> :any :any)]
:origin :rule1
:id :rule1-perm-impl
{:p1 (pred-impl M P),
:p2 (pred-impl S M),
:conclusions [{:conclusion (pred-impl S P),
:post (:t/deduction :order-for-all-same :allow-backward)}],
:full-path [(pred-impl :any :any) :and (pred-impl :any :any)],
:pre nil}))
(def res2
'({:p1 (==> S M)
:p2 (==> (seq-conj S :list/A) M)
:conclusions [{:conclusion (==> (seq-conj :list/A) M)
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}]
:full-path [(==> :any :any) :and (==> (seq-conj :any :any) :any)]
:origin :rule3
:id :rule3-perm-seq-conj-perm-impl
:pre nil}
{:p1 (==> S M)
:p2 (==> (&| S :list/A) M)
:conclusions [{:conclusion (==> (&| :list/A) M)
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}]
:full-path [(==> :any :any) :and (==> (&| :any :any) :any)]
:origin :rule3
:id :rule3-perm-parallel-conj-perm-impl
:pre nil}
{:p1 (retro-impl S M)
:p2 (retro-impl (seq-conj S :list/A) M)
:conclusions [{:conclusion (retro-impl (seq-conj :list/A) M)
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}]
:full-path [(retro-impl :any :any)
:and
(retro-impl (seq-conj :any :any) :any)]
:origin :rule3
:id :rule3-perm-seq-conj-perm-retro-impl
:pre nil}
{:p1 (retro-impl S M)
:p2 (retro-impl (conj S :list/A) M)
:conclusions [{:conclusion (retro-impl (conj :list/A) M)
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}]
:full-path [(retro-impl :any :any) :and (retro-impl (conj :any :any) :any)]
:origin :rule3
:id :rule3-perm-conj-perm-retro-impl
:pre nil}
{:p1 (retro-impl S M)
:p2 (retro-impl (&| S :list/A) M)
:conclusions [{:conclusion (retro-impl (&| :list/A) M)
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}]
:full-path [(retro-impl :any :any) :and (retro-impl (&| :any :any) :any)]
:origin :rule3
:id :rule3-perm-parallel-conj-perm-retro-impl
:pre nil}
{:p1 (pred-impl S M)
:p2 (pred-impl (conj S :list/A) M)
:conclusions [{:conclusion (pred-impl (conj :list/A) M)
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}]
:full-path [(pred-impl :any :any) :and (pred-impl (conj :any :any) :any)]
:origin :rule3
:id :rule3-perm-conj-perm-pred-impl
:pre nil}
{:p1 (=|> S M)
:p2 (=|> (conj S :list/A) M)
:conclusions [{:conclusion (=|> (conj :list/A) M)
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}]
:full-path [(=|> :any :any) :and (=|> (conj :any :any) :any)]
:origin :rule3
:id :rule3-perm-conj-perm-concur-impl
:pre nil}
{:p1 (=|> S M)
:p2 (=|> (seq-conj S :list/A) M)
:conclusions [{:conclusion (=|> (seq-conj :list/A) M)
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}]
:full-path [(=|> :any :any) :and (=|> (seq-conj :any :any) :any)]
:origin :rule3
:id :rule3-perm-seq-conj-perm-concur-impl
:pre nil}
{:p1 (==> S M)
:p2 (==> (conj S :list/A) M)
:conclusions [{:conclusion (==> (conj :list/A) M)
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}]
:full-path [(==> :any :any) :and (==> (conj :any :any) :any)]
:origin :rule3
:id :rule3-perm-conj-perm-impl
:pre nil}
{:p1 (=|> S M)
:p2 (=|> (&| S :list/A) M)
:conclusions [{:conclusion (=|> (&| :list/A) M)
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}]
:full-path [(=|> :any :any) :and (=|> (&| :any :any) :any)]
:origin :rule3
:id :rule3-perm-parallel-conj-perm-concur-impl
:pre nil}
{:p1 (pred-impl S M)
:p2 (pred-impl (&| S :list/A) M)
:conclusions [{:conclusion (pred-impl (&| :list/A) M)
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}]
:full-path [(pred-impl :any :any) :and (pred-impl (&| :any :any) :any)]
:origin :rule3
:id :rule3-perm-parallel-conj-perm-pred-impl
:pre nil}
{:p1 (pred-impl S M)
:p2 (pred-impl (seq-conj S :list/A) M)
:conclusions [{:conclusion (pred-impl (seq-conj :list/A) M)
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}]
:full-path [(pred-impl :any :any) :and (pred-impl (seq-conj :any :any) :any)]
:origin :rule3
:id :rule3-perm-seq-conj-perm-pred-impl
:pre nil}))
'({:p1 (pred-impl S M),
:p2 (pred-impl (seq-conj S :list/A) M),
:conclusions [{:conclusion (pred-impl (seq-conj :list/A) M),
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}],
:full-path [(pred-impl :any :any) :and (pred-impl (seq-conj :any :any) :any)],
:pre nil}
{:p1 (retro-impl S M),
:p2 (retro-impl (seq-conj S :list/A) M),
:conclusions [{:conclusion (retro-impl (seq-conj :list/A) M),
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}],
:full-path [(retro-impl :any :any)
:and
(retro-impl (seq-conj :any :any) :any)],
:pre nil}
{:p1 (=|> S M),
:p2 (=|> (seq-conj S :list/A) M),
:conclusions [{:conclusion (=|> (seq-conj :list/A) M),
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}],
:full-path [(=|> :any :any) :and (=|> (seq-conj :any :any) :any)],
:pre nil}
{:p1 (pred-impl S M),
:p2 (pred-impl (conj S :list/A) M),
:conclusions [{:conclusion (pred-impl (conj :list/A) M),
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}],
:full-path [(pred-impl :any :any) :and (pred-impl (conj :any :any) :any)],
:pre nil}
{:p1 (==> S M),
:p2 (==> (conj S :list/A) M),
:conclusions [{:conclusion (==> (conj :list/A) M),
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}],
:full-path [(==> :any :any) :and (==> (conj :any :any) :any)],
:pre nil}
{:p1 (=|> S M),
:p2 (=|> (&| S :list/A) M),
:conclusions [{:conclusion (=|> (&| :list/A) M),
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}],
:full-path [(=|> :any :any) :and (=|> (&| :any :any) :any)],
:pre nil}
{:p1 (retro-impl S M),
:p2 (retro-impl (conj S :list/A) M),
:conclusions [{:conclusion (retro-impl (conj :list/A) M),
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}],
:full-path [(retro-impl :any :any) :and (retro-impl (conj :any :any) :any)],
:pre nil}
{:p1 (==> S M),
:p2 (==> (&| S :list/A) M),
:conclusions [{:conclusion (==> (&| :list/A) M),
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}],
:full-path [(==> :any :any) :and (==> (&| :any :any) :any)],
:pre nil}
{:p1 (=|> S M),
:p2 (=|> (conj S :list/A) M),
:conclusions [{:conclusion (=|> (conj :list/A) M),
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}],
:full-path [(=|> :any :any) :and (=|> (conj :any :any) :any)],
:pre nil}
{:p1 (pred-impl S M),
:p2 (pred-impl (&| S :list/A) M),
:conclusions [{:conclusion (pred-impl (&| :list/A) M),
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}],
:full-path [(pred-impl :any :any) :and (pred-impl (&| :any :any) :any)],
:pre nil}
{:p1 (==> S M),
:p2 (==> (seq-conj S :list/A) M),
:conclusions [{:conclusion (==> (seq-conj :list/A) M),
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}],
:full-path [(==> :any :any) :and (==> (seq-conj :any :any) :any)],
:pre nil}
{:p1 (retro-impl S M),
:p2 (retro-impl (&| S :list/A) M),
:conclusions [{:conclusion (retro-impl (&| :list/A) M),
:post (:t/decompose-npp
:order-for-all-same
:seq-interval-from-premises)}],
:full-path [(retro-impl :any :any) :and (retro-impl (&| :any :any) :any)],
:pre nil}))
(deftest test-generate-all-orders
(both-equal
@@ -0,0 +1,88 @@
(ns narjure.test.control.general-inference
(:require [aero.core :refer [read-config]]
[clojure.test :refer [deftest is]]
[com.stuartsierra.component :as component]
[onyx api
[test-helper :refer [with-test-env]]]
[narjure.control.general-inference :as gi]
[narjure.system :refer [mem]]
[narjure.memory.api :as m]
[taoensso.carmine :refer [wcar] :as c]
[narjure.test.control.utils :refer [mock-kafka rand-id
take-values-from-topic]]))
(defn load-redis-data
[]
(wcar {} (c/flushall))
(let [concept1 '[--> P S]
concept2 '[--> K P]]
(m/add-term mem concept1)
(let [task {:task-type :goal
:occurrence 1
:plausibility 1
:desirability 0.9
:statement concept1}
task-id (m/add-task mem task)
tasklink {:priority 1
:durability 1
:quality 1
:task task-id}]
(m/add-tasklink mem concept1 tasklink "goal"))
(m/add-term mem concept2)
(m/add-termlink mem concept1 {:priority 1
:durability 1
:quality 1
:concept (hash concept2)})
(let [task {:frequency 1
:confidence 0.9
:occurrence 0
:statement concept2}
task-id (m/add-task mem task)
tasklink {:priority 1
:durability 1
:quality 1
:task task-id}]
(m/add-tasklink mem concept2 tasklink "belief"))))
(def input
(let [concept-hash (hash '[--> P S])]
[{:question-with-query-var true
:concept concept-hash}
{:concept concept-hash}]))
(def output-answer [{:some-answer true}])
(def output-tasks
[{:desire [1.0 0.8099999570846563]
:occurrence 1
:statement '[--> K S]
:task-type :goal}
{:desire [1.0 0.40499997854232817]
:occurrence 1
:statement '[--> S K]
:task-type :goal}])
(deftest general-inference-test
(let [input-topic (rand-id)
tasks-topic (rand-id)
answers-topic (rand-id)
{:keys [env-config peer-config]}
(read-config (clojure.java.io/resource "config.edn")
{:profile :test})
zk-address (get-in peer-config [:zookeeper/address])
job (gi/build-job zk-address input-topic tasks-topic answers-topic 10 1000)
mock (atom {})]
(try
(load-redis-data)
(with-test-env
[test-env [9 env-config peer-config]]
(onyx.test-helper/validate-enough-peers! test-env job)
(reset! mock (mock-kafka zk-address [[input-topic input]]))
(onyx.api/submit-job peer-config job)
(is (= (set (take-values-from-topic zk-address tasks-topic))
(set output-tasks)))
(is (= (take-values-from-topic zk-address answers-topic)
output-answer)))
(finally (swap! mock component/stop)))))
@@ -0,0 +1,156 @@
(ns narjure.test.control.local-inference.beliefs
(:require [clojure.test :refer [deftest is]]
[aero.core :refer [read-config]]
[com.stuartsierra.component :as component]
[taoensso.carmine :refer [wcar] :as c]
[narjure.system :refer [mem]]
[onyx api
[test-helper :refer [with-test-env]]]
[narjure.test.control.utils :refer [mock-kafka rand-id
take-values-from-topic]]
[narjure.control.local-inference.beliefs :refer [build-job]]
[narjure.memory.api :as m]
[narjure.test.control.utils :as u]))
(defn input []
(let [task {:statement 'cat
:occurrence 1
:frequency 0.8
:confidence 0.7
:durability 0.4
:eternal false
:creation-time 1
:evidences [1]}
id (m/add-task mem task)]
[{:task (assoc task :id id)}]))
(def output
[{:priority-diff -0.05675676676197694
:question {:durability 0.5
:id nil
:priority 0.7
:quality 1.0
:task {:eternal false
:occurrence 1
:statement 'cat
:task-type :question}}
:satisfaction 0.08108109675505559}])
(def beliefs
#{{:durability (float 0.1)
:priority (float 0.3)
:quality (float 1.0)
:task {:eternal false
:evidences [2]
:frequency (float 1.0)
:confidence (float 0.9)
:occurrence 1
:statement 'cat
:task-type :belief}}
{:durability (float 0.856)
:task {:frequency (float 0.8)
:confidence (float 0.7)
:creation-time 1
:durability "0.4"
:eternal false
:evidences [1]
:occurrence 1
:statement 'cat}}
{:durability (float 0.86767566)
:task {:confidence (float 0.9189189)
:creation-time 1
:durability "0.8676756845053482"
:eternal false
:evidences [1 2]
:frequency (float 0.9588235)
:occurrence 1
:statement 'cat}}})
(def questions
#{{:durability (float 0.5)
:priority (float 0.64324325)
:quality (float 1.0)
:task {:eternal false
:occurrence 1
:statement 'cat
:task-type :question}}})
(def goals
#{{:durability (float 0.9)
:priority (float 0.19199999)
:quality (float 1.0)
:task {:desirability (float 0.9)
:occurrence 1
:eternal false
:evidences [3]
:plausibility (float 1.0)
:statement 'cat
:task-type :goal}}})
(defn load-redis-data
[]
(wcar {} (c/flushall))
(let [concept1 'cat]
(m/add-term mem concept1)
(let [task {:task-type :belief
:occurrence 1
:frequency 1
:confidence 0.9
:statement concept1
:eternal false
:evidences [2]}
task2 {:task-type :goal
:occurrence 1
:plausibility 1
:desirability 0.9
:statement concept1
:eternal false
:evidences [3]}
task3 {:task-type :question
:occurrence 1
:statement concept1
:eternal false}
task-id (m/add-task mem task)
task2-id (m/add-task mem task2)
task3-id (m/add-task mem task3)
tasklink {:priority 0.3
:durability 0.1
:quality 1
:task task-id}
tasklink2 {:priority 0.8
:durability 0.9
:quality 1
:task task2-id}
tasklink3 {:priority 0.7
:durability 0.5
:quality 1
:task task3-id}]
(m/add-tasklink mem concept1 tasklink "belief")
(m/add-tasklink mem concept1 tasklink2 "goal")
(m/add-tasklink mem concept1 tasklink3 "question"))))
(deftest beliefs-li-inference-test
(let [tasks-topic (rand-id)
answers-topic (rand-id)
{:keys [env-config peer-config]}
(read-config (clojure.java.io/resource "config.edn")
{:profile :test})
zk-address (get-in peer-config [:zookeeper/address])
kafka-io {:input {:read-beliefs tasks-topic}
:output {:write-answers answers-topic}}
job (build-job zk-address kafka-io 10 1000)
mock (atom {})]
(try
(load-redis-data)
(with-test-env
[test-env [12 env-config peer-config]]
(onyx.test-helper/validate-enough-peers! test-env job)
(reset! mock (mock-kafka zk-address [[tasks-topic (input)]]))
(onyx.api/submit-job peer-config job)
(is (= (-> (take-values-from-topic zk-address answers-topic)
(assoc-in [0 :question :id] nil))
output))
(is (= beliefs (u/dissoc-ids (m/beliefs mem 'cat))))
(is (= questions (u/dissoc-ids (m/questions mem 'cat))))
(is (= goals (u/dissoc-ids (m/goals mem 'cat)))))
(finally (swap! mock component/stop)))))
@@ -0,0 +1,161 @@
(ns narjure.test.control.local-inference.goals
(:require [clojure.test :refer [deftest is]]
[aero.core :refer [read-config]]
[com.stuartsierra.component :as component]
[taoensso.carmine :refer [wcar] :as c]
[narjure.system :refer [mem]]
[onyx api
[test-helper :refer [with-test-env]]]
[narjure.test.control.utils :refer [mock-kafka rand-id
take-values-from-topic]]
[narjure.control.local-inference.goals :refer [build-job]]
[narjure.memory.api :as m]
[narjure.test.control.utils :as u]))
(defn input []
(let [task {:statement 'cat
:occurrence 1
:plausibility 0.85
:desirability 0.5
:durability 0.6
:priority 0.75
:creation-time 1
:evidences [1]
:eternal false}
id (m/add-task mem task)]
[{:task (assoc task :id id)}]))
(def output
[{:priority-diff -0.0636363763454526
:quest {:durability 0.5
:id nil
:priority 0.7
:quality 1.0
:task {:eternal false
:occurrence 1
:statement 'cat
:task-type :quest}}
:satisfaction 0.09090911061310525}])
(def beliefs
#{{:durability (float 0.7525)
:priority (float 0.3)
:quality (float 1.0)
:task {:confidence (float 0.9)
:frequency (float 1.0)
:eternal false
:evidences [2]
:occurrence 1
:statement 'cat
:task-type :belief}}})
(def quests
#{{:durability (float 0.5)
:priority (float 0.6363636)
:quality (float 1.0)
:task {:eternal false
:occurrence 1
:statement 'cat
:task-type :quest}}})
(def goals
#{{:durability (float 0.6)
:priority (float 0.20625)
:task {:creation-time 1
:desirability (float 0.5)
:durability "0.6"
:eternal false
:evidences [1]
:occurrence 1
:plausibility (float 0.85)
:priority "0.75"
:statement 'cat}}
{:durability (float 0.6363636)
:priority (float 0.20625)
:task {:creation-time 1
:desirability (float 0.9090909)
:durability "0.636363644245242"
:eternal false
:evidences [1 3]
:occurrence 1
:plausibility (float 0.26500002)
:priority "0.20624999105930325"
:statement 'cat}}
{:durability (float 0.9)
:priority (float 0.8)
:quality (float 1.0)
:task {:desirability (float 0.9)
:eternal false
:evidences [3]
:occurrence 1
:plausibility (float 0.2)
:statement 'cat
:task-type :goal}}})
(defn load-redis-data
[]
(wcar {} (c/flushall))
(let [concept1 'cat]
(m/add-term mem concept1)
(let [task {:task-type :belief
:occurrence 1
:frequency 1
:confidence 0.9
:statement concept1
:eternal false
:evidences [2]}
task2 {:task-type :goal
:occurrence 1
:plausibility 0.2
:desirability 0.9
:statement concept1
:eternal false
:evidences [3]}
task3 {:task-type :quest
:occurrence 1
:statement concept1
:eternal false}
task-id (m/add-task mem task)
task2-id (m/add-task mem task2)
task3-id (m/add-task mem task3)
tasklink {:priority 0.3
:durability 0.1
:quality 1
:task task-id}
tasklink2 {:priority 0.8
:durability 0.9
:quality 1
:task task2-id}
tasklink3 {:priority 0.7
:durability 0.5
:quality 1
:task task3-id}]
(m/add-tasklink mem concept1 tasklink "belief")
(m/add-tasklink mem concept1 tasklink2 "goal")
(m/add-tasklink mem concept1 tasklink3 "quest"))))
(deftest goals-li-inference-test
(let [tasks-topic (rand-id)
answers-topic (rand-id)
{:keys [env-config peer-config]}
(read-config (clojure.java.io/resource "config.edn")
{:profile :test})
zk-address (get-in peer-config [:zookeeper/address])
kafka-io {:input {:read-goals tasks-topic}
:output {:write-answers answers-topic}}
job (build-job zk-address kafka-io 10 1000)
mock (atom {})]
(try
(load-redis-data)
(with-test-env
[test-env [12 env-config peer-config]]
(onyx.test-helper/validate-enough-peers! test-env job)
(reset! mock (mock-kafka zk-address [[tasks-topic (input)]]))
(onyx.api/submit-job peer-config job)
(is (= (-> (take-values-from-topic zk-address answers-topic)
(assoc-in [0 :quest :id] nil))
output))
(is (= beliefs (u/dissoc-ids (m/beliefs mem 'cat))))
(is (= quests (u/dissoc-ids (m/quests mem 'cat))))
(is (= goals (u/dissoc-ids (m/goals mem 'cat)))))
(finally (swap! mock component/stop)))))
@@ -0,0 +1,114 @@
(ns narjure.test.control.local-inference.questions
(:require [clojure.test :refer [deftest is]]
[aero.core :refer [read-config]]
[com.stuartsierra.component :as component]
[taoensso.carmine :refer [wcar] :as c]
[narjure.system :refer [mem]]
[onyx api
[test-helper :refer [with-test-env]]]
[narjure.test.control.utils :refer [mock-kafka rand-id
take-values-from-topic]]
[narjure.control.local-inference.questions :refer [build-job]]
[narjure.memory.api :as m]
[narjure.test.control.utils :as u]))
(def input
[{:task {:statement 'cat
:occurrence 1
:durability 1
:priority 1
:evidences [1]
:eternal false}}])
(def output
[{:belief {:durability 0.78
:id nil
:priority 0.56
:quality 1.0
:task {:confidence 0.9
:frequency 0.8
:eternal false
:evidences [2]
:occurrence 1
:statement 'cat
:task-type :belief}}
:durability-diff 0.02200000810623237
:question {:durability 1
:occurrence 1
:priority 0.8999999761581421
:eternal false
:evidences [1]
:statement 'cat}}])
(def beliefs
#{{:durability (float 0.802)
:priority (float 0.56)
:quality (float 1.0)
:task {:confidence (float 0.9)
:frequency (float 0.8)
:occurrence 1
:eternal false
:evidences [2]
:statement 'cat
:task-type :belief}}})
(def questions
#{{:durability (float 1.0)
:priority (float 0.9)
:task {}}})
(defn load-redis-data
[]
(wcar {} (c/flushall))
(let [concept1 'cat]
(m/add-term mem concept1)
(let [task {:task-type :belief
:occurrence 1
:frequency 0.8
:confidence 0.9
:statement concept1
:evidences [2]
:eternal false}
task2 {:task-type :goal
:occurrence 1
:plausibility 1
:desirability 0.9
:statement concept1
:evidences [3]
:eternal false}
task-id (m/add-task mem task)
task2-id (m/add-task mem task2)
tasklink {:priority 0.56
:durability 0.78
:quality 1
:task task-id}
tasklink2 {:priority 0.65
:durability 0.8
:quality 1
:task task2-id}]
(m/add-tasklink mem concept1 tasklink "belief")
(m/add-tasklink mem concept1 tasklink2 "goal"))))
(deftest questions-li-inference-test
(let [tasks-topic (rand-id)
answers-topic (rand-id)
{:keys [env-config peer-config]}
(read-config (clojure.java.io/resource "config.edn")
{:profile :test})
zk-address (get-in peer-config [:zookeeper/address])
kafka-io {:input {:read-questions tasks-topic}
:output {:write-answer answers-topic}}
job (build-job zk-address kafka-io 10 1000)
mock (atom {})]
(try
(load-redis-data)
(with-test-env
[test-env [6 env-config peer-config]]
(onyx.test-helper/validate-enough-peers! test-env job)
(reset! mock (mock-kafka zk-address [[tasks-topic input]]))
(onyx.api/submit-job peer-config job)
(is (= (-> (take-values-from-topic zk-address answers-topic)
(assoc-in [0 :belief :id] nil))
output))
(is (= beliefs (u/dissoc-ids (m/beliefs mem 'cat))))
(is (= questions (u/dissoc-ids (m/questions mem 'cat)))))
(finally (swap! mock component/stop)))))
@@ -0,0 +1,123 @@
(ns narjure.test.control.local-inference.quests
(:require [clojure.test :refer [deftest is]]
[aero.core :refer [read-config]]
[com.stuartsierra.component :as component]
[taoensso.carmine :refer [wcar] :as c]
[narjure.system :refer [mem]]
[onyx api
[test-helper :refer [with-test-env]]]
[narjure.test.control.utils :refer [mock-kafka rand-id
take-values-from-topic]]
[narjure.control.local-inference.quests :refer [build-job]]
[narjure.memory.api :as m]
[narjure.test.control.utils :as u]))
(defn input []
(let [task {:statement 'cat
:occurrence 1
:durability 0.95
:priority 1
:evidences [1]
:eternal false}
id (m/add-task mem task)]
[{:task (assoc task :id id)}]))
(def output
[{:durability-diff 0.020000003576278402
:goal {:durability 0.8
:id nil
:priority 0.65
:quality 1.0
:task {:desirability 0.9
:occurrence 1
:eternal false
:evidences [3]
:plausibility 1.0
:statement 'cat
:task-type :goal}}
:quest {:id nil
:durability 0.95
:occurrence 1
:priority 0.8999999761581421
:eternal false
:evidences [1]
:statement 'cat}}])
(def goals
#{{:durability (float 0.82)
:priority (float 0.65)
:quality (float 1.0)
:task {:desirability (float 0.9)
:occurrence 1
:eternal false
:evidences [3]
:plausibility (float 1.0)
:statement 'cat
:task-type :goal}}})
(def quests
#{{:durability (float 0.95)
:priority (float 0.9)
:task {:durability "0.95"
:eternal false
:evidences [1]
:occurrence 1
:priority "1"
:statement 'cat}}})
(defn load-redis-data
[]
(wcar {} (c/flushall))
(let [concept1 'cat]
(m/add-term mem concept1)
(let [task {:task-type :belief
:occurrence 1
:frequency 0.8
:confidence 0.9
:statement concept1
:evidences [2]
:eternal false}
task2 {:task-type :goal
:occurrence 1
:plausibility 1
:desirability 0.9
:statement concept1
:evidences [3]
:eternal false}
task-id (m/add-task mem task)
task2-id (m/add-task mem task2)
tasklink {:priority 0.56
:durability 0.78
:quality 1
:task task-id}
tasklink2 {:priority 0.65
:durability 0.8
:quality 1
:task task2-id}]
(m/add-tasklink mem concept1 tasklink "belief")
(m/add-tasklink mem concept1 tasklink2 "goal"))))
(deftest quests-li-inference-test
(let [tasks-topic (rand-id)
answers-topic (rand-id)
{:keys [env-config peer-config]}
(read-config (clojure.java.io/resource "config.edn")
{:profile :test})
zk-address (get-in peer-config [:zookeeper/address])
kafka-io {:input {:read-quests tasks-topic}
:output {:write-answer answers-topic}}
job (build-job zk-address kafka-io 10 1000)
mock (atom {})]
(try
(load-redis-data)
(with-test-env
[test-env [6 env-config peer-config]]
(onyx.test-helper/validate-enough-peers! test-env job)
(reset! mock (mock-kafka zk-address [[tasks-topic (input)]]))
(onyx.api/submit-job peer-config job)
(is (= (-> (take-values-from-topic zk-address answers-topic)
(assoc-in [0 :goal :id] nil)
(assoc-in [0 :quest :id] nil))
output))
(is (= goals (u/dissoc-ids (m/goals mem 'cat))))
(is (= quests (u/dissoc-ids (m/quests mem 'cat)))))
(finally (swap! mock component/stop)))))
@@ -0,0 +1,91 @@
(ns narjure.test.control.task-preprocessing
(:require
[clojure.test :refer [deftest is]]
[aero.core :refer [read-config]]
[com.stuartsierra.component :as component]
[taoensso.carmine :refer [wcar] :as c]
[narjure.system :refer [mem]]
[onyx api
[test-helper :refer [with-test-env]]]
[narjure.test.control.utils :refer [mock-kafka rand-id
take-values-from-topic]]
[narjure.control.task-preprocessing :refer [build-job]]
[narjure.memory.api :as m]
[narjure.test.control.utils :as u]))
(def input
[{:statement '[--> cat aimal]
:task-type :belief
:occurrence 1}
{:statement '[--> tim cat]
:task-type :question
:occurrence 1}
{:statement '[--> computer intelligent]
:task-type :goal
:occurrence 1}
{:statement '[<=> wut duck]
:task-type :quest
:occurrence 1}])
(def beliefs
#{{:occurrence 1
:statement '[--> cat aimal]
:task-type :belief}})
(def questions
#{{:statement '[--> tim cat]
:task-type :question
:occurrence 1}})
(def goals
#{{:statement '[--> computer intelligent]
:task-type :goal
:occurrence 1}})
(def quests
#{{:statement '[<=> wut duck]
:task-type :quest
:occurrence 1}})
(def cat-tasklinks
#{{:task {:occurrence 1
:statement '[--> cat aimal]
:task-type :belief}}
{:task {:occurrence 1
:statement '[--> tim cat]
:task-type :question}}})
(deftest quests-li-inference-test
(let [read-tasks (rand-id)
write-beliefs (rand-id)
write-goals (rand-id)
write-questions (rand-id)
write-quests (rand-id)
{:keys [env-config peer-config]}
(read-config (clojure.java.io/resource "config.edn")
{:profile :test})
zk-address (get-in peer-config [:zookeeper/address])
kafka-io {:input {:read-task read-tasks}
:output {:write-belief write-beliefs
:write-goal write-goals
:write-question write-questions
:write-quest write-quests}}
job (build-job zk-address kafka-io 10 1000)
mock (atom {})]
(try
(with-test-env
[test-env [8 env-config peer-config]]
(onyx.test-helper/validate-enough-peers! test-env job)
(reset! mock (mock-kafka zk-address [[read-tasks input]]))
(onyx.api/submit-job peer-config job)
(wcar {} (c/flushall))
(is (= (u/dissoc-ids (take-values-from-topic zk-address write-beliefs))
beliefs))
(is (= (u/dissoc-ids (take-values-from-topic zk-address write-goals))
goals))
(is (= (u/dissoc-ids (take-values-from-topic zk-address write-questions))
questions))
(is (= (u/dissoc-ids (take-values-from-topic zk-address write-quests))
quests))
(is (= (u/dissoc-ids (m/tasklinks mem 'cat)) cat-tasklinks)))
(finally (swap! mock component/stop)))))
+42
View File
@@ -0,0 +1,42 @@
(ns narjure.test.control.utils
(:require [onyx.kafka.embedded-server :as ke]
[com.stuartsierra.component :as component]
[clj-kafka
[admin :as kadmin]
[producer :as kp]]
[onyx.kafka.utils :refer [take-until-done]])
(:import (java.util UUID)))
(defn rand-id [] (str "onyx-test-" (UUID/randomUUID)))
(defn mock-kafka
[zookeeper inputs]
(let [log-dir (str "/tmp/embedded-kafka" (UUID/randomUUID))
kafka-server (component/start
(ke/map->EmbeddedKafka
{:hostname "127.0.0.1"
:port 9092
:broker-id 0
:log-dir log-dir
:zookeeper-addr zookeeper}))
producer1 (kp/producer
{"metadata.broker.list" "127.0.0.1:9092"
"serializer.class" "kafka.serializer.DefaultEncoder"
"partitioner.class" "kafka.producer.DefaultPartitioner"})]
(doseq [[topic input] inputs]
(do (doseq [x (concat input [:done])]
(->> (pr-str x)
.getBytes
(kp/message topic)
(kp/send-message producer1)))))
kafka-server))
(defn take-values-from-topic [zk-address topic]
(->> (take-until-done zk-address topic #(read-string (String. % "UTF-8")))
(sort-by (comp :n :value))
(mapv :value)))
(defn dissoc-ids
[coll]
(set (mapv #(dissoc % :id) coll)))
+67
View File
@@ -0,0 +1,67 @@
(ns narjure.test.memory.redis
(:require [clojure.test :refer :all]
[narjure.memory.redis :as r]
[narjure.memory.api :as m]
[taoensso.carmine :as c]))
(def config
{:pool {}
:spec {:host "127.0.0.1" :port 6379}})
(def mem (r/->RedisMemory config))
(def concept1 '[--> tim cat])
(def concept2 'tim)
(def belief1 {:frequency (float 0.9)
:confidence (float 0.2)
:occurrence 1
:term concept1})
(def belief2 {:frequency (float 0.5)
:confidence (float 0.8)
:occurrence 2
:term concept1})
(def goal1 {:frequency (float 0.5)
:confidence (float 0.8)
:occurrence 2
:term concept1})
(defn termlink [c]
{:priority (float 0.1)
:durability (float 0.1)
:quality (float 0.1)
:concept (str (hash c))})
(defn tasklink [task-id]
{:priority (float 0.1)
:durability (float 0.1)
:quality (float 0.1)
:task task-id})
(deftest test-redis
(c/wcar config (c/flushall))
(m/add-term mem concept1)
(is (= concept1 (m/term mem (hash concept1))))
(let [id1 (m/add-task mem belief1)
id2 (m/add-task mem belief2)
id3 (m/add-task mem goal1)]
(m/add-tasklink mem concept1 (tasklink id1) "belief")
(m/add-tasklink mem concept1 (tasklink id2) "belief")
(m/add-tasklink mem concept1 (tasklink id3) "goal")
(is (= (set [belief1 belief2])
(set (map :task (m/beliefs mem concept1)))))
(is (= [goal1]
(map :task (m/goals mem concept1)))))
(is (:task (first (m/beliefs mem concept1))))
(m/add-term mem concept2)
(m/add-termlink mem concept1 (termlink concept2))
(is (= [(termlink concept2)]
(map #(dissoc % :id) (m/termlinks mem concept1))))
(is (= concept2 (m/term mem (:concept (first (m/termlinks mem concept1)))))))