mirror of
https://github.com/Z3Prover/z3
synced 2025-04-23 09:05:31 +00:00
Fix typos. (#6291)
This commit is contained in:
parent
706f7fbdc7
commit
6ba9ada1e2
10 changed files with 24 additions and 24 deletions
|
@ -226,7 +226,7 @@ public:
|
|||
void set_next_arg(cmd_context & ctx, func_decl* t) override {
|
||||
m_target = t;
|
||||
if (t->get_family_id() != null_family_id) {
|
||||
throw cmd_exception("Invalid query argument, expected uinterpreted function name, but argument is interpreted");
|
||||
throw cmd_exception("Invalid query argument, expected uninterpreted function name, but argument is interpreted");
|
||||
}
|
||||
datalog::context& dlctx = m_dl_ctx->dlctx();
|
||||
if (!dlctx.get_predicates().contains(t)) {
|
||||
|
|
|
@ -25,7 +25,7 @@ Revision History:
|
|||
Let x_i, y_i, z_i be indices into the vectors x, y, z.
|
||||
|
||||
Suppose that positions in P and R are annotated with what is
|
||||
slicable.
|
||||
sliceable.
|
||||
|
||||
Sufficient conditions for sliceability:
|
||||
|
||||
|
@ -43,9 +43,9 @@ Revision History:
|
|||
and the positions where z_i is used in P and R are sliceable
|
||||
|
||||
|
||||
A more refined approach may be using Gaussean elimination based
|
||||
A more refined approach may be using Gaussian elimination based
|
||||
on x,z and eliminating variables from x,y (expressing them in terms
|
||||
of a disjoint subeset of x,z).
|
||||
of a disjoint subset of x,z).
|
||||
|
||||
|
||||
--*/
|
||||
|
@ -441,7 +441,7 @@ namespace datalog {
|
|||
|
||||
void mk_slice::filter_unique_vars(rule& r) {
|
||||
//
|
||||
// Variables that occur in multiple uinterpreted predicates are not sliceable.
|
||||
// Variables that occur in multiple uninterpreted predicates are not sliceable.
|
||||
//
|
||||
uint_set used_vars;
|
||||
for (unsigned j = 0; j < r.get_uninterpreted_tail_size(); ++j) {
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue