• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: ActivityStreamsMapasEquivalentb3sb3sifpdbprdf-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://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transurn:det:rdf:labelvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties: Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects
  • "Same As": Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects (recommended) Apply to subjects, objects and predicates (not recommended on big datasets) Apply to predicates only (special use cases only)

About: HOL (proof assistant)     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatProofAssistants, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)

Type: Thinglanguageschema:LanguageLanguageProgramming languageyago:Assistant109815790yago:CausalAgent100007347yago:LivingThing100004258yago:Object100002684yago:Organism100004475yago:Person100007846yago:PhysicalEntity100001930yago:Worker109632518yago:YagoLegalActoryago:YagoLegalActorGeoprogramming languageyago:Whole100003553yago:WikicatProofAssistants New Facet based on Instances of this Class

HOL (Higher Order Logic) denotes a family of interactive theorem proving systems using similar (higher-order) logics and implementation strategies. Systems in this family follow the LCF approach as they are implemented as a library which defines an abstract data type of proven theorems such that new objects of this type can only be created using the functions in the library which correspond to inference rules in higher-order logic. As long as these functions are correctly implemented, all theorems proven in the system must be valid. As such, a large system can be built on top of a small trusted kernel.