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.

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

Implement converter to Conjunctive Normal Form for First Order Logic #25

Open
dpalmasan opened this issue Jul 22, 2022 · 0 comments
Open

Comments

@dpalmasan
Copy link
Owner

Should convert any formula to CNF (consider quantifiers, Skolemization, Domain, functions and Predicates). The ideas should be similar to what was done for Propositional Logic, yet I think it will be much more complex.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant