113 bool negate =
false);
Cached version of the one-step satisfiability rewriting for LTLf formulas.
Definition ltlf.hh:98
ltlf_one_step_sat_rewrite_with_cache()
Build the cache.
~ltlf_one_step_sat_rewrite_with_cache()
Destroy the cache.
formula rewrite(formula f)
Rewrite an LTLf formula.
Cached version of the one-step unsatisfiability rewriting for LTLf formulas.
Definition ltlf.hh:119
formula rewrite(formula f)
Rewrite an LTLf formula.
ltlf_one_step_unsat_rewrite_with_cache()
Build the cache.
~ltlf_one_step_unsat_rewrite_with_cache()
Destroy the cache.
Cheap simplification rules for LTLf formulas.
Definition ltlf.hh:75
ltlf_simplifier()
Build an LTLf simplifier.
~ltlf_simplifier()
Destroy the simplifier.
formula simplify(formula f, bool negated=false)
Simplify an LTLf formula.
formula ltlf_one_step_unsat_rewrite(formula f, bool negate=false)
One-step unsatisfiability rewriting for LTLf formulas.
formula from_ltlf(formula f, const char *alive, int algo)
Convert an LTLf into an LTL formula.
formula ltlf_one_step_sat_rewrite(formula f)
One-step satisfiability rewriting for LTLf formulas.
Definition automata.hh:26