Object/Class

ap.proof

ModelSearchProver

Related Docs: class ModelSearchProver | package proof

Permalink

object ModelSearchProver

A prover that tries to construct a countermodel of a ground formula. This prover works in depth-first mode, in contrast to the ExhaustiveProver.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ModelSearchProver
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Type Members

  1. case class AddFormulaDir(formula: Conjunction) extends SearchDirection with Product with Serializable

    Permalink
  2. abstract class IncProver extends AnyRef

    Permalink
  3. sealed abstract class SearchDirection extends AnyRef

    Permalink

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. object AcceptModelDir extends SearchDirection with Product with Serializable

    Permalink
  5. val DEFAULT: ModelSearchProver

    Permalink
  6. object DeriveFullModelDir extends SearchDirection with Product with Serializable

    Permalink
  7. object NextModelDir extends SearchDirection with Product with Serializable

    Permalink
  8. object ReturnSatDir extends SearchDirection with Product with Serializable

    Permalink
  9. def apply(inputDisjuncts: Seq[Conjunction], order: TermOrder, settings: GoalSettings, withFullModel: Boolean = true): Either[Conjunction, Certificate]

    Permalink

    inputDisjuncts are the formulae (connected disjunctively) to be disproven.

    inputDisjuncts are the formulae (connected disjunctively) to be disproven. The result of the method is either countermodel of inputDisjuncts (the case Left), or a proof of validity (Right). In case proof construction is disabled, the validity result will be Left(FALSE).

  10. def apply(inputFor: Formula, order: TermOrder): Conjunction

    Permalink

    inputFor is the formula to be disproven.

    inputFor is the formula to be disproven. The result of the method is a countermodel of inputFor, or FALSE if it was not possible to find one (this implies that inputFor is valid).

  11. final def asInstanceOf[T0]: T0

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  13. def emptyIncProver(rawSettings: GoalSettings): IncProver

    Permalink
  14. final def eq(arg0: AnyRef): Boolean

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  18. def hashCode(): Int

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

    Permalink
    Definition Classes
    Any
  20. final def ne(arg0: AnyRef): Boolean

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

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  25. final def wait(): Unit

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped