Open rwst opened 9 years ago
Description changed:
---
+++
@@ -1,8 +1,10 @@
We should provide a detailed interface for symbolic relations:
-* `bool(rel)` equivalent to `(not)(LHS-RHS).is_trivial_zero()` for ==,!= ; and an exception with maybe hint to the following for <,>,<=,>=
+* `bool(rel)` equivalent to `(not)(LHS-RHS).is_trivial_zero()` for ==,!= ; and for <, >, <=, >= the result follows alpha order of lhs and rhs
* `satisfiable(rel)` returning `(Yes,example)/No/Undecidable/NotImplemented`
-* `truth(rel, (x,S1), (y,S2)...)` equivalent to `satisfiable(rel)` with quantifiers: for all `x,y...` in `S1,S2,...`
* `solve(rel)` in case of `satisfiable=Yes` returning the full solution set
+* `is(rel)` attempting simplification/proof, returning `True`/`False`, throwing `NotImplementedError`
+* `ex.is_zero(simplify=False)` (default) calling the fast `bool(ex==0)`
+* `ex.is_zero(simplify=True)` attempting simplification/proof
* `prove(rel)` showing more or less steps of simplification (which is out of reach for the moment)
Tickets:
Description changed:
---
+++
@@ -9,3 +9,4 @@
Tickets:
* #19040: to take satisfiability/truth functionality out of `ex.__nonzero__` into resp. member functions
+* #19000: SMT-solver is needed for dedicated `satisfiable()`
Description changed:
---
+++
@@ -10,3 +10,5 @@
Tickets:
* #19040: to take satisfiability/truth functionality out of `ex.__nonzero__` into resp. member functions
* #19000: SMT-solver is needed for dedicated `satisfiable()`
+
+See also https://trac.sagemath.org/wiki/symbolics/nonzero
Description changed:
---
+++
@@ -3,8 +3,8 @@
* `satisfiable(rel)` returning `(Yes,example)/No/Undecidable/NotImplemented`
* `solve(rel)` in case of `satisfiable=Yes` returning the full solution set
* `is(rel)` attempting simplification/proof, returning `True`/`False`, throwing `NotImplementedError`
-* `ex.is_zero(simplify=False)` (default) calling the fast `bool(ex==0)`
-* `ex.is_zero(simplify=True)` attempting simplification/proof
+* `ex.is_zero(simplify=False)` (default) calling the fast `bool(ex==0)` (#24992)
+* `ex.is_zero(simplify=True)` attempting simplification/proof (#24992)
* `prove(rel)` showing more or less steps of simplification (which is out of reach for the moment)
Tickets:
We should provide a detailed interface for symbolic relations:
bool(rel)
equivalent to(not)(LHS-RHS).is_trivial_zero()
for ==,!= ; and for <, >, <=, >= the result follows alpha order of lhs and rhssatisfiable(rel)
returning(Yes,example)/No/Undecidable/NotImplemented
solve(rel)
in case ofsatisfiable=Yes
returning the full solution setis(rel)
attempting simplification/proof, returningTrue
/False
, throwingNotImplementedError
ex.is_zero(simplify=False)
(default) calling the fastbool(ex==0)
(#24992)ex.is_zero(simplify=True)
attempting simplification/proof (#24992)prove(rel)
showing more or less steps of simplification (which is out of reach for the moment)Tickets:
19040: to take satisfiability/truth functionality out of
ex.__nonzero__
into resp. member functions19000: SMT-solver is needed for dedicated
satisfiable()
See also https://trac.sagemath.org/wiki/symbolics/nonzero
CC: @videlec @slel
Component: symbolics
Issue created by migration from https://trac.sagemath.org/ticket/19162