Class/Object

ap.terfor.preds

PredConj

Related Docs: object PredConj | package preds

Permalink

class PredConj extends Formula with SortedWithOrder[PredConj]

A class for representing a conjunction of positive and negative predicate literals

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PredConj
  2. SortedWithOrder
  3. Sorted
  4. Formula
  5. TerFor
  6. AnyRef
  7. 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. def --(that: PredConj): PredConj

    Permalink
  4. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  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. lazy val constants: Set[ConstantTerm]

    Permalink
    Definition Classes
    PredConjSortedWithOrderTerFor
  8. def diff(oldConj: PredConj)(implicit fullOrder: TermOrder): (PredConj, PredConj)

    Permalink

    Find the subset of literals in this conjunction that also occur in oldConj, as well as the subset of literals that do not occur in oldConj.

    Find the subset of literals in this conjunction that also occur in oldConj, as well as the subset of literals that do not occur in oldConj.

  9. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  10. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    PredConj → AnyRef → Any
  11. def filter(pred: (Atom) ⇒ Boolean): PredConj

    Permalink
  12. def finalize(): Unit

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

    Permalink
    Definition Classes
    AnyRef → Any
  14. lazy val groundAtoms: Set[Atom]

    Permalink
    Definition Classes
    PredConjFormula
  15. def hashCode(): Int

    Permalink
    Definition Classes
    PredConj → AnyRef → Any
  16. def implies(that: PredConj): Boolean

    Permalink
  17. def isFalse: Boolean

    Permalink

    Return true if this formula is obviously always false.

    Return true if this formula is obviously always false. The only allowed case at this point is that the conjunction contains exactly two literals, the same atom positively and negatively

    Definition Classes
    PredConjFormula
  18. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  19. def isLiteral: Boolean

    Permalink
  20. def isSortedBy(otherOrder: TermOrder): Boolean

    Permalink
    Definition Classes
    SortedWithOrderSorted
  21. def isTrue: Boolean

    Permalink

    Return true if this formula is obviously always true

    Return true if this formula is obviously always true

    Definition Classes
    PredConjFormula
  22. def iterator: Iterator[PredConj]

    Permalink
  23. def lookupFunctionResult(atom: Atom): Option[LinearCombination]

    Permalink

    Check whether there is a positive literal with the given predicate, and starting with the given arguments, and return the last argument.

  24. def lookupFunctionResult(pred: Predicate, arguments: Seq[LinearCombination]): Option[LinearCombination]

    Permalink

    Check whether there is a positive literal with the given predicate, and starting with the given arguments, and return the last argument.

  25. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  26. def negate: PredConj

    Permalink

    Create the negation of exactly one literal

  27. val negativeLits: IndexedSeq[Atom]

    Permalink
  28. lazy val negativeLitsAsSet: Set[Atom]

    Permalink
  29. def negativeLitsWithPred(pred: Predicate): IndexedSeq[Atom]

    Permalink
  30. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  32. val order: TermOrder

    Permalink
    Definition Classes
    PredConjSortedWithOrder
  33. def partition(pred: (Atom) ⇒ Boolean): (PredConj, PredConj)

    Permalink
  34. val positiveLits: IndexedSeq[Atom]

    Permalink
  35. lazy val positiveLitsAsSet: Set[Atom]

    Permalink
  36. def positiveLitsWithPred(pred: Predicate): IndexedSeq[Atom]

    Permalink
  37. lazy val predicates: Set[Predicate]

    Permalink
    Definition Classes
    PredConjSortedWithOrderTerFor
  38. def size: Int

    Permalink
  39. def sortBy(newOrder: TermOrder): PredConj

    Permalink

    Re-sort an object with a new TermOrder.

    Re-sort an object with a new TermOrder. It is guaranteed that the result isSortedBy(order)

    Definition Classes
    PredConjSorted
  40. final def synchronized[T0](arg0: ⇒ T0): T0

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

    Permalink
    Definition Classes
    PredConj → AnyRef → Any
  42. def unary_!: PredConj

    Permalink
  43. def updateLits(newPosLits: IndexedSeq[Atom], newNegLits: IndexedSeq[Atom])(implicit newOrder: TermOrder): PredConj

    Permalink
  44. def updateLits(newPosLits: IndexedSeq[Atom], newNegLits: IndexedSeq[Atom], logger: ComputationLogger)(implicit newOrder: TermOrder): PredConj

    Permalink

    Update the literals of this conjunction; if nothing has changed, the old object is returned

  45. def updateLitsSubset(newPosLits: IndexedSeq[Atom], newNegLits: IndexedSeq[Atom], newOrder: TermOrder): PredConj

    Permalink

    Update the atoms of this conjunction under the assumption that the new atoms form a subset of the old atoms

  46. lazy val variables: Set[VariableTerm]

    Permalink
    Definition Classes
    PredConjTerFor
  47. final def wait(): Unit

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

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

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

Inherited from SortedWithOrder[PredConj]

Inherited from Sorted[PredConj]

Inherited from Formula

Inherited from TerFor

Inherited from AnyRef

Inherited from Any

Ungrouped