• 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 computability theory, a semicomputable function is a partial function that can be approximated either from above or from below by a computable function. More precisely a partial function is upper semicomputable, meaning it can be approximated from above, if there exists a computable function , where is the desired parameter for and is the level of approximation, such that: * * Completely analogous a partial function is lower semicomputable if and only if is upper semicomputable or equivalently if there exists a computable function such that: * *