mirror of
https://github.com/Z3Prover/z3
synced 2025-11-03 13:07:53 +00:00
smtfd solver that uses lazy iteration around fd to produce theory lemmas
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
e881c4af3f
commit
c476c4a86a
4 changed files with 1029 additions and 0 deletions
35
src/tactic/fd_solver/smtfd_solver.h
Normal file
35
src/tactic/fd_solver/smtfd_solver.h
Normal file
|
|
@ -0,0 +1,35 @@
|
|||
/*++
|
||||
Copyright (c) 2019 Microsoft Corporation
|
||||
|
||||
Module Name:
|
||||
|
||||
smtfd_solver.h
|
||||
|
||||
Abstract:
|
||||
|
||||
SMT reduction to Finite domain solver.
|
||||
|
||||
Author:
|
||||
|
||||
Nikolaj Bjorner (nbjorner) 2019-09-03
|
||||
|
||||
Notes:
|
||||
|
||||
--*/
|
||||
#ifndef SMTFD_SOLVER_H_
|
||||
#define SMTFD_SOLVER_H_
|
||||
|
||||
#include "ast/ast.h"
|
||||
#include "util/params.h"
|
||||
|
||||
class solver;
|
||||
class tactic;
|
||||
|
||||
solver * mk_smtfd_solver(ast_manager & m, params_ref const & p);
|
||||
tactic * mk_smtfd_tactic(ast_manager & m, params_ref const & p);
|
||||
|
||||
/*
|
||||
ADD_TACTIC("smtfd", "builtin strategy for solving SMT problems by reduction to FD.", "mk_smtfd_tactic(m, p)")
|
||||
*/
|
||||
|
||||
#endif
|
||||
Loading…
Add table
Add a link
Reference in a new issue