Packages

  • package root
    Definition Classes
    root
  • package ap

    Package object making available some of the objects in sub-packages

    Package object making available some of the objects in sub-packages

    Definition Classes
    root
  • package theories

    Package object making available some of the objects in sub-packages

    Package object making available some of the objects in sub-packages

    Definition Classes
    ap
  • abstract class SaturationProcedure extends Theory

    Class to simplify the implementation of saturation procedures as part of theory plugins.

    Class to simplify the implementation of saturation procedures as part of theory plugins. A saturation procedure is a procedure waiting for patterns to occur in a proof goal (e.g., formulas of a certain shape), and can apply proof rules for every such occurrence. Saturation will be implemented by adding tasks to the task queue of every goal, so that the prover can globally schedule the different rules to be applied.

    This procedure does not take into account that applications points might get rewritten during the proof process; e.g., a variable x could turn into y when the equation x = y appears. In such cases, the saturation rule could get applied repeatedly for the same point.

    Definition Classes
    theories
  • ApplicationPoint
  • PointHandler

class PointHandler extends TheoryProcedure

Scheduled tasks of the saturation procedure. Each of those tasks takes care of one application point.

Linear Supertypes
TheoryProcedure, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PointHandler
  2. TheoryProcedure
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new PointHandler(point: ApplicationPoint)

Type Members

  1. class RichActionSeq extends AnyRef
    Definition Classes
    TheoryProcedure

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  8. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  9. def goalState(goal: Goal): proof.theoryPlugins.Plugin.GoalState.Value

    From a theory procedure, determine in which state a given goal is.

    From a theory procedure, determine in which state a given goal is.

    Definition Classes
    TheoryProcedure
  10. def handleGoal(goal: Goal): Seq[Action]

    Apply this procedure to the given goal.

    Apply this procedure to the given goal.

    Definition Classes
    PointHandler → TheoryProcedure
  11. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  12. def interfaceConstants(goal: Goal, consideredPredicates: Set[Predicate], theoryPredicates: Set[Predicate]): Set[ConstantTerm]

    Find constants that occur both in atoms constructed using predicates from consideredPredicates and in atoms constructed using predicates not in theoryPredicates.

    Find constants that occur both in atoms constructed using predicates from consideredPredicates and in atoms constructed using predicates not in theoryPredicates. Arithmetic facts (equations, disequations, inequalities) in a goal are not considered, but arithmetic clauses are included.

    Definition Classes
    TheoryProcedure
  13. def interfaceConstants(goal: Goal, theoryPredicates: Set[Predicate]): Set[ConstantTerm]

    Find constants that occur both in atoms constructed using theory predicates and in atoms constructed using non-theory predicates.

    Find constants that occur both in atoms constructed using theory predicates and in atoms constructed using non-theory predicates. Arithmetic facts (equations, disequations, inequalities) in a goal are not considered, but arithmetic clauses are included.

    Definition Classes
    TheoryProcedure
  14. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  15. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  17. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  18. val point: ApplicationPoint
  19. implicit def richActionSeq(acts: Seq[Action]): RichActionSeq

    An implicit function to simplify cascading of possible actions.

    An implicit function to simplify cascading of possible actions.

    Attributes
    protected
    Definition Classes
    TheoryProcedure
  20. val saturationProcedure: SaturationProcedure
  21. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  22. def toString(): String
    Definition Classes
    PointHandler → AnyRef → Any
  23. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  24. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  25. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

    (Since version 9)

Inherited from TheoryProcedure

Inherited from AnyRef

Inherited from Any

Ungrouped