mirror of
https://github.com/Z3Prover/z3
synced 2025-04-16 13:58:45 +00:00
propositional formulas (disjunctions) can appear as literals. This makes it tricky to recognize whether a formula is a unit clause when re-building unit resolution. Added work-around that identifies whether a formula is a literal based on its appearance in previous unit resolution step. |
||
---|---|---|
.. | ||
base | ||
bmc | ||
clp | ||
dataflow | ||
ddnf | ||
fp | ||
pdr | ||
rel | ||
spacer | ||
tab | ||
transforms | ||
README |
muZ: routines related to solving satisfiability of Horn clauses and solving Datalog programs. - base - contains base routines and the main context for maintaining fixedpoint solvers - transforms - common rule transformations - rel - relational algebra based Datalog engine - pdr - PDR based Horn clause solver - clp - Dart/Symbolic execution-based solver - tab - Tabulation based solver - bmc - Bounded model checking based solver - fp - main exported routines