1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
|
/********************* */
/*! \file theory_builtin.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds, Mudathir Mohamed, Morgan Deters
** This file is part of the CVC4 project.
** Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
** in the top-level source directory and their institutional affiliations.
** All rights reserved. See the file COPYING in the top-level source
** directory for licensing information.\endverbatim
**
** \brief Implementation of the builtin theory.
**
** Implementation of the builtin theory.
**/
#include "theory/builtin/theory_builtin.h"
#include "expr/kind.h"
#include "expr/proof_node_manager.h"
#include "theory/builtin/theory_builtin_rewriter.h"
#include "theory/theory_model.h"
#include "theory/valuation.h"
namespace cvc5 {
namespace theory {
namespace builtin {
TheoryBuiltin::TheoryBuiltin(context::Context* c,
context::UserContext* u,
OutputChannel& out,
Valuation valuation,
const LogicInfo& logicInfo,
ProofNodeManager* pnm)
: Theory(THEORY_BUILTIN, c, u, out, valuation, logicInfo, pnm)
{
}
TheoryRewriter* TheoryBuiltin::getTheoryRewriter() { return &d_rewriter; }
ProofRuleChecker* TheoryBuiltin::getProofChecker() { return &d_checker; }
std::string TheoryBuiltin::identify() const
{
return std::string("TheoryBuiltin");
}
void TheoryBuiltin::finishInit()
{
// Notice that choice is an unevaluated kind belonging to this theory.
// However, it should be set as an unevaluated kind where it is used, e.g.
// in the quantifiers theory. This ensures that a logic like QF_LIA, which
// includes the builtin theory, does not mark any kinds as unevaluated and
// hence it is easy to check for illegal eliminations via TheoryModel
// (see TheoryModel::isLegalElimination) since there are no unevaluated kinds
// present.
}
} // namespace builtin
} // namespace theory
} // namespace cvc5
|
