CVC3  2.4.1
Classes | Public Member Functions | Private Types | Private Member Functions | Private Attributes | List of all members
CVC3::TheoryUF Class Reference

This theory handles uninterpreted functions. More...

#include <theory_uf.h>

Inheritance diagram for CVC3::TheoryUF:
CVC3::Theory

Classes

struct  TCMapPair
 

Public Member Functions

 TheoryUF (TheoryCore *core)
 
 ~TheoryUF ()
 
UFProofRulescreateProofRules ()
 
void addSharedTerm (const Expr &e)
 Notify theory of a new shared term. More...
 
void assertFact (const Theorem &e)
 Assert a new fact to the decision procedure. More...
 
void checkSat (bool fullEffort)
 Check for satisfiability in the theory. More...
 
Theorem rewrite (const Expr &e)
 Theory-specific rewrite rules. More...
 
void setup (const Expr &e)
 Set up the term e for call-backs when e or its children change. More...
 
void update (const Theorem &e, const Expr &d)
 Notify a theory of a new equality. More...
 
void checkType (const Expr &e)
 Check that e is a valid Type expr. More...
 
Cardinality finiteTypeInfo (Expr &e, Unsigned &n, bool enumerate, bool computeSize)
 Compute information related to finiteness of types. More...
 
void computeType (const Expr &e)
 Compute and store the type of e. More...
 
Type computeBaseType (const Type &t)
 Compute the base type of the top-level operator of an arbitrary type. More...
 
void computeModelTerm (const Expr &e, std::vector< Expr > &v)
 Add variables from 'e' to 'v' for constructing a concrete model. More...
 
void computeModel (const Expr &e, std::vector< Expr > &vars)
 Compute the value of a compound variable from the more primitive ones. More...
 
Expr computeTCC (const Expr &e)
 Compute and cache the TCC of e. More...
 
virtual Expr parseExprOp (const Expr &e)
 Theory-specific parsing implemented by the DP. More...
 
ExprStreamprint (ExprStream &os, const Expr &e)
 Theory-specific pretty-printing. More...
 
Expr lambdaExpr (const std::vector< Expr > &vars, const Expr &body)
 Create a new LAMBDA-abstraction. More...
 
Expr transClosureExpr (const std::string &name, const Expr &e1, const Expr &e2)
 Create a transitive closure expression. More...
 
- Public Member Functions inherited from CVC3::Theory
 Theory (TheoryCore *theoryCore, const std::string &name)
 Whether theory has been used (for smtlib translator) More...
 
virtual ~Theory (void)
 Destructor. More...
 
ExprManagergetEM ()
 Access to ExprManager. More...
 
TheoryCoretheoryCore ()
 Get a pointer to theoryCore. More...
 
CommonProofRulesgetCommonRules ()
 Get a pointer to common proof rules. More...
 
const std::string & getName () const
 Get the name of the theory (for debugging purposes) More...
 
virtual void setUsed ()
 Set the "used" flag on this theory (for smtlib translator) More...
 
virtual bool theoryUsed ()
 Get whether theory has been used (for smtlib translator) More...
 
virtual Theorem theoryPreprocess (const Expr &e)
 Theory-specific preprocessing. More...
 
virtual Theorem solve (const Theorem &e)
 An optional solver. More...
 
virtual void checkAssertEqInvariant (const Theorem &e)
 A debug check used by the primary solver. More...
 
virtual Theorem simplifyOp (const Expr &e)
 Recursive simplification step. More...
 
virtual Expr computeTypePred (const Type &t, const Expr &e)
 Theory specific computation of the subtyping predicate for type t applied to the expression e. More...
 
virtual void refineCounterExample ()
 Process disequalities from the arrangement for model generation. More...
 
virtual void computeModelBasic (const std::vector< Expr > &v)
 Assign concrete values to basic-type variables in v. More...
 
virtual void assertTypePred (const Expr &e, const Theorem &pred)
 Receives all the type predicates for the types of the given theory. More...
 
virtual Theorem rewriteAtomic (const Expr &e)
 Theory-specific rewrites for atomic formulas. More...
 
virtual void notifyInconsistent (const Theorem &thm)
 Notification of conflict. More...
 
virtual void registerAtom (const Expr &e, const Theorem &thm)
 
virtual void registerAtom (const Expr &e)
 Theory-specific registration of atoms. More...
 
virtual bool inconsistent ()
 Check if the current context is inconsistent. More...
 
virtual void setInconsistent (const Theorem &e)
 Make the context inconsistent; The formula proved by e must FALSE. More...
 
virtual void setIncomplete (const std::string &reason)
 Mark the current decision branch as possibly incomplete. More...
 
virtual Theorem simplify (const Expr &e)
 Simplify a term e and return a Theorem(e==e') More...
 
Expr simplifyExpr (const Expr &e)
 Simplify a term e w.r.t. the current context. More...
 
virtual void enqueueFact (const Theorem &e)
 Submit a derived fact to the core from a decision procedure. More...
 
virtual void enqueueSE (const Theorem &e)
 Check if the current context is inconsistent. More...
 
virtual void assertEqualities (const Theorem &e)
 Handle new equalities (usually asserted through addFact) More...
 
virtual Expr parseExpr (const Expr &e)
 Parse the generic expression. More...
 
virtual void assignValue (const Expr &t, const Expr &val)
 Assigns t a concrete value val. Used in model generation. More...
 
virtual void assignValue (const Theorem &thm)
 Record a derived assignment to a variable (LHS). More...
 
void registerKinds (Theory *theory, std::vector< int > &kinds)
 Register new kinds with the given theory. More...
 
void unregisterKinds (Theory *theory, std::vector< int > &kinds)
 Unregister kinds for a theory. More...
 
void registerTheory (Theory *theory, std::vector< int > &kinds, bool hasSolver=false)
 Register a new theory. More...
 
void unregisterTheory (Theory *theory, std::vector< int > &kinds, bool hasSolver)
 Unregister a theory. More...
 
int getNumTheories ()
 Return the number of registered theories. More...
 
bool hasTheory (int kind)
 Test whether a kind maps to any theory. More...
 
TheorytheoryOf (int kind)
 Return the theory associated with a kind. More...
 
TheorytheoryOf (const Type &e)
 Return the theory associated with a type. More...
 
TheorytheoryOf (const Expr &e)
 Return the theory associated with an Expr. More...
 
Theorem find (const Expr &e)
 Return the theorem that e is equal to its find. More...
 
const TheoremfindRef (const Expr &e)
 Return the find as a reference: expr must have a find. More...
 
Theorem findReduce (const Expr &e)
 Return find-reduced version of e. More...
 
bool findReduced (const Expr &e)
 Return true iff e is find-reduced. More...
 
Expr findExpr (const Expr &e)
 Return the find of e, or e if it has no find. More...
 
Expr getTCC (const Expr &e)
 Compute the TCC of e, or the subtyping predicate, if e is a type. More...
 
Type getBaseType (const Expr &e)
 Compute (or look up in cache) the base type of e and return the result. More...
 
Type getBaseType (const Type &tp)
 Compute the base type from an arbitrary type. More...
 
Expr getTypePred (const Type &t, const Expr &e)
 Calls the correct theory to compute a type predicate. More...
 
Theorem updateHelper (const Expr &e)
 Update the children of the term e. More...
 
void setupCC (const Expr &e)
 Setup a term for congruence closure (must have sig and rep attributes) More...
 
void updateCC (const Theorem &e, const Expr &d)
 Update a term w.r.t. congruence closure (must be setup with setupCC()) More...
 
Theorem rewriteCC (const Expr &e)
 Rewrite a term w.r.t. congruence closure (must be setup with setupCC()) More...
 
void getModelTerm (const Expr &e, std::vector< Expr > &v)
 Calls the correct theory to get all of the terms that need to be assigned values in the concrete model. More...
 
Theorem getModelValue (const Expr &e)
 Fetch the concrete assignment to the variable during model generation. More...
 
void addSplitter (const Expr &e, int priority=0)
 Suggest a splitter to the SearchEngine. More...
 
void addGlobalLemma (const Theorem &thm, int priority=0)
 Add a global lemma. More...
 
bool isLeaf (const Expr &e)
 Test if e is an i-leaf term for the current theory. More...
 
bool isLeafIn (const Expr &e1, const Expr &e2)
 Test if e1 is an i-leaf in e2. More...
 
bool leavesAreSimp (const Expr &e)
 Test if all i-leaves of e are simplified. More...
 
Type boolType ()
 Return BOOLEAN type. More...
 
const ExprfalseExpr ()
 Return FALSE Expr. More...
 
const ExprtrueExpr ()
 Return TRUE Expr. More...
 
Expr newVar (const std::string &name, const Type &type)
 Create a new variable given its name and type. More...
 
Expr newVar (const std::string &name, const Type &type, const Expr &def)
 Create a new named expression given its name, type, and definition. More...
 
Op newFunction (const std::string &name, const Type &type, bool computeTransClosure)
 Create a new uninterpreted function. More...
 
Op lookupFunction (const std::string &name, Type *type)
 Look up a function by name. More...
 
Op newFunction (const std::string &name, const Type &type, const Expr &def)
 Create a new defined function. More...
 
Expr addBoundVar (const std::string &name, const Type &type)
 Create and add a new bound variable to the stack, for parseExprOp(). More...
 
Expr addBoundVar (const std::string &name, const Type &type, const Expr &def)
 Create and add a new bound named def to the stack, for parseExprOp(). More...
 
Expr lookupVar (const std::string &name, Type *type)
 Lookup variable and return it and its type. Return NULL Expr if it doesn't exist yet. More...
 
Type newTypeExpr (const std::string &name)
 Create a new uninterpreted type with the given name. More...
 
Type lookupTypeExpr (const std::string &name)
 Lookup type by name. Return Null if no such type exists. More...
 
Type newTypeExpr (const std::string &name, const Type &def)
 Create a new type abbreviation with the given name. More...
 
Type newSubtypeExpr (const Expr &pred, const Expr &witness)
 Create a new subtype expression. More...
 
Expr resolveID (const std::string &name)
 Resolve an identifier, for use in parseExprOp() More...
 
void installID (const std::string &name, const Expr &e)
 Install name as a new identifier associated with Expr e. More...
 
Theorem typePred (const Expr &e)
 Return BOOLEAN type. More...
 
Theorem reflexivityRule (const Expr &a)
 ==> a == a More...
 
Theorem symmetryRule (const Theorem &a1_eq_a2)
 a1 == a2 ==> a2 == a1 More...
 
Theorem transitivityRule (const Theorem &a1_eq_a2, const Theorem &a2_eq_a3)
 (a1 == a2) & (a2 == a3) ==> (a1 == a3) More...
 
Theorem substitutivityRule (const Op &op, const std::vector< Theorem > &thms)
 (c_1 == d_1) & ... & (c_n == d_n) ==> op(c_1,...,c_n) == op(d_1,...,d_n) More...
 
Theorem substitutivityRule (const Expr &e, const Theorem &t)
 Special case for unary operators. More...
 
Theorem substitutivityRule (const Expr &e, const Theorem &t1, const Theorem &t2)
 Special case for binary operators. More...
 
Theorem substitutivityRule (const Expr &e, const std::vector< unsigned > &changed, const std::vector< Theorem > &thms)
 Optimized: only positions which changed are included. More...
 
Theorem substitutivityRule (const Expr &e, int changed, const Theorem &thm)
 Optimized: only a single position changed. More...
 
Theorem iffMP (const Theorem &e1, const Theorem &e1_iff_e2)
 e1 AND (e1 IFF e2) ==> e2 More...
 
Theorem rewriteAnd (const Expr &e)
 ==> AND(e1,e2) IFF [simplified expr] More...
 
Theorem rewriteOr (const Expr &e)
 ==> OR(e1,...,en) IFF [simplified expr] More...
 
Theorem rewriteIte (const Expr &e)
 Derived rule for rewriting ITE. More...
 
Theorem renameExpr (const Expr &e)
 Derived rule to create a new name for an expression. More...
 

Private Types

typedef struct CVC3::TheoryUF::TCMapPair TCMapPair
 

Private Member Functions

void printSmtLibShared (ExprStream &os, const Expr &e)
 

Private Attributes

UFProofRulesd_rules
 
const bool & d_applicationsInModel
 Flag to include function applications to the concrete model. More...
 
ExprMap< TCMapPair * > d_transClosureMap
 
CDList< Exprd_funApplications
 Backtracking list of function applications. More...
 
CDO< size_t > d_funApplicationsIdx
 Pointer to the last unprocessed element (for lambda expansions) More...
 
CDO< size_t > d_sharedIdx1
 The pointers to the last unprocessed shared pair. More...
 
CDO< size_t > d_sharedIdx2
 
CDMap< Expr, bool > d_sharedTermsMap
 The set of all shared terms. More...
 

Additional Inherited Members

- Protected Attributes inherited from CVC3::Theory
bool d_theoryUsed
 

Detailed Description

This theory handles uninterpreted functions.

Author: Clark Barrett

Created: Sat Feb 8 14:51:19 2003

Definition at line 48 of file theory_uf.h.

Member Typedef Documentation

Constructor & Destructor Documentation

TheoryUF::TheoryUF ( TheoryCore core)
TheoryUF::~TheoryUF ( )

Definition at line 71 of file theory_uf.cpp.

References d_rules.

Member Function Documentation

UFProofRules * TheoryUF::createProofRules ( )

Definition at line 41 of file uf_theorem_producer.cpp.

Referenced by TheoryUF().

void TheoryUF::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)

Reimplemented from CVC3::Theory.

Definition at line 1139 of file theory_uf.cpp.

References d_sharedTermsMap.

Referenced by setup().

void TheoryUF::assertFact ( const Theorem e)
virtual
void TheoryUF::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::Theory.

Definition at line 156 of file theory_uf.cpp.

References CVC3::Theory::addSplitter(), CVC3::UFProofRules::applyLambda(), CVC3::Expr::arity(), d_funApplications, d_funApplicationsIdx, d_rules, d_sharedIdx1, d_sharedIdx2, d_sharedTermsMap, CVC3::Theory::enqueueFact(), CVC3::Expr::eqExpr(), CVC3::Theory::find(), CVC3::Op::getExpr(), CVC3::Expr::getOp(), CVC3::Expr::getOpKind(), CVC3::Theorem::getRHS(), CVC3::Expr::getSig(), IF_DEBUG, CVC3::Expr::isLambda(), CVC3::Theorem::isNull(), CVC3::Theory::simplify(), CVC3::CDList< T >::size(), CVC3::Expr::toString(), TRACE, and UFUNC.

Theorem TheoryUF::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.

Reimplemented from CVC3::Theory.

Definition at line 211 of file theory_uf.cpp.

References CVC3::UFProofRules::applyLambda(), d_rules, CVC3::Expr::getKind(), CVC3::Expr::getOpExpr(), CVC3::Theorem::getRHS(), CVC3::Expr::getType(), IF_DEBUG, CVC3::Expr::isApply(), CVC3::Type::isBool(), LAMBDA, CVC3::Theory::reflexivityRule(), CVC3::Theory::rewriteCC(), CVC3::Expr::setRewriteNormal(), CVC3::Theory::simplify(), and CVC3::Theory::transitivityRule().

void TheoryUF::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

Reimplemented from CVC3::Theory.

Definition at line 236 of file theory_uf.cpp.

References addSharedTerm(), APPLY, CVC3::Type::card(), CVC3::CARD_INFINITE, d_funApplications, CVC3::Expr::getKind(), CVC3::Expr::getType(), CVC3::Expr::isTerm(), CVC3::CDList< T >::push_back(), CVC3::Theory::setupCC(), CVC3::Theory::theoryOf(), and TRACE.

void TheoryUF::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

Reimplemented from CVC3::Theory.

Definition at line 257 of file theory_uf.cpp.

References CVC3::Expr::addToNotify(), CVC3::Expr::arity(), CVC3::Expr::computeTransClosure(), d_rules, CVC3::Theory::enqueueFact(), CVC3::Theory::find(), CVC3::Theory::findExpr(), CVC3::Theory::getCommonRules(), CVC3::Expr::getOpExpr(), CVC3::Expr::getOpKind(), CVC3::Expr::getRep(), CVC3::Theorem::getRHS(), CVC3::Expr::getSig(), CVC3::Expr::getType(), CVC3::CommonProofRules::iffTrueElim(), CVC3::Expr::isApply(), CVC3::Type::isBool(), CVC3::Theorem::isNull(), CVC3::Expr::isTrue(), CVC3::UFProofRules::relToClosure(), CVC3::Expr::setRep(), CVC3::Expr::setSig(), CVC3::Theory::symmetryRule(), CVC3::TRANS_CLOSURE, CVC3::Theory::transitivityRule(), and CVC3::Theory::updateHelper().

void TheoryUF::checkType ( const Expr e)
virtual
Cardinality TheoryUF::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

Reimplemented from CVC3::Theory.

Definition at line 368 of file theory_uf.cpp.

References ARROW, CVC3::Expr::begin(), CVC3::CARD_FINITE, CVC3::CARD_INFINITE, CVC3::CARD_UNKNOWN, CVC3::Expr::end(), CVC3::Theory::finiteTypeInfo(), CVC3::Expr::getKind(), and CVC3::Theory::theoryOf().

void TheoryUF::computeType ( const Expr e)
virtual

Compute and store the type of e.

Parameters
eis the expression whose type is computed.

This function computes the type of the top-level operator of e, and recurses into children using getType(), if necessary.

Reimplemented from CVC3::Theory.

Definition at line 417 of file theory_uf.cpp.

References APPLY, CVC3::Type::arity(), CVC3::Theory::computeType(), DebugAssert, CVC3::Type::funType(), CVC3::Expr::getBody(), CVC3::Expr::getKind(), CVC3::Expr::getName(), CVC3::Expr::getType(), CVC3::Expr::getVars(), CVC3::Type::isFunction(), CVC3::Expr::isSymbol(), LAMBDA, CVC3::Theory::resolveID(), CVC3::Expr::setType(), CVC3::Theory::theoryOf(), CVC3::Type::toString(), CVC3::Expr::toString(), and CVC3::TRANS_CLOSURE.

Type TheoryUF::computeBaseType ( const Type tp)
virtual

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

Reimplemented from CVC3::Theory.

Definition at line 471 of file theory_uf.cpp.

References CVC3::Expr::arity(), ARROW, CVC3::Expr::begin(), DebugAssert, CVC3::Expr::end(), CVC3::Theory::getBaseType(), CVC3::Type::getExpr(), CVC3::Expr::getKind(), CVC3::Expr::getOp(), CVC3::Type::toString(), and TYPEDECL.

void TheoryUF::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.

Reimplemented from CVC3::Theory.

Definition at line 491 of file theory_uf.cpp.

References CVC3::CDList< T >::begin(), d_funApplications, and CVC3::CDList< T >::end().

void TheoryUF::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.

Reimplemented from CVC3::Theory.

Definition at line 509 of file theory_uf.cpp.

References CVC3::andExpr(), CVC3::Theory::assignValue(), CVC3::CDList< T >::begin(), CVC3::ExprHashMap< Data >::begin(), d_applicationsInModel, d_funApplications, DebugAssert, CVC3::CDList< T >::end(), CVC3::ExprHashMap< Data >::end(), CVC3::Theory::getEM(), CVC3::Theorem::getLHS(), CVC3::Theory::getModelValue(), CVC3::Theorem::getRHS(), CVC3::Expr::getType(), CVC3::int2string(), CVC3::Expr::iteExpr(), lambdaExpr(), CVC3::ExprManager::newBoundVarExpr(), CVC3::Theory::reflexivityRule(), CVC3::Expr::setType(), CVC3::ExprHashMap< Data >::size(), CVC3::Theory::substitutivityRule(), CVC3::Theory::symmetryRule(), CVC3::Expr::toString(), and CVC3::Theory::transitivityRule().

Expr TheoryUF::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.

Reimplemented from CVC3::Theory.

Definition at line 591 of file theory_uf.cpp.

References CVC3::andExpr(), APPLY, CVC3::Expr::arity(), CVC3::Theory::computeTCC(), DebugAssert, CVC3::Op::getExpr(), CVC3::Expr::getKids(), CVC3::Expr::getKind(), CVC3::Expr::getOp(), CVC3::Theorem::getRHS(), CVC3::Theory::getTCC(), CVC3::Theory::getTypePred(), CVC3::Expr::isApply(), LAMBDA, lambdaExpr(), LETDECL, CVC3::Expr::mkOp(), CVC3::Theory::rewriteAnd(), CVC3::Expr::toString(), and CVC3::Theory::trueExpr().

Expr TheoryUF::parseExprOp ( const Expr e)
virtual
ExprStream & TheoryUF::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.

Reimplemented from CVC3::Theory.

Definition at line 700 of file theory_uf.cpp.

References APPLY, CVC3::Expr::arity(), ARROW, CVC3::Expr::begin(), BOOLEAN, CVC3::Theory::d_theoryUsed, CVC3::ExprStream::dagFlag(), DebugAssert, CVC3::Expr::end(), CVC3::Expr::getBody(), CVC3::Theory::getEM(), CVC3::Op::getExpr(), CVC3::Expr::getKind(), CVC3::Expr::getName(), CVC3::Expr::getOp(), CVC3::Expr::getOpExpr(), CVC3::Expr::getString(), CVC3::Expr::getVars(), CVC3::Expr::isApply(), CVC3::Expr::isLambda(), CVC3::Expr::isSymbol(), LAMBDA, CVC3::ExprStream::lang(), CVC3::LISP_LANG, CVC3::OLD_ARROW, CVC3::pop(), CVC3::popdag(), CVC3::PRESENTATION_LANG, CVC3::Expr::print(), CVC3::Expr::printAST(), printSmtLibShared(), CVC3::push(), CVC3::pushdag(), CVC3::SIMPLIFY_LANG, CVC3::SMTLIB_LANG, CVC3::SMTLIB_V2_LANG, CVC3::space(), CVC3::SPASS_LANG, CVC3::to_lower(), CVC3::TPTP_LANG, CVC3::TRANS_CLOSURE, TYPEDECL, and UFUNC.

Expr TheoryUF::lambdaExpr ( const std::vector< Expr > &  vars,
const Expr body 
)

Create a new LAMBDA-abstraction.

Definition at line 1129 of file theory_uf.cpp.

References CVC3::Theory::getEM(), LAMBDA, and CVC3::ExprManager::newClosureExpr().

Referenced by computeModel(), computeTCC(), and parseExprOp().

Expr TheoryUF::transClosureExpr ( const std::string &  name,
const Expr e1,
const Expr e2 
)

Create a transitive closure expression.

Definition at line 1134 of file theory_uf.cpp.

References CVC3::Theory::getEM(), and CVC3::TRANS_CLOSURE.

Referenced by parseExprOp().

void TheoryUF::printSmtLibShared ( ExprStream os,
const Expr e 
)
private

Member Data Documentation

UFProofRules* CVC3::TheoryUF::d_rules
private

Definition at line 49 of file theory_uf.h.

Referenced by assertFact(), checkSat(), rewrite(), TheoryUF(), update(), and ~TheoryUF().

const bool& CVC3::TheoryUF::d_applicationsInModel
private

Flag to include function applications to the concrete model.

Definition at line 51 of file theory_uf.h.

Referenced by computeModel().

ExprMap<TCMapPair*> CVC3::TheoryUF::d_transClosureMap
private

Definition at line 59 of file theory_uf.h.

Referenced by assertFact().

CDList<Expr> CVC3::TheoryUF::d_funApplications
private

Backtracking list of function applications.

Used for building concrete models and beta-reducing lambda-expressions.

Definition at line 64 of file theory_uf.h.

Referenced by checkSat(), computeModel(), computeModelTerm(), and setup().

CDO<size_t> CVC3::TheoryUF::d_funApplicationsIdx
private

Pointer to the last unprocessed element (for lambda expansions)

Definition at line 66 of file theory_uf.h.

Referenced by checkSat().

CDO<size_t> CVC3::TheoryUF::d_sharedIdx1
private

The pointers to the last unprocessed shared pair.

Definition at line 68 of file theory_uf.h.

Referenced by checkSat().

CDO<size_t> CVC3::TheoryUF::d_sharedIdx2
private

Definition at line 68 of file theory_uf.h.

Referenced by checkSat().

CDMap<Expr, bool> CVC3::TheoryUF::d_sharedTermsMap
private

The set of all shared terms.

Definition at line 70 of file theory_uf.h.

Referenced by addSharedTerm(), and checkSat().


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