Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Construct the following graph-satchecker #10

Open
vaibhavkarve opened this issue Oct 1, 2022 · 0 comments
Open

Construct the following graph-satchecker #10

vaibhavkarve opened this issue Oct 1, 2022 · 0 comments

Comments

@vaibhavkarve
Copy link
Owner

Take a graph. Compute all Cnfs on it. Translate each CNF by the correct
amount so that each CNF has a disjoint variable set. Then send this
big-bloated CNF to a cnf-satchecker.

Question: Is this strategy faster than other graph-satcheckers?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@vaibhavkarve