GCC Code Coverage Report
Directory: . Exec Total Coverage
File: src/theory/quantifiers/sygus/sygus_qe_preproc.h Lines: 1 1 100.0 %
Date: 2021-03-23 Branches: 0 0 0.0 %

Line Exec Source
1
/*********************                                                        */
2
/*! \file sygus_qe_preproc.h
3
 ** \verbatim
4
 ** Top contributors (to current version):
5
 **   Andrew Reynolds
6
 ** This file is part of the CVC4 project.
7
 ** Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
8
 ** in the top-level source directory and their institutional affiliations.
9
 ** All rights reserved.  See the file COPYING in the top-level source
10
 ** directory for licensing information.\endverbatim
11
 **
12
 ** \brief Sygus quantifier elimination preprocessor
13
 **/
14
15
#ifndef CVC4__THEORY__QUANTIFIERS__SYGUS__SYGUS_QE_PREPROC_H
16
#define CVC4__THEORY__QUANTIFIERS__SYGUS__SYGUS_QE_PREPROC_H
17
18
#include "expr/node.h"
19
20
namespace CVC4 {
21
namespace theory {
22
23
class QuantifiersEngine;
24
25
namespace quantifiers {
26
27
/**
28
 * This module does quantifier elimination as a preprocess step
29
 * for "non-ground single invocation synthesis conjectures":
30
 *   exists f. forall xy. P[ f(x), x, y ]
31
 * We run quantifier elimination:
32
 *   exists y. P[ z, x, y ] ----> Q[ z, x ]
33
 * Where we replace the original conjecture with:
34
 *   exists f. forall x. Q[ f(x), x ]
35
 * For more details, see Example 6 of Reynolds et al. SYNT 2017.
36
 */
37
class SygusQePreproc
38
{
39
 public:
40
  SygusQePreproc(QuantifiersEngine* qe);
41
2188
  ~SygusQePreproc() {}
42
  /**
43
   * Preprocess. Returns a lemma of the form q = nq where nq is obtained
44
   * by the quantifier elimination technique outlined above.
45
   */
46
  Node preprocess(Node q);
47
48
 private:
49
  /** Pointer to quantifiers engine */
50
  QuantifiersEngine* d_quantEngine;
51
};
52
53
}  // namespace quantifiers
54
}  // namespace theory
55
}  // namespace CVC4
56
57
#endif /* CVC4__THEORY__QUANTIFIERS__SYGUS__SYGUS_QE_PREPROC_H */