-
Notifications
You must be signed in to change notification settings - Fork 71
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
Need of exhaustiveDecomposition and disjointDecomposition axioms #190
Comments
For a VariableArityRelation we need to define the types of the arguments. That's what these axioms do. |
I see. Thanks. |
This is related to #173 and #181. In particular, note that these axioms may pose a problem to the ontology. We are dealing with two types of 'typing': 1) post-typing a term, and 2) constraint on terms. Case 1: the axioms that were cited by @nordlow. They basically say that terms used as arguments of these symbols are of type Class. Case 2: see related issues. The FOL interpretation of SUMO, given by the transformation KIF to TPTP/FOL, add restrictions on the possible types for axioms like
or
Both axioms, once transformed to TPTP/FOL, would result in a list of axioms such as:
IMHO, I believe that considering case 1 and case 2, we would end up with |
Aren't the axioms
redundant with
?
The text was updated successfully, but these errors were encountered: