Package edu.uky.ai.logic

Interface Bindings

All Superinterfaces:
Substitution
All Known Implementing Classes:
ListBindings
public interface Bindings extends Substitution
A set of assignments of values to Term terms. A set of bindings can reason about which terms are equal (have the same value) and which are not equal (have different values). A set of bindings must be consistent, meaning it may not contains any contradictions (e.g. two terms are both equal and not equal). Bindings data structures may or may not be immutable (meaning operations that would modify the structure return a new structure instead). All methods which modify a set of bindings return a set of bindings; these methods may or may not modify the original structure. Thus, if you do not know whether a particular set of bindings is immutable or not, you should treat it as if it were immutable, just in case.
Author:
Stephen G. Ware

  • Method Summary

    Modifier and Type
    Method
    Description
    Bindings
    setEqual(Term t1, Term t2)
    Declares that two terms must have the same value.
    Bindings
    setNotEqual(Term t1, Term t2)
    Declares that two terms must have different values.

    Methods inherited from interface edu.uky.ai.logic.Substitution

    get

  • Method Details

    • setEqual

      Bindings setEqual(Term t1, Term t2)
      Declares that two terms must have the same value.
      Parameters:
      t1 - the first term
      t2 - the second term
      Returns:
      a set of bindings in which both terms must have the same value, or null if such a set would contain a contradiction

    • setNotEqual

      Bindings setNotEqual(Term t1, Term t2)
      Declares that two terms must have different values.
      Parameters:
      t1 - the first term
      t2 - the second term
      Returns:
      a set of bindings in which both terms must have different values, or null if such a set would contain a contradiction