mirror of
https://github.com/Z3Prover/z3
synced 2025-08-27 21:48:56 +00:00
add missing tactic descriptions, add rewrite for tamagochi
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
95cb06d8cf
commit
fcea32344e
19 changed files with 147 additions and 49 deletions
|
@ -13,7 +13,31 @@ Author:
|
|||
|
||||
Leonardo (leonardo) 2011-10-24
|
||||
|
||||
Notes:
|
||||
Tactic Documentation:
|
||||
|
||||
## Tactic aig
|
||||
|
||||
### Short Description
|
||||
|
||||
Simplify Boolean structure using AIGs (And-inverter graphs).
|
||||
|
||||
### Long Description
|
||||
|
||||
And-inverter graphs (AIGs) uses just the Boolean connectives `and` and `not` to encode Boolean
|
||||
formulas. The circuit representation using AIGs first converts formulas using other connectives to this normal form,
|
||||
then performs local simplification steps to minimize the circuit representation.
|
||||
Note that the simplification steps used by this tactic are heuristic, trading speed for power,
|
||||
and do not represent a high-quality circuit minimization approach.
|
||||
|
||||
### Example
|
||||
|
||||
```z3
|
||||
(declare-const a Bool)
|
||||
(declare-const b Bool)
|
||||
(declare-const c Bool)
|
||||
(assert (or (and a b) (and b a c)))
|
||||
(apply aig)
|
||||
```
|
||||
|
||||
--*/
|
||||
#pragma once
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue