³ò zdhKc@sVddklZddklZeƒZdefd„ƒYZdefd„ƒYZdefd„ƒYZd efd „ƒYZ d efd „ƒYZ d efd„ƒYZ defd„ƒYZ de fd„ƒYZde fd„ƒYZde fd„ƒYZdefd„ƒYZdefd„ƒYZd„Zedjo eƒndS(iÿÿÿÿ(tCounter(t LogicParsert ExpressioncBs&eZed„Zd„Zd„ZRS(cCst|||ƒS(N(tApplicationExpression(tselftothert other_indices((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pytapplytoscCs |i|ƒS(N(R(RR((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyt__call__scCs d|iidt|ƒdS(Nt(t __class__t__name__tstr(R((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyt__repr__s(R t __module__tNoneRRR(((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyRs  tAtomicExpressioncBsVeZed„Zed„Zd„Zd„Zd„Zd„Zd„Z d„Z RS(cCs>t|tƒpt‚||_|p g}n||_dS(sš @param name: C{str} for the constant name @param dependencies: C{list} of C{int} for the indices on which this atom is dependent N(t isinstanceRtAssertionErrortnamet dependencies(RRR((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyt__init__s   cCs(|o||jo ||Sn|SdS(sý If 'self' is bound by 'bindings', return the atomic to which it is bound. Otherwise, return self. @param bindings: C{BindingDict} A dictionary of bindings used to simplify @return: C{AtomicExpression} N((Rtbindings((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pytsimplify%s cCsg|_|gfS(s; From Iddo Lev's PhD Dissertation p108-109 @param index_counter: C{Counter} for unique indices @param glueFormulaFactory: C{GlueFormula} for creating new glue formulas @return: (C{Expression},C{set}) for the compiled linear logic and any newly created glue formulas (R(Rt index_countertglueFormulaFactory((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyt compile_pos2s cCsg|_|gfS(s; From Iddo Lev's PhD Dissertation p108-109 @param index_counter: C{Counter} for unique indices @param glueFormulaFactory: C{GlueFormula} for creating new glue formulas @return: (C{Expression},C{set}) for the compiled linear logic and any newly created glue formulas (R(RRR((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyt compile_neg=s cCs|i|iiƒƒ|_dS(N(tinitialize_labelRtlower(Rtfstruct((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pytinitialize_labelsHscCs#|i|ijo|i|ijS(N(R R(RR((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyt__eq__KscCs.|i}|io|t|iƒ7}n|S(N(RRR(Rtaccum((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyt__str__Ns  cCs t|iƒS(N(thashR(R((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyt__hash__Ts( R RRRRRRR!R"R$R&(((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyRs   tConstantExpressioncBseZd„ZRS(cCs‡t|tƒpt‚t|tƒo5y|t||fgƒSWqqtj oqqXn||jo|Snt|||ƒ‚dS(së If 'other' is a constant, then it must be equal to 'self'. If 'other' is a variable, then it must not be bound to anything other than 'self'. @param other: C{Expression} @param bindings: C{BindingDict} A dictionary of all current bindings @return: C{BindingDict} A new combined dictionary of of 'bindings' and any new binding @raise UnificationException: If 'self' and 'other' cannot be unified in the context of 'bindings' N(RRRtVariableExpressiont BindingDicttVariableBindingExceptiontUnificationException(RRR((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pytunifyXs   (R RR,(((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyR'WsR(cBseZd„ZRS(cCsst|tƒpt‚y0||jo|Sn|t||fgƒSWn%tj ot|||ƒ‚nXdS(s 'self' must not be bound to anything other than 'other'. @param other: C{Expression} @param bindings: C{BindingDict} A dictionary of all current bindings @return: C{BindingDict} A new combined dictionary of of 'bindings' and the new binding @raise UnificationException: If 'self' and 'other' cannot be unified in the context of 'bindings' N(RRRR)R*R+(RRR((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyR,ms  (R RR,(((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyR(lst ImpExpressioncBs\eZd„Zed„Zd„Zd„Zd„Zd„Zd„Z d„Z d„Z RS( cCsDt|tƒpt‚t|tƒpt‚||_||_dS(s @param antecedent: C{Expression} for the antecedent @param consequent: C{Expression} for the consequent N(RRRt antecedentt consequent(RR.R/((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyR€s cCs(|i|ii|ƒ|ii|ƒƒS(N(R R.RR/(RR((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyRŠscCswt|tƒpt‚y4||ii|i|ƒ|ii|i|ƒSWn%tj ot|||ƒ‚nXdS(s Both the antecedent and consequent of 'self' and 'other' must unify. @param other: C{ImpExpression} @param bindings: C{BindingDict} A dictionary of all current bindings @return: C{BindingDict} A new combined dictionary of of 'bindings' and any new bindings @raise UnificationException: If 'self' and 'other' cannot be unified in the context of 'bindings' N(RR-RR.R,R/R*R+(RRR((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyR,s 4cCsM|ii||ƒ\}}|ii||ƒ\}}t||ƒ||fS(s; From Iddo Lev's PhD Dissertation p108-109 @param index_counter: C{Counter} for unique indices @param glueFormulaFactory: C{GlueFormula} for creating new glue formulas @return: (C{Expression},C{set}) for the compiled linear logic and any newly created glue formulas (R.RR/RR-(RRRtata_newtctc_new((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyRœsc Cs†|ii||ƒ\}}|ii||ƒ\}}|iƒ}|ii|ƒ|d||t|gƒƒ}||||gfS(sN From Iddo Lev's PhD Dissertation p108-109 @param index_counter: C{Counter} for unique indices @param glueFormulaFactory: C{GlueFormula} for creating new glue formulas @return: (C{Expression},C{list} of C{GlueFormula}) for the compiled linear logic and any newly created glue formulas sv%s(R.RR/RtgetRtappendtset( RRRR0R1R2R3t fresh_indextnew_v((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyR¨s  cCs$|ii|ƒ|ii|ƒdS(N(R.R!R/(RR ((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyR!·scCs6|i|ijo#|i|ijo|i|ijS(N(R R.R/(RR((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyR"»scCs7tit|iƒdtidt|iƒtiS(NR (tTokenstOPENRR.tIMPR/tCLOSE(R((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyR$¿scCs,tdt|iƒtit|iƒfƒS(Ns%s%s%s(R%R.R9R;R/(R((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyR&Ãs( R RRRRR,RRR!R"R$R&(((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyR-s      RcBs;eZed„Zed„Zd„Zd„Zd„ZRS(cCsf|iƒ}|iƒ}t|tƒpt‚t|tƒpt‚tƒ}y_t|tƒo||i7}nt|tƒo||i7}n||ii ||ƒ7}Wn+t j o}t d|||f‚nX|odt |ii ƒ|jpt d||f‚nt |ii ƒ|jot d||f‚qGn||_||_||_dS(sZ @param function: C{Expression} for the function @param argument: C{Expression} for the argument @param argument_indices: C{set} for the indices of the glue formula from which the argument came @raise LinearLogicApplicationException: If 'function' cannot be applied to 'argument' given 'argument_indices'. sCannot apply %s to %s. %ssODependencies unfulfilled when attempting to apply Linear Logic formula %s to %ssbDependencies not a proper subset of indices when attempting to apply Linear Logic formula %s to %sN(RRR-RRR)RRR.R,R+tLinearLogicApplicationExceptionR6Rtfunctiontargument(RR>R?targument_indicest function_simpt argument_simpRte((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyRÇs*     cCs'|p |i}n|ii|ƒiS(sE Since function is an implication, return its consequent. There should be no need to check that the application is valid since the checking is done by the constructor. @param bindings: C{BindingDict} A dictionary of bindings used to simplify @return: C{Expression} (RR>RR/(RR((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyRës  cCs6|i|ijo#|i|ijo|i|ijS(N(R R>R?(RR((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyR"ùscCs(t|iƒtit|iƒtiS(N(RR>R9R:R?R<(R((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyR$ýscCs,tdt|iƒtit|iƒfƒS(Ns%s%s%s(R%R.R9R:R/(R((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyR&s(R RRRRR"R$R&(((s*/p/zhu/06/nlp/nltk/nltk/sem/linearlogic.pyRÆs  $   R)cBsJeZed„Zd„Zd„Zd„Zd„Zd„Zd„Z RS(cCs9h|_|o%x"|D]\}}||| s"  ?G=J *