Head

GCC Code Coverage Report

Directory:	.		Exec	Total	Coverage
File:	src/theory/quantifiers/sygus/sygus_qe_preproc.h	Lines:	1	1	100.0 %
Date:	2021-09-18	Branches:	0	0	0.0 %


/******************************************************************************
 * Top contributors (to current version):
 *   Andrew Reynolds
 *
 * This file is part of the cvc5 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.
 * ****************************************************************************
 *
 * Sygus quantifier elimination preprocessor.
 */

#ifndef CVC5__THEORY__QUANTIFIERS__SYGUS__SYGUS_QE_PREPROC_H
#define CVC5__THEORY__QUANTIFIERS__SYGUS__SYGUS_QE_PREPROC_H

#include "expr/node.h"
#include "smt/env_obj.h"

namespace cvc5 {

class Env;

namespace theory {
namespace quantifiers {

/**
 * This module does quantifier elimination as a preprocess step
 * for "non-ground single invocation synthesis conjectures":
 *   exists f. forall xy. P[ f(x), x, y ]
 * We run quantifier elimination:
 *   exists y. P[ z, x, y ] ----> Q[ z, x ]
 * Where we replace the original conjecture with:
 *   exists f. forall x. Q[ f(x), x ]
 * For more details, see Example 6 of Reynolds et al. SYNT 2017.
 */
class SygusQePreproc : protected EnvObj
{
 public:
  SygusQePreproc(Env& env);
  ~SygusQePreproc() {}
  /**
   * Preprocess. Returns a lemma of the form q = nq where nq is obtained
   * by the quantifier elimination technique outlined above.
   */
  Node preprocess(Node q);
};

}  // namespace quantifiers
}  // namespace theory
}  // namespace cvc5

#endif /* CVC5__THEORY__QUANTIFIERS__SYGUS__SYGUS_QE_PREPROC_H */


Generated by: GCOVR (Version 3.2)

Line	Exec	Source
1		/******************************************************************************
2		* Top contributors (to current version):
3		* Andrew Reynolds
4		*
5		* This file is part of the cvc5 project.
6		*
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.
11		* ****************************************************************************
12		*
13		* Sygus quantifier elimination preprocessor.
14		*/
15
16		#ifndef CVC5__THEORY__QUANTIFIERS__SYGUS__SYGUS_QE_PREPROC_H
17		#define CVC5__THEORY__QUANTIFIERS__SYGUS__SYGUS_QE_PREPROC_H
18
19		#include "expr/node.h"
20		#include "smt/env_obj.h"
21
22		namespace cvc5 {
23
24		class Env;
25
26		namespace theory {
27		namespace quantifiers {
28
29		/**
30		* This module does quantifier elimination as a preprocess step
31		* for "non-ground single invocation synthesis conjectures":
32		* exists f. forall xy. P[ f(x), x, y ]
33		* We run quantifier elimination:
34		* exists y. P[ z, x, y ] ----> Q[ z, x ]
35		* Where we replace the original conjecture with:
36		* exists f. forall x. Q[ f(x), x ]
37		* For more details, see Example 6 of Reynolds et al. SYNT 2017.
38		*/
39		class SygusQePreproc : protected EnvObj
40		{
41		public:
42		SygusQePreproc(Env& env);
43	1231	~SygusQePreproc() {}
44		/**
45		* Preprocess. Returns a lemma of the form q = nq where nq is obtained
46		* by the quantifier elimination technique outlined above.
47		*/
48		Node preprocess(Node q);
49		};
50
51		} // namespace quantifiers
52		} // namespace theory
53		} // namespace cvc5
54
55		#endif /* CVC5__THEORY__QUANTIFIERS__SYGUS__SYGUS_QE_PREPROC_H */