mirror of
https://github.com/Z3Prover/z3
synced 2025-06-23 14:23:40 +00:00
Cherry-pick goodies from mcsat branch
Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
This commit is contained in:
parent
42898f3276
commit
f238720b76
2 changed files with 84 additions and 0 deletions
|
@ -1,3 +1,21 @@
|
||||||
|
/*++
|
||||||
|
Copyright (c) 2006 Microsoft Corporation
|
||||||
|
|
||||||
|
Module Name:
|
||||||
|
|
||||||
|
ast_util.cpp
|
||||||
|
|
||||||
|
Abstract:
|
||||||
|
|
||||||
|
Helper functions
|
||||||
|
|
||||||
|
Author:
|
||||||
|
|
||||||
|
Leonardo de Moura (leonardo) 2007-06-08.
|
||||||
|
|
||||||
|
Revision History:
|
||||||
|
|
||||||
|
--*/
|
||||||
#include "ast_util.h"
|
#include "ast_util.h"
|
||||||
|
|
||||||
app * mk_list_assoc_app(ast_manager & m, func_decl * f, unsigned num_args, expr * const * args) {
|
app * mk_list_assoc_app(ast_manager & m, func_decl * f, unsigned num_args, expr * const * args) {
|
||||||
|
@ -138,3 +156,38 @@ expr * get_clause_literal(ast_manager & m, expr * cls, unsigned idx) {
|
||||||
SASSERT(m.is_or(cls));
|
SASSERT(m.is_or(cls));
|
||||||
return to_app(cls)->get_arg(idx);
|
return to_app(cls)->get_arg(idx);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
expr * mk_and(ast_manager & m, unsigned num_args, expr * const * args) {
|
||||||
|
if (num_args == 0)
|
||||||
|
return m.mk_true();
|
||||||
|
else if (num_args == 1)
|
||||||
|
return args[0];
|
||||||
|
else
|
||||||
|
return m.mk_and(num_args, args);
|
||||||
|
}
|
||||||
|
|
||||||
|
expr * mk_or(ast_manager & m, unsigned num_args, expr * const * args) {
|
||||||
|
if (num_args == 0)
|
||||||
|
return m.mk_false();
|
||||||
|
else if (num_args == 1)
|
||||||
|
return args[0];
|
||||||
|
else
|
||||||
|
return m.mk_or(num_args, args);
|
||||||
|
}
|
||||||
|
|
||||||
|
expr * mk_not(ast_manager & m, expr * arg) {
|
||||||
|
expr * atom;
|
||||||
|
if (m.is_not(arg, atom))
|
||||||
|
return atom;
|
||||||
|
else
|
||||||
|
return m.mk_not(arg);
|
||||||
|
}
|
||||||
|
|
||||||
|
expr * expand_distinct(ast_manager & m, unsigned num_args, expr * const * args) {
|
||||||
|
expr_ref_buffer new_diseqs(m);
|
||||||
|
for (unsigned i = 0; i < num_args; i++) {
|
||||||
|
for (unsigned j = i + 1; j < num_args; j++)
|
||||||
|
new_diseqs.push_back(m.mk_not(m.mk_eq(args[i], args[j])));
|
||||||
|
}
|
||||||
|
return mk_and(m, new_diseqs.size(), new_diseqs.c_ptr());
|
||||||
|
}
|
||||||
|
|
|
@ -95,5 +95,36 @@ bool is_clause(ast_manager & m, expr * n);
|
||||||
unsigned get_clause_num_literals(ast_manager & m, expr * cls);
|
unsigned get_clause_num_literals(ast_manager & m, expr * cls);
|
||||||
expr * get_clause_literal(ast_manager & m, expr * cls, unsigned idx);
|
expr * get_clause_literal(ast_manager & m, expr * cls, unsigned idx);
|
||||||
|
|
||||||
|
// -----------------------------------
|
||||||
|
//
|
||||||
|
// Goodies for creating Boolean expressions
|
||||||
|
//
|
||||||
|
// -----------------------------------
|
||||||
|
|
||||||
|
/**
|
||||||
|
Return (and args[0] ... args[num_args-1]) if num_args >= 2
|
||||||
|
Return args[0] if num_args == 1
|
||||||
|
Return true if num_args == 0
|
||||||
|
*/
|
||||||
|
expr * mk_and(ast_manager & m, unsigned num_args, expr * const * args);
|
||||||
|
|
||||||
|
/**
|
||||||
|
Return (or args[0] ... args[num_args-1]) if num_args >= 2
|
||||||
|
Return args[0] if num_args == 1
|
||||||
|
Return false if num_args == 0
|
||||||
|
*/
|
||||||
|
expr * mk_or(ast_manager & m, unsigned num_args, expr * const * args);
|
||||||
|
|
||||||
|
/**
|
||||||
|
Return a if arg = (not a)
|
||||||
|
Retur (not arg) otherwise
|
||||||
|
*/
|
||||||
|
expr * mk_not(ast_manager & m, expr * arg);
|
||||||
|
|
||||||
|
/**
|
||||||
|
Return the expression (and (not (= args[0] args[1])) (not (= args[0] args[2])) ... (not (= args[num_args-2] args[num_args-1])))
|
||||||
|
*/
|
||||||
|
expr * expand_distinct(ast_manager & m, unsigned num_args, expr * const * args);
|
||||||
|
|
||||||
#endif /* _AST_UTIL_H_ */
|
#endif /* _AST_UTIL_H_ */
|
||||||
|
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue