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

Term counting: Can often lower-bound constant relations #86

Open
tnelson opened this issue Jan 13, 2012 · 0 comments
Open

Term counting: Can often lower-bound constant relations #86

tnelson opened this issue Jan 13, 2012 · 0 comments

Comments

@tnelson
Copy link
Owner

tnelson commented Jan 13, 2012

If a constant relation is populated with an atom that cannot appear in any other non-parent, we can put that atom in the constant's lower-bound safely --- signifying that that atom represents the constant. +

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