Object

at.logic.gapt.expr.fol

FOLUnificationAlgorithm

Related Doc: package fol

Permalink

object FOLUnificationAlgorithm extends UnificationAlgorithm

Created by sebastian on 2/9/15.

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. FOLUnificationAlgorithm
  2. UnificationAlgorithm
  3. FinitaryUnification
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def applySubToListOfPairs(l: List[(FOLExpression, FOLExpression)], s: FOLSubstitution): List[(FOLExpression, FOLExpression)]

    Permalink
  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  11. def getVars(f: FOLExpression): List[FOLVar]

    Permalink
  12. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  13. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  14. def isSolvedVarIn(x: FOLVar, l: List[(FOLExpression, FOLExpression)]): Boolean

    Permalink
  15. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  16. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  17. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  18. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  19. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  20. def unify(term1: FOLExpression, term2: FOLExpression): List[FOLSubstitution]

    Permalink

    Calculates the complete set of most general unifiers of the terms term1 and term2.

    Calculates the complete set of most general unifiers of the terms term1 and term2.

    term1

    one of the terms to unify. formulas are also allowed, so we accept FOL expressions

    term2

    one of the terms to unify. formulas are also allowed, so we accept FOL expressions

    returns

    a list of mgus, the empty list means that term1 and term2 are not unifiable.

    Definition Classes
    FOLUnificationAlgorithmFinitaryUnification
  21. def unify(seq1: HOLSequent, seq2: HOLSequent): List[FOLSubstitution]

    Permalink
  22. def unifySetOfTuples(s1: List[(FOLExpression, FOLExpression)], s2: List[(FOLExpression, FOLExpression)]): Option[(List[(FOLExpression, FOLExpression)], List[(FOLExpression, FOLExpression)])]

    Permalink
  23. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  25. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from UnificationAlgorithm

Inherited from FinitaryUnification

Inherited from AnyRef

Inherited from Any

Ungrouped