Datasets:

LukasHug commited on
Commit
4e6ba1b
·
1 Parent(s): 4c917be

Update README.md

Browse files
Files changed (1) hide show
  1. README.md +17 -0
README.md CHANGED
@@ -38,12 +38,29 @@ of machine learning models to learn and apply logical reasoning within a visual
38
 
39
  ### Supported Tasks and Leaderboards
40
 
 
 
41
  (i) Theory X: The train has either a short, closed car or a car with a barrel load is somewhere behind a car with a golden vase load. This rule was originally introduced as "Theory X" in the new East-West Challenge.
42
 
43
  (ii) Numerical rule: The train has a car where its car position equals its number of payloads which equals its number of wheel axles.
44
 
45
  (iii) Complex rule: Either, there is a car with a car number which is smaller than its number of wheel axles count and smaller than the number of loads, or there is a short and a long car with the same colour where the position number of the short car is smaller than the number of wheel axles of the long car, or the train has three differently coloured cars. We refer to Tab. 3 in the supp. for more insights on required reasoning properties for each rule.
46
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
47
  ### Languages
48
 
49
  English
 
38
 
39
  ### Supported Tasks and Leaderboards
40
 
41
+ Logical complexity:
42
+
43
  (i) Theory X: The train has either a short, closed car or a car with a barrel load is somewhere behind a car with a golden vase load. This rule was originally introduced as "Theory X" in the new East-West Challenge.
44
 
45
  (ii) Numerical rule: The train has a car where its car position equals its number of payloads which equals its number of wheel axles.
46
 
47
  (iii) Complex rule: Either, there is a car with a car number which is smaller than its number of wheel axles count and smaller than the number of loads, or there is a short and a long car with the same colour where the position number of the short car is smaller than the number of wheel axles of the long car, or the train has three differently coloured cars. We refer to Tab. 3 in the supp. for more insights on required reasoning properties for each rule.
48
 
49
+ Visual complexity:
50
+
51
+ (i) Realistic train representaions.
52
+ (ii) Block representation.
53
+
54
+ Train lengths:
55
+
56
+ (i) A train carrying 2-4 cars.
57
+ (ii) A train carrying 7 cars.
58
+
59
+ Train attribute distributions:
60
+
61
+ (i) Michalski attribute distribution.
62
+ (ii) Random attribute distribution.
63
+
64
  ### Languages
65
 
66
  English