• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: asEquivalentb3sb3sifpdbprdf-labelfacetshttp://dbpedia.org/resource/inference/rules/dbpedia#http://dbpedia.org/resource/inference/rules/opencyc#http://dbpedia.org/resource/inference/rules/umbel#http://dbpedia.org/resource/inference/rules/yago#http://dbpedia.org/schema/property_rules#http://localhost:8890/dataspacehttp://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties:
  • "Same As": Disabled (fastest) Apply to subjects, objects and predicates (not recommended on big datasets)

In mathematics and theoretical computer science, a set constraint is an equation or an inequation between sets of terms.Similar to systems of (in)equations between numbers, methods are studied for solving systems of set constraints. Different approaches admit different operators (like "∪", "∩", "\", and function application) on sets and different (in)equation relations (like "=", "⊆", and "⊈") between set expressions. Systems of set constraints are useful to describe (in particular infinite) sets of ground terms.They arise in program analysis, abstract interpretation, and type inference.