CVC3
Classes | Public Member Functions | Private Member Functions | Private Attributes | Friends

CVC3::TheoryArith3 Class Reference

#include <theory_arith3.h>

Inherits CVC3::TheoryArith.

Collaboration diagram for CVC3::TheoryArith3:
Collaboration graph
[legend]

List of all members.

Classes

Public Member Functions

Private Member Functions

Private Attributes

Friends


Detailed Description

Definition at line 29 of file theory_arith3.h.


Constructor & Destructor Documentation

TheoryArith3::TheoryArith3 ( TheoryCore core)
TheoryArith3::~TheoryArith3 ( )

Member Function Documentation

Theorem TheoryArith3::isIntegerThm ( const Expr e) [private]

Check the term t for integrality.

Returns:
a theorem of IS_INTEGER(t) or Null.

Definition at line 68 of file theory_arith3.cpp.

References CVC3::Expr::getType(), CVC3::IS_INTEGER, and CVC3::isReal().

Referenced by processFiniteInterval().

Theorem TheoryArith3::isIntegerDerive ( const Expr isIntE,
const Theorem thm 
) [private]

A helper method for isIntegerThm()

Check if IS_INTEGER(e) is easily derivable from the given 'thm'

Definition at line 76 of file theory_arith3.cpp.

References CVC3::Expr::arity(), CVC3::Theorem::getExpr(), CVC3::Expr::isAnd(), and CVC3::Theorem::isNull().

Referenced by rewrite().

const Rational & TheoryArith3::freeConstIneq ( const Expr ineq,
bool  varOnRHS 
) [private]

Extract the free constant from an inequality.

Definition at line 93 of file theory_arith3.cpp.

References DebugAssert, CVC3::isIneq(), CVC3::PLUS, RATIONAL_EXPR, and CVC3::Expr::toString().

const TheoryArith3::FreeConst & TheoryArith3::updateSubsumptionDB ( const Expr ineq,
bool  varOnRHS,
bool &  subsumed 
) [private]

Update the free constant subsumption database with new inequality.

Returns:
a reference to the max/min constant.

Also, sets 'subsumed' argument to true if the inequality is subsumed by an existing inequality.

Definition at line 111 of file theory_arith3.cpp.

References CVC3::Expr::arity(), CVC3::Expr::begin(), DebugAssert, CVC3::Expr::end(), CVC3::CDMap< Key, Data, HashFcn >::find(), CVC3::CDOmap< Key, Data, HashFcn >::get(), CVC3::TheoryArith3::FreeConst::getConst(), CVC3::Expr::getRational(), CVC3::int2string(), CVC3::isLE(), CVC3::isLT(), CVC3::isPlus(), CVC3::isRational(), CVC3::leExpr(), CVC3::plusExpr(), CVC3::TheoryArith3::FreeConst::strict(), CVC3::Expr::toString(), and TRACE.

bool TheoryArith3::kidsCanonical ( const Expr e) [private]

Check if the kids of e are fully simplified and canonized (for debugging)

Definition at line 180 of file theory_arith3.cpp.

References CVC3::Expr::arity(), std::endl(), and IF_DEBUG.

Theorem TheoryArith3::canon ( const Expr e) [private, virtual]

Canonize the expression e, assuming all children are canonical.

Implements CVC3::TheoryArith.

Definition at line 212 of file theory_arith3.cpp.

References CVC3::Expr::arity(), DebugAssert, CVC3::DIVIDE, CVC3::Expr::getKind(), CVC3::Theorem::getRHS(), CVC3::isRational(), CVC3::MINUS, CVC3::MULT, CVC3::PLUS, CVC3::POW, CVC3::Expr::toString(), TRACE, and CVC3::UMINUS.

Referenced by processFiniteInterval(), and rewrite().

Theorem TheoryArith3::canonSimplify ( const Expr e) [private]

Canonize and reduce e w.r.t. union-find database; assume all children are canonical.

Definition at line 360 of file theory_arith3.cpp.

References DebugAssert, CVC3::Theorem::getRHS(), CVC3::Expr::hasFind(), CVC3::Expr::toString(), and TRACE.

Theorem CVC3::TheoryArith3::canonSimplify ( const Theorem thm) [inline, private]

Composition of canonSimplify(const Expr&) by transitivity: take e0 = e1, canonize and simplify e1 to e2, return e0 = e2.

Definition at line 168 of file theory_arith3.h.

Theorem TheoryArith3::canonPred ( const Theorem thm) [private]

Canonize predicate (x = y, x < y, etc.)

accepts a theorem, canonizes it, applies iffMP and substituvity to derive the canonized thm

Definition at line 390 of file theory_arith3.cpp.

References CVC3::Expr::arity(), DebugAssert, CVC3::Theorem::getExpr(), CVC3::Expr::getOp(), and CVC3::Theorem::toString().

Referenced by processFiniteInterval().

Theorem TheoryArith3::canonPredEquiv ( const Theorem thm) [private]

Canonize predicate like canonPred except that the input theorem is an equivalent transformation.

accepts an equivalence theorem, canonizes it, applies iffMP and substituvity to derive the canonized thm

Definition at line 404 of file theory_arith3.cpp.

References CVC3::Expr::arity(), DebugAssert, CVC3::Expr::getOp(), CVC3::Theorem::getRHS(), and CVC3::Theorem::toString().

Referenced by normalize(), and rewrite().

Theorem TheoryArith3::doSolve ( const Theorem thm) [private]

Solve an equation and return an equivalent Theorem in the solved form.

Pseudo-code for doSolve. (Input is an equation) (output is a Theorem)

  1. translate e to the form e' = 0
  2. if (e'.isRational()) then {if e' != 0 return false else true}
  3. a for loop checks if all the variables are integers.
    • if not isolate a suitable real variable and call processRealEq().
    • if all variables are integers then isolate suitable variable and call processIntEq().

Definition at line 432 of file theory_arith3.cpp.

References CVC3::Expr::arity(), CVC3::Expr::begin(), DebugAssert, CVC3::Expr::end(), EQ, FatalAssert, CVC3::Theorem::getExpr(), CVC3::Expr::getRational(), CVC3::Rational::getUnsigned(), IF_DEBUG, CVC3::isInt(), isIntx(), CVC3::isMult(), CVC3::Theorem::isNull(), CVC3::isPlus(), CVC3::isPow(), CVC3::Expr::isRational(), CVC3::isRational(), CVC3::Theorem::isRewrite(), MiniSat::left(), CVC3::pow(), CVC3::ratRoot(), MiniSat::right(), CVC3::Expr::toString(), CVC3::Theorem::toString(), and TRACE.

Referenced by solve().

Theorem TheoryArith3::canonConjunctionEquiv ( const Theorem thm) [private]

takes in a conjunction equivalence Thm and canonizes it.

accepts an equivalence theorem whose RHS is a conjunction, canonizes it, applies iffMP and substituvity to derive the canonized thm

Definition at line 419 of file theory_arith3.cpp.

bool TheoryArith3::pickIntEqMonomial ( const Expr right,
Expr isolated,
bool &  nonlin 
) [private]

picks the monomial with the smallest abs(coeff) from the input

pick a monomial for the input equation. This function is used only if the equation is an integer equation. Choose the monomial with the smallest absolute value of coefficient.

Definition at line 590 of file theory_arith3.cpp.

References CVC3::abs(), CVC3::Expr::arity(), CVC3::Expr::begin(), DebugAssert, CVC3::Expr::end(), CVC3::isMult(), CVC3::isPlus(), CVC3::isRational(), MiniSat::min(), and CVC3::Expr::toString().

Theorem TheoryArith3::processRealEq ( const Theorem eqn) [private]

processes equalities with 1 or more vars of type REAL

input is 0=e' Theorem and some of the vars in e' are of type REAL. isolate one of them and send back to framework. output is "var = e''" Theorem.

Definition at line 642 of file theory_arith3.cpp.

References CVC3::Expr::arity(), DebugAssert, EQ, CVC3::Theorem::getLHS(), CVC3::Expr::getRational(), CVC3::Theorem::getRHS(), CVC3::isMult(), CVC3::isPlus(), CVC3::isRational(), CVC3::Expr::isRational(), CVC3::isReal(), MiniSat::left(), MiniSat::right(), CVC3::Expr::toString(), CVC3::Theorem::toString(), and TRACE.

Theorem TheoryArith3::processIntEq ( const Theorem eqn) [private]

processes equalities whose vars are all of type INT

input is 0=e' Theorem and all of the vars in e' are of type INT. isolate one of them and send back to framework. output is "var = e''" Theorem and some associated equations in solved form.

Definition at line 889 of file theory_arith3.cpp.

References CVC3::Expr::arity(), DebugAssert, CVC3::Theorem::getExpr(), CVC3::Expr::isAnd(), CVC3::Expr::isBoolConst(), CVC3::Expr::isFalse(), CVC3::Theorem::isRewrite(), CVC3::Expr::toString(), and TRACE.

Theorem TheoryArith3::processSimpleIntEq ( const Theorem eqn) [private]
void TheoryArith3::processBuffer ( ) [private]

Process inequalities in the buffer.

Definition at line 1059 of file theory_arith3.cpp.

References DebugAssert, CVC3::Theorem::getExpr(), CVC3::isPlus(), CVC3::Expr::isTrue(), and CVC3::Expr::toString().

Referenced by assertFact(), and checkSat().

Theorem TheoryArith3::isolateVariable ( const Theorem inputThm,
bool &  e1 
) [private]
void TheoryArith3::updateStats ( const Rational c,
const Expr var 
) [private]

Update the statistics counters for the variable with a coeff. c.

Definition at line 1085 of file theory_arith3.cpp.

References CVC3::CDMap< Key, Data, HashFcn >::end(), CVC3::CDMap< Key, Data, HashFcn >::find(), CVC3::Rational::toString(), and TRACE.

void TheoryArith3::updateStats ( const Expr monomial) [private]

Update the statistics counters for the monomial.

Definition at line 1118 of file theory_arith3.cpp.

References CVC3::Expr::getRational().

void TheoryArith3::addToBuffer ( const Theorem thm) [private]

Add an inequality to the input buffer. See also d_buffer.

Definition at line 1126 of file theory_arith3.cpp.

References CVC3::Expr::begin(), CVC3::Expr::end(), CVC3::Theorem::getExpr(), CVC3::isPlus(), CVC3::isRational(), and TRACE.

Referenced by assertFact().

Expr TheoryArith3::computeNormalFactor ( const Expr rhs) [private]

Given a canonized term, compute a factor to make all coefficients integer and relatively prime.

Definition at line 1220 of file theory_arith3.cpp.

References CVC3::abs(), CVC3::Expr::arity(), CVC3::Rational::getDenominator(), CVC3::Rational::getNumerator(), CVC3::Expr::getRational(), CVC3::isMult(), CVC3::isPlus(), CVC3::MULT, and RATIONAL_EXPR.

Referenced by normalize().

Theorem TheoryArith3::normalize ( const Expr e) [private]

Normalize an equation (make all coefficients rel. prime integers)

accepts a rewrite theorem over eqn|ineqn and normalizes it and returns a theorem to that effect. assumes e is non-trivial i.e. e is not '0=const' or 'const=0' or '0 <= const' etc.

Definition at line 2319 of file theory_arith3.cpp.

References canonPredEquiv(), computeNormalFactor(), d_rules, DebugAssert, EQ, CVC3::GE, CVC3::Expr::getKind(), CVC3::Expr::getRational(), CVC3::GT, CVC3::Expr::isEq(), CVC3::isIneq(), CVC3::isRational(), CVC3::LE, CVC3::LT, CVC3::ArithProofRules::multEqn(), CVC3::ArithProofRules::multIneqn(), CVC3::Theory::reflexivityRule(), CVC3::Expr::toString(), and TRACE.

Referenced by normalize(), and rewrite().

Theorem TheoryArith3::normalize ( const Theorem thm) [private]

Normalize an equation (make all coefficients rel. prime integers)

accepts a rewrite theorem over eqn|ineqn and normalizes it and returns a theorem to that effect.

Definition at line 2382 of file theory_arith3.cpp.

References CVC3::Theorem::getRHS(), normalize(), and CVC3::Theory::transitivityRule().

Expr TheoryArith3::pickMonomial ( const Expr right) [private]
void TheoryArith3::getFactors ( const Expr e,
std::set< Expr > &  factors 
) [private]
void TheoryArith3::separateMonomial ( const Expr e,
Expr c,
Expr var 
) [virtual]

Separate monomial e = c*p1*...*pn into c and 1*p1*...*pn.

Implements CVC3::TheoryArith.

Definition at line 1320 of file theory_arith3.cpp.

References CVC3::Expr::arity(), DebugAssert, CVC3::Expr::getKids(), CVC3::isMult(), CVC3::isPlus(), CVC3::isRational(), CVC3::Expr::isRational(), CVC3::multExpr(), CVC3::Expr::toString(), and TRACE.

Referenced by findRationalBound().

bool CVC3::TheoryArith3::isInteger ( const Expr e) [inline]

Check the term t for integrality (return bool)

Definition at line 234 of file theory_arith3.h.

Referenced by assignVariables(), computeType(), print(), processFiniteInterval(), processFiniteIntervals(), and solve().

bool TheoryArith3::lessThanVar ( const Expr isolatedVar,
const Expr var2 
) [private]

Definition at line 1262 of file theory_arith3.cpp.

References DebugAssert, CVC3::isRational(), and CVC3::Expr::toString().

bool TheoryArith3::isStale ( const Expr e) [private]

Check if the term expression is "stale".

"Stale" means it contains non-simplified subexpressions. For terms, it checks the expression's find pointer; for formulas it checks the children recursively (no caching!). So, apply it with caution, and only to simple atomic formulas (like inequality).

Definition at line 1278 of file theory_arith3.cpp.

References CVC3::Expr::begin(), CVC3::Expr::end(), and CVC3::Expr::isTerm().

bool TheoryArith3::isStale ( const Ineq ineq) [private]
void TheoryArith3::projectInequalities ( const Theorem theInequality,
bool  isolatedVarOnRHS 
) [private]
void TheoryArith3::assignVariables ( std::vector< Expr > &  v) [private]
void TheoryArith3::findRationalBound ( const Expr varSide,
const Expr ratSide,
const Expr var,
Rational r 
) [private]
bool TheoryArith3::findBounds ( const Expr e,
Rational lub,
Rational glb 
) [private]
Theorem TheoryArith3::normalizeProjectIneqs ( const Theorem ineqThm1,
const Theorem ineqThm2 
) [private]
Theorem TheoryArith3::solvedForm ( const std::vector< Theorem > &  solvedEqs) [private]

Take a system of equations and turn it into a solved form.

Takes a vector of equations and for every equation x_i=t_i substitutes t_j for x_j in t_i for all j>i. This turns the system of equations into a solved form.

Assumption: variables x_j may appear in the RHS terms t_i ONLY for i<j, but not for i>=j.

Definition at line 932 of file theory_arith3.cpp.

References CVC3::ExprMap< Data >::begin(), DebugAssert, CVC3::ExprMap< Data >::end(), CVC3::Theorem::getExpr(), IF_DEBUG, TRACE, and TRACE_MSG.

Theorem TheoryArith3::substAndCanonize ( const Expr t,
ExprMap< Theorem > &  subst 
) [private]

Substitute all vars in term 't' according to the substitution 'subst' and canonize the result.

ASSUMPTION: 't' is a fully canonized arithmetic term, and every element of subst is a fully canonized equation of the form x=e, indexed by the LHS variable.

Definition at line 987 of file theory_arith3.cpp.

References CVC3::Expr::arity(), CVC3::ExprMap< Data >::empty(), CVC3::ExprMap< Data >::end(), CVC3::ExprMap< Data >::find(), CVC3::Theorem::getRHS(), and TRACE.

Theorem TheoryArith3::substAndCanonize ( const Theorem eq,
ExprMap< Theorem > &  subst 
) [private]

Substitute all vars in the RHS of the equation 'eq' of the form (x = t) according to the substitution 'subst', and canonize the result.

ASSUMPTION: 't' is a fully canonized equation of the form x = t, and so is every element of subst, indexed by the LHS variable.

Definition at line 1038 of file theory_arith3.cpp.

References DebugAssert, CVC3::ExprMap< Data >::empty(), CVC3::Theorem::getExpr(), CVC3::Theorem::getRHS(), CVC3::Theorem::isRewrite(), and CVC3::Expr::toString().

void TheoryArith3::collectVars ( const Expr e,
std::vector< Expr > &  vars,
std::set< Expr > &  cache 
) [private]

Traverse 'e' and push all the i-leaves into 'vars' vector.

Definition at line 1904 of file theory_arith3.cpp.

References CVC3::Expr::begin(), CVC3::Expr::end(), and CVC3::Theory::isLeaf().

void TheoryArith3::processFiniteInterval ( const Theorem alphaLEax,
const Theorem bxLEbeta 
) [private]
void TheoryArith3::processFiniteIntervals ( const Expr x) [private]

For an integer var 'x', find and process all constraints A <= ax <= A+c.

Definition at line 1975 of file theory_arith3.cpp.

References d_inequalitiesLeftDB, d_inequalitiesRightDB, CVC3::ExprMap< Data >::end(), CVC3::ExprMap< Data >::find(), isInteger(), processFiniteInterval(), and CVC3::CDList< T >::size().

void TheoryArith3::setupRec ( const Expr e) [private]

Recursive setup for isolated inequalities (and other new expressions)

This function recursively decends expression tree without caching until it hits a node that is already setup. Be careful on what expressions you are calling it.

Definition at line 2001 of file theory_arith3.cpp.

References CVC3::Expr::arity(), CVC3::Expr::hasFind(), CVC3::Theory::reflexivityRule(), CVC3::Expr::setEqNext(), CVC3::Expr::setFind(), and setup().

ArithProofRules * TheoryArith3::createProofRules3 ( )

Definition at line 43 of file arith_theorem_producer3.cpp.

Referenced by TheoryArith3().

void TheoryArith3::addSharedTerm ( const Expr e) [virtual]

Notify theory of a new shared term.

When a term e associated with theory i occurs as a child of an expression associated with theory j, the framework calls i->addSharedTerm(e) and j->addSharedTerm(e)

Implements CVC3::TheoryArith.

Definition at line 2015 of file theory_arith3.cpp.

References d_sharedTerms.

void TheoryArith3::assertFact ( const Theorem e) [virtual]
void TheoryArith3::refineCounterExample ( ) [virtual]
void TheoryArith3::computeModelBasic ( const std::vector< Expr > &  v) [virtual]

Assign concrete values to basic-type variables in v.

Implements CVC3::TheoryArith.

Definition at line 2282 of file theory_arith3.cpp.

References assignVariables(), d_inModelCreation, CVC3::Theory::findExpr(), and TRACE.

void TheoryArith3::computeModel ( const Expr e,
std::vector< Expr > &  vars 
) [virtual]

Compute the value of a compound variable from the more primitive ones.

The more primitive variables for e are already assigned concrete values, and are available through getModelValue().

The new value for e must be assigned using assignValue() method.

Parameters:
eis the compound type expression to assign a value;
varsare the variables actually assigned. Normally, 'e' is the only element of vars. However, e.g. in the case of uninterpreted functions, assigning 'f' means assigning all relevant applications of 'f' to constant values (f(0), f(5), etc.). Such applications might not be known before the model is constructed (they may be of the form f(x), f(y+z), etc., where x,y,z are still unassigned).

Populating 'vars' is an opportunity for a DP to change the set of top-level "variables" to assign, if needed. In particular, it may drop 'e' from the model entirely, if it is already a concrete value by itself.

Implements CVC3::TheoryArith.

Definition at line 2305 of file theory_arith3.cpp.

References CVC3::Theory::assignValue(), DebugAssert, CVC3::Theory::findExpr(), CVC3::isRational(), CVC3::Theory::simplify(), and CVC3::Expr::toString().

void TheoryArith3::checkSat ( bool  fullEffort) [virtual]

Check for satisfiability in the theory.

Parameters:
fullEffortwhen it is false, checkSat can do as much or as little work as it likes, though simple inferences and checks for consistency should be done to increase efficiency. If fullEffort is true, checkSat must check whether the set of facts given by assertFact together with the arrangement of shared terms (provided by addSharedTerm) induced by the global find database equivalence relation are satisfiable. If satisfiable, checkSat does nothing.

If satisfiability can be acheived by merging some of the shared terms, a new fact must be enqueued using enqueueFact (this fact need not be a literal). If there is no way to make things satisfiable, setInconsistent must be called.

Implements CVC3::TheoryArith.

Definition at line 2124 of file theory_arith3.cpp.

References d_buffer, d_bufferIdx, d_diseq, d_diseqIdx, d_inModelCreation, d_rules, CVC3::ArithProofRules::diseqToIneq(), CVC3::Theory::enqueueFact(), CVC3::Theory::inconsistent(), processBuffer(), CVC3::CDList< T >::size(), and TRACE.

Theorem TheoryArith3::rewrite ( const Expr e) [virtual]

Theory-specific rewrite rules.

By default, rewrite just returns a reflexive theorem stating that the input expression is equivalent to itself. However, rewrite is allowed to return any theorem which describes how the input expression is equivalent to some new expression. rewrite should be used to perform simplifications, normalization, and any other preprocessing on theory-specific expressions that needs to be done.

Implements CVC3::TheoryArith.

Definition at line 2387 of file theory_arith3.cpp.

References canon(), canonPredEquiv(), CVC3::ArithProofRules::constPredicate(), d_rules, CVC3::DARK_SHADOW, DebugAssert, EQ, CVC3::ArithProofRules::flipInequality(), CVC3::GE, CVC3::Theory::getCommonRules(), CVC3::Expr::getKind(), CVC3::Expr::getRational(), CVC3::Theorem::getRHS(), CVC3::GRAY_SHADOW, CVC3::GT, CVC3::CommonProofRules::iffTrue(), CVC3::IS_INTEGER, CVC3::Expr::isAbsLiteral(), CVC3::Expr::isAtomic(), CVC3::Expr::isEq(), CVC3::isGE(), CVC3::isGT(), CVC3::isIneq(), isIntegerDerive(), CVC3::Theory::isLeaf(), CVC3::Theorem::isNull(), CVC3::Expr::isRational(), CVC3::isRational(), CVC3::Expr::isTerm(), CVC3::LE, CVC3::Theory::leavesAreSimp(), CVC3::LT, CVC3::ArithProofRules::negatedInequality(), normalize(), NOT, CVC3::Theory::reflexivityRule(), CVC3::CommonProofRules::rewriteUsingSymmetry(), CVC3::ArithProofRules::rightMinusLeft(), CVC3::Expr::setRewriteNormal(), CVC3::Theory::theoryOf(), TRACE, CVC3::Theory::transitivityRule(), and CVC3::Theory::typePred().

Referenced by update().

void TheoryArith3::setup ( const Expr e) [virtual]

Set up the term e for call-backs when e or its children change.

setup is called once for each expression associated with the theory. It is typically used to setup theory-specific data for an expression and to add call-back information for use with update.

See also:
update

Implements CVC3::TheoryArith.

Definition at line 2512 of file theory_arith3.cpp.

References CVC3::Expr::addToNotify(), CVC3::Expr::arity(), DebugAssert, CVC3::Expr::getKind(), CVC3::int2string(), CVC3::IS_INTEGER, CVC3::isDarkShadow(), CVC3::Expr::isEq(), CVC3::isGrayShadow(), CVC3::isLE(), CVC3::isLT(), CVC3::Expr::isNot(), CVC3::isRational(), CVC3::Expr::isTerm(), CVC3::Expr::toString(), and TRACE.

Referenced by setupRec().

void TheoryArith3::update ( const Theorem e,
const Expr d 
) [virtual]

Notify a theory of a new equality.

update is a call-back used by the notify mechanism of the core theory. It works as follows. When an equation t1 = t2 makes it into the core framework, the two find equivalence classes for t1 and t2 are merged. The result is that t2 is the new equivalence class representative and t1 is no longer an equivalence class representative. When this happens, the notify list of t1 is traversed. Notify list entries consist of a theory and an expression d. For each entry (i,d), i->update(e, d) is called, where e is the theorem corresponding to the equality t1=t2.

To add the entry (i,d) to a term t1's notify list, a call must be made to t1.addNotify(i,d). This is typically done in setup.

See also:
setup

Implements CVC3::TheoryArith.

Definition at line 2534 of file theory_arith3.cpp.

References CVC3::Theory::assertEqualities(), CVC3::TheoryArith::canonSimp(), DebugAssert, CVC3::Theory::enqueueFact(), CVC3::Theory::find(), CVC3::Theory::getCommonRules(), CVC3::Theorem::getExpr(), CVC3::Theorem::getLHS(), CVC3::Theorem::getRHS(), CVC3::Expr::hasFind(), IF_DEBUG, CVC3::Theory::iffMP(), CVC3::Theory::inconsistent(), CVC3::isIneq(), CVC3::Theory::leavesAreSimp(), rewrite(), CVC3::Theory::substitutivityRule(), CVC3::Theory::symmetryRule(), CVC3::Expr::toString(), TRACE, CVC3::Theory::transitivityRule(), and CVC3::Theory::trueExpr().

Theorem TheoryArith3::solve ( const Theorem e) [virtual]

An optional solver.

The solve method can be used to implement a Shostak-style solver. Since solvers do not in general combine, the following technique is used. One theory is designated as the primary solver (in our case, it is the theory of arithmetic). For each equation that enters the core framework, the primary solver is called to ensure that the equation is in solved form with respect to the primary theory.

After the primary solver, the solver for the theory associated with the equation is called. This solver can do whatever it likes, as long as the result is still in solved form with respect to the primary solver. This is a slight generalization of what is described in my (Clark)'s PhD thesis.

Implements CVC3::TheoryArith.

Definition at line 2569 of file theory_arith3.cpp.

References DebugAssert, doSolve(), CVC3::Theorem::getLHS(), CVC3::Theorem::getRHS(), CVC3::Expr::getType(), CVC3::TheoryArith::intType(), isInteger(), CVC3::Theory::isLeaf(), CVC3::Theory::isLeafIn(), CVC3::Theorem::isRewrite(), CVC3::Expr::isTerm(), and CVC3::Theory::symmetryRule().

void TheoryArith3::checkAssertEqInvariant ( const Theorem e) [virtual]
void TheoryArith3::checkType ( const Expr e) [virtual]
Cardinality TheoryArith3::finiteTypeInfo ( Expr e,
Unsigned n,
bool  enumerate,
bool  computeSize 
) [virtual]

Compute information related to finiteness of types.

Used by the TypeComputer defined in TheoryCore (theories should not call this funtion directly -- they should use the methods in Type instead). Each theory should implement this if it contains any types that could be non-infinite.

1. Returns Cardinality of the type (finite, infinite, or unknown) 2. If cardinality = finite and enumerate is true, sets e to the nth element of the type if it can sets e to NULL if n is out of bounds or if unable to compute nth element 3. If cardinality = finite and computeSize is true, sets n to the size of the type if it can sets n to 0 otherwise

Implements CVC3::TheoryArith.

Definition at line 2719 of file theory_arith3.cpp.

References CVC3::CARD_FINITE, CVC3::CARD_INFINITE, CVC3::Expr::getKind(), CVC3::Expr::getRational(), CVC3::Rational::getUnsigned(), CVC3::TheoryArith::rat(), and CVC3::SUBRANGE.

void TheoryArith3::computeType ( const Expr e) [virtual]
Type TheoryArith3::computeBaseType ( const Type tp) [virtual]

Compute the base type of the top-level operator of an arbitrary type.

Implements CVC3::TheoryArith.

Definition at line 2830 of file theory_arith3.cpp.

References DebugAssert, CVC3::Type::getExpr(), CVC3::Expr::getKind(), IF_DEBUG, CVC3::INT, CVC3::REAL, CVC3::TheoryArith::realType(), CVC3::SUBRANGE, and CVC3::Type::toString().

void TheoryArith3::computeModelTerm ( const Expr e,
std::vector< Expr > &  v 
) [virtual]

Add variables from 'e' to 'v' for constructing a concrete model.

If e is already of primitive type, do NOT add it to v.

Implements CVC3::TheoryArith.

Definition at line 2597 of file theory_arith3.cpp.

References CVC3::Expr::begin(), CVC3::DIVIDE, CVC3::Expr::end(), CVC3::Theory::findExpr(), CVC3::Expr::getKind(), CVC3::MULT, CVC3::PLUS, CVC3::POW, RATIONAL_EXPR, CVC3::Expr::toString(), and TRACE.

Expr TheoryArith3::computeTypePred ( const Type t,
const Expr e 
) [virtual]

Theory specific computation of the subtyping predicate for type t applied to the expression e.

By default returns true. Each theory needs to compute subtype predicates for the types associated with it. So, for example, the theory of records will take a record type [# f1: T1, f2: T2 #] and an expression e and will return the subtyping predicate for e, namely: computeTypePred(T1, e.f1) AND computeTypePred(T2, e.f2)

Implements CVC3::TheoryArith.

Definition at line 2625 of file theory_arith3.cpp.

References CVC3::andExpr(), CVC3::Expr::getEM(), CVC3::Type::getExpr(), CVC3::Expr::getKind(), CVC3::INT, CVC3::IS_INTEGER, CVC3::leExpr(), CVC3::SUBRANGE, and CVC3::ExprManager::trueExpr().

Expr TheoryArith3::computeTCC ( const Expr e) [virtual]

Compute and cache the TCC of e.

Parameters:
eis an expression (term or formula). This function computes the TCC of e which is true iff the expression is defined.

This function computes the TCC or predicate of the top-level operator of e, and recurses into children using getTCC(), if necessary.

The default implementation is to compute TCCs recursively for all children, and return their conjunction.

Implements CVC3::TheoryArith.

Definition at line 2839 of file theory_arith3.cpp.

References CVC3::Expr::andExpr(), CVC3::Expr::arity(), CVC3::Theory::computeTCC(), DebugAssert, CVC3::DIVIDE, CVC3::Expr::getKind(), and CVC3::TheoryArith::rat().

ExprStream & TheoryArith3::print ( ExprStream os,
const Expr e 
) [virtual]

Theory-specific pretty-printing.

By default, print the top node in AST, and resume pretty-printing the children. The same call e.print(os) can be used in DP-specific printers to use AST printing for the given node. In fact, it is strongly recommended to add e.print(os) as the default for all the cases/kinds that are not handled by the particular pretty-printer.

Implements CVC3::TheoryArith.

Definition at line 2966 of file theory_arith3.cpp.

References CVC3::Expr::arity(), CVC3::Expr::begin(), CVC3::DARK_SHADOW, CVC3::DIVIDE, CVC3::Expr::end(), CVC3::GE, CVC3::Expr::getKind(), CVC3::Expr::getRational(), CVC3::GRAY_SHADOW, CVC3::GT, CVC3::INT, CVC3::IS_INTEGER, CVC3::isInt(), isInteger(), CVC3::ExprStream::lang(), CVC3::LE, CVC3::LISP_LANG, CVC3::LT, CVC3::MINUS, CVC3::MULT, CVC3::NEGINF, CVC3::PLUS, CVC3::POSINF, CVC3::POW, CVC3::PRESENTATION_LANG, CVC3::Expr::print(), CVC3::Expr::printAST(), CVC3::TheoryArith::printRational(), CVC3::push(), RATIONAL_EXPR, CVC3::REAL, CVC3::REAL_CONST, CVC3::SIMPLIFY_LANG, CVC3::SMTLIB_LANG, CVC3::SMTLIB_V2_LANG, CVC3::space(), CVC3::SUBRANGE, CVC3::TPTP_LANG, and CVC3::UMINUS.

Expr TheoryArith3::parseExprOp ( const Expr e) [virtual]
Rational TheoryArith3::currentMaxCoefficient ( Expr  var) [private]

Returns the current maximal coefficient of the variable.

Parameters:
varthe variable.

Definition at line 1571 of file theory_arith3.cpp.

References CVC3::CDMap< Key, Data, HashFcn >::end(), and CVC3::CDMap< Key, Data, HashFcn >::find().

void TheoryArith3::fixCurrentMaxCoefficient ( Expr  variable,
Rational  max 
) [private]

Fixes the current max coefficient to be used in the ordering. If the maximal coefficient changes in the future, it will not be used in the ordering.

Parameters:
variablethe variable
maxthe value to set it to

Definition at line 1605 of file theory_arith3.cpp.

References CVC3::max().

void TheoryArith3::selectSmallestByCoefficient ( std::vector< Expr input,
std::vector< Expr > &  output 
) [private]

Among given input variables, select the smallest ones with respect to the coefficients.

Definition at line 1609 of file theory_arith3.cpp.


Friends And Related Function Documentation

std::ostream& operator<< ( std::ostream &  os,
const FreeConst fc 
) [friend]

Printing.

Definition at line 44 of file theory_arith3.cpp.

std::ostream& operator<< ( std::ostream &  os,
const Ineq ineq 
) [friend]

Printing.

Definition at line 54 of file theory_arith3.cpp.


Member Data Documentation

Definition at line 30 of file theory_arith3.h.

Referenced by assertFact(), checkSat(), and TheoryArith3().

Definition at line 31 of file theory_arith3.h.

Referenced by checkSat().

Definition at line 33 of file theory_arith3.h.

Referenced by assertFact(), checkSat(), computeModelBasic(), and refineCounterExample().

Database of inequalities with a variable isolated on the right.

Definition at line 76 of file theory_arith3.h.

Referenced by findBounds(), processFiniteIntervals(), and ~TheoryArith3().

Database of inequalities with a variable isolated on the left.

Definition at line 79 of file theory_arith3.h.

Referenced by findBounds(), processFiniteIntervals(), and ~TheoryArith3().

Mapping of inequalities to the largest/smallest free constant.

The Expr is the original inequality with the free constant removed and inequality converted to non-strict (for indexing purposes). I.e. ax<c+t becomes ax<=t. This inequality is mapped to a pair<c,strict>, the smallest (largest for c+t<ax) constant among inequalities with the same 'a', 'x', and 't', and a boolean flag indicating whether the strongest inequality is strict.

Definition at line 89 of file theory_arith3.h.

Buffer of input inequalities.

Definition at line 92 of file theory_arith3.h.

Referenced by assertFact(), checkSat(), and TheoryArith3().

Buffer index of the next unprocessed inequality.

Definition at line 94 of file theory_arith3.h.

Referenced by assertFact(), checkSat(), and TheoryArith3().

const int* CVC3::TheoryArith3::d_bufferThres [private]

Threshold when the buffer must be processed.

Definition at line 96 of file theory_arith3.h.

Referenced by assertFact().

Mapping of a variable to the number of inequalities where the variable would be isolated on the right.

Definition at line 102 of file theory_arith3.h.

Mapping of a variable to the number of inequalities where the variable would be isolated on the left.

Definition at line 106 of file theory_arith3.h.

Set of shared terms (for counterexample generation)

Definition at line 109 of file theory_arith3.h.

Referenced by addSharedTerm(), and refineCounterExample().

Set of shared integer variables (i-leaves)

Definition at line 112 of file theory_arith3.h.

Definition at line 132 of file theory_arith3.h.

Referenced by assignVariables().

Map from variables to the maximal (by absolute value) of one of it's coefficients

Definition at line 324 of file theory_arith3.h.

Definition at line 325 of file theory_arith3.h.

Map from variables to the fixed value of one of it's coefficients

Definition at line 328 of file theory_arith3.h.


The documentation for this class was generated from the following files: