Difference between revisions of "RuleTransformation"
From Knowitall
(→Overview) |
(→Overview) |
||
| Line 7: | Line 7: | ||
<pre> | <pre> | ||
| − | T(arg1:String, rel:String, arg2:String, arg3:String, narg1:String, nrel:String, narg2:String) | + | T(arg1:String, rel:String, arg2:String, arg3:String, narg1:String, nrel:String, narg2:String) |
</pre> | </pre> | ||
Revision as of 07:06, 21 August 2013
Overview
Inference rules are represented in human-readable format. This page describes the transformation of these rules into Tuffy's MLN syntax.
We first define a general purpose tuple predicate (T) that can represent n-ary and nested tuples.
T(arg1:String, rel:String, arg2:String, arg3:String, narg1:String, nrel:String, narg2:String)
