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

Look into Alternate CNF #59

Open
hdavid16 opened this issue Oct 8, 2022 · 1 comment
Open

Look into Alternate CNF #59

hdavid16 opened this issue Oct 8, 2022 · 1 comment
Labels
enhancement New feature or request

Comments

@hdavid16
Copy link
Owner

hdavid16 commented Oct 8, 2022

Alternate approaches exist for converting to CNF, which involve preserving clause satisfiability rather than clause equivalence. These approaches prevent exponential size increase in clauses and yield logically consistent results.

Paul Jackson and Daniel Sheridan. Clause form conversions
for boolean circuits. Theory and Applications of Satisfiability
Testing, page 183–198, 2005. doi:10.1007/11527695_15.
@hdavid16 hdavid16 added the enhancement New feature or request label Oct 8, 2022
@hdavid16 hdavid16 removed the enhancement New feature or request label Dec 8, 2023
@hdavid16
Copy link
Owner Author

hdavid16 commented Dec 8, 2023

See PYOMO GDP: #65 (comment)

@hdavid16 hdavid16 added the enhancement New feature or request label Dec 8, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@hdavid16