You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Some solvers require that assumptions to check-sat-assuming be propositional literals. This is based on the SMT-LIB documentation. However, in smt-lib you can use a define-fun rather than introducing a new constant. Thus it seems overly restrictive to require boolean literals in the API, rather than any boolean formula. Some solvers require boolean literals in the API, but we could consider hiding that from the user.
The text was updated successfully, but these errors were encountered:
Some solvers require that assumptions to
check-sat-assuming
be propositional literals. This is based on the SMT-LIB documentation. However, in smt-lib you can use adefine-fun
rather than introducing a new constant. Thus it seems overly restrictive to require boolean literals in the API, rather than any boolean formula. Some solvers require boolean literals in the API, but we could consider hiding that from the user.The text was updated successfully, but these errors were encountered: