proofofconcept
proofofconcept copied to clipboard
assessment: what are the inference rule tuples and triples?
Given the graph and the inference rule basis,
- what are the most frequent and least frequent inference rule tuples?
- what are the most frequent and least frequent inference rule triples?
For finding inference rule tuples in a derivation graph, look at each expression and then see if it is an output and an input for adjacent steps.
The relevant cases are
(infrule A) ->- (expr 1) ->- (infrule C)
produces tuple `A, C'
(infrule A) ->-\
->- (expr 1) ->- (infrule C)
(infrule B) ->-/
produces tuples A,C
and B,C
(infrule A) ->-\ /->- (infrule C)
->- (expr 1) ->-
(infrule B) ->-/ \->- (infrule D)
produces tuples A,C
and A,D
and B,C
and B,D
/->- (infrule C)
(infrule A) ->- (expr 1) ->-
\->- (infrule D)
produces tuples A,C
and A,D