Given a formula f and a clause a in CNF(-f), PCNF computes a proof of s o a (see logic.at/ceres for the definition of o)
Note about checking containment up to variables renaming:
we compute the variable renaming from the lk proof to the resolution proof for a specific clause. We cannot apply it to the formula in s
as it might be quantified over this variables so we apply it to the resulted lk proof. We must apply it as otherwise the substitution in
the resolution to lk transformation will not be applied to these clauses. In the weakenings application at the end of this method we try
to apply it to the formulas as well as if it is quantified over these variables, it will be also quantified in the proof so no damage
done.
Linear Supertypes
Serializable, Product, Equals, Exception, Throwable, Serializable, AnyRef, Any
This member is added by an implicit conversion from ResolutionException to
any2stringadd[ResolutionException] performed by method any2stringadd in scala.Predef.
This member is added by an implicit conversion from ResolutionException to
ArrowAssoc[ResolutionException] performed by method ArrowAssoc in scala.Predef.
This member is added by an implicit conversion from ResolutionException to
StringFormat[ResolutionException] performed by method StringFormat in scala.Predef.
This member is added by an implicit conversion from ResolutionException to
ArrowAssoc[ResolutionException] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Deprecated Value Members
defgetStackTraceString: String
Implicit information
This member is added by an implicit conversion from ResolutionException to
RichException performed by method RichException in scala.Predef.
Definition Classes
RichException
Annotations
@deprecated
Deprecated
(Since version 2.11.0) Use Throwable#getStackTrace
Given a formula f and a clause a in CNF(-f), PCNF computes a proof of s o a (see logic.at/ceres for the definition of o) Note about checking containment up to variables renaming: we compute the variable renaming from the lk proof to the resolution proof for a specific clause. We cannot apply it to the formula in s as it might be quantified over this variables so we apply it to the resulted lk proof. We must apply it as otherwise the substitution in the resolution to lk transformation will not be applied to these clauses. In the weakenings application at the end of this method we try to apply it to the formulas as well as if it is quantified over these variables, it will be also quantified in the proof so no damage done.