blob: 7ec59485922430a6ef020601013b1a1f12bbc338 (
plain)
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
|
/********************* */
/*! \file skolemization_manager.h
** \verbatim
** Top contributors (to current version):
** Guy Katz
** This file is part of the CVC4 project.
** Copyright (c) 2009-2017 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
**
** [[ Add lengthier description here ]]
** \todo document this file
**/
#include "cvc4_private.h"
#ifndef __CVC4__SKOLEMIZATION_MANAGER_H
#define __CVC4__SKOLEMIZATION_MANAGER_H
#include <iostream>
#include <unordered_map>
#include "proof/proof.h"
#include "util/proof.h"
#include "expr/node.h"
#include "theory/logic_info.h"
#include "theory/substitutions.h"
namespace CVC4 {
class SkolemizationManager {
public:
void registerSkolem(Node disequality, Node skolem);
bool hasSkolem(Node disequality);
Node getSkolem(Node disequality);
Node getDisequality(Node skolem);
bool isSkolem(Node skolem);
void clear();
std::unordered_map<Node, Node, NodeHashFunction>::const_iterator begin();
std::unordered_map<Node, Node, NodeHashFunction>::const_iterator end();
private:
std::unordered_map<Node, Node, NodeHashFunction> d_disequalityToSkolem;
std::unordered_map<Node, Node, NodeHashFunction> d_skolemToDisequality;
};
}/* CVC4 namespace */
#endif /* __CVC4__SKOLEMIZATION_MANAGER_H */
|
