• 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: RecycleUnits     Goto   Sponge   NotDistinct   Permalink

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

Type: softwareyago:WikicatMethodsOfProofyago:Ability105616246yago:Abstraction100002137yago:Cognition100023271yago:Know-how105616786yago:Method105660268yago:PsychologicalFeature100023100 New Facet based on Instances of this Class

In mathematical logic, proof compression by RecycleUnits is a method for compressing propositional logic resolution proofs.Its main idea is to make use of intermediate (e.g. non input) proof results being unit clauses, i.e. clauses containing only one literal. Certain proof nodes can be replaced with the nodes representing these unit clauses.After this operation the obtained graph is transformed into a valid proof.The output proof is shorter than the original while being equivalent or stronger.