thesis version

Author: cmaclell

agents/WhereWhenHowNoFoa.py

@@ -1,4 +1,4 @@
-# from pprint import pprint
+from pprint import pprint
 from random import random
 from random import choice
 
@@ -31,13 +31,15 @@ def __init__(self, action_set):
         self.where = MostSpecific
         # self.when = 'naive bayes'
         # self.when = 'always true'
-        # self.when = 'trestle'
-        self.when = 'decision tree'
+        self.when = 'trestle'
+        # self.when = 'cobweb'
+        # self.when = 'decision tree'
         self.skills = {}
         self.examples = {}
         self.action_set = action_set
 
     def request(self, state):
+        # print(state)
         # print("REQUEST RECEIVED")
         tup = Tuplizer()
         flt = Flattener()
@@ -85,7 +87,7 @@ def request(self, state):
         skillset.sort(reverse=True)
 
         # print('####SKILLSET####')
-        # pprint(skillset)
+        pprint(skillset)
         # print('####SKILLSET####')
 
         # used for grounding out plans, don't need to build up each time.
@@ -285,6 +287,11 @@ def compute_exp_depth(self, exp):
         return 0
 
     def train(self, state, label, foas, selection, action, inputs, correct):
+        print('label', label)
+        print('selection', selection)
+        print('action', action)
+        print('input', inputs)
+        print('correct', correct)
 
         # label = 'math'
 
@@ -524,8 +531,8 @@ def train(self, state, label, foas, selection, action, inputs, correct):
                 # print("SAI")
                 # print(r_exp[0])
 
-                # print("CONSTRAINTS")
-                # print(constraints)
+                print("CONSTRAINTS")
+                print(constraints)
 
                 w_args = tuple(['?foa%s' % j for j, _ in enumerate(args)])
 
@@ -587,7 +594,9 @@ def generate_tutor_constraints(self, sai):
             constraints.add(('name', selection, 'done'))
         else:
             # constraints.add(('not', ('type', selection, 'MAIN::button')))
-            constraints.add(('type', selection, 'MAIN::cell'))
+            constraints.add(('not', ('type', selection, 'MAIN::button')))
+            constraints.add(('not', ('type', selection, 'MAIN::label')))
+            # constraints.add(('type', selection, 'MAIN::cell'))
 
         # value constraints, don't select empty values
         for i, a in enumerate(args[1:]):

planners/fo_planner.py

@@ -871,12 +871,20 @@ def match(self, index, epsilon=0.0, initial_mapping=None):
 
 if __name__ == "__main__":
 
-    facts = [(('value', 'test1'), 'this is a test sentence'),
-             (('value', 'test2'), 'BOOM')]
+    import sys
+    sys.path.insert(0, './')
+
+    from planners.rulesets import arith_rules
+
+    facts = [(('value', 'ul'), '6'),
+             (('value', 'ur'), '8'),
+             (('value', 'll'), '-3')]
     # kb = FoPlanner(facts, [unigramize, bigramize])
-    kb = FoPlanner(facts, [])
-    kb.fc_infer()
-    print(kb.facts)
+    kb = FoPlanner(facts, arith_rules)
+    # kb.fc_infer()
+    for m in kb.fc_query([(('value', '?x'), '9')], max_depth=1):
+        print(m)
+    # print(kb.facts)
 
     # criminal_rule = Operator(('Criminal', '?x'), [('Criminal', '?x')], [],
     #                         [('American', '?x'),