Repository navigation
Improve unfolding and quantifier elimination - #129
Open
Philipp15b wants to merge 8 commits into
Open
Philipp15b wants to merge 8 commits into
Philipp15b wants to merge 8 commits into
Conversation
Replace the callback helpers with unfold_under and explicit guards.
Limit optional checks to 10 ms and keep branches on unknown. Respect global limits, fix scope cleanup on errors, and add a timeout regression.
Philipp15b
force-pushed
the
codex/unfolder-qelim-improvements
branch
from
September 29, 2026 22:01
cb40c91 to
6c7c0e7
Compare
This branch has not been deployed
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Add value-preserving algebraic quantifier elimination before the existing polarity-based pass, including threshold identities and Boolean embeddings.
Refactor guarded unfolding and limit reachability checks to 10 ms.
Add two examples where P and Q individually have expected polynomial runtime, but P;Q has infinite expected runtime.
Implementation assisted by Codex.