Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Proof_compression> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Proof_compression abstract "In proof theory, an area of mathematical logic, proof compression is the problem of algorithmically compressing formal proofs. The developed algorithms can be used to improve the proofs generated by automated theorem proving tools such as sat-solvers, SMT-solvers, first-order theorem provers and proof assistants.The following algorithms are currently known: Compression of sequent calculus proofs: Cut-introduction Cut-elimination Compression of propositional resolution proofs: RecycleUnits RecyclePivots RecyclePivotsWithIntersection LowerUnits LowerUnivalents Split Reduce&Reconstruct Subsumption↑ ↑ ↑ ↑ ↑ ↑ ↑".
- Proof_compression wikiPageID "35066763".
- Proof_compression wikiPageRevisionID "598281231".
- Proof_compression hasPhotoCollection Proof_compression.
- Proof_compression subject Category:Proof_theory.
- Proof_compression comment "In proof theory, an area of mathematical logic, proof compression is the problem of algorithmically compressing formal proofs.".
- Proof_compression label "Proof compression".
- Proof_compression sameAs m.0j66vrg.
- Proof_compression sameAs Q7250001.
- Proof_compression sameAs Q7250001.
- Proof_compression wasDerivedFrom Proof_compression?oldid=598281231.
- Proof_compression isPrimaryTopicOf Proof_compression.