Exploiting parallelism: highly competitive semantic tree theorem prover (Q4823345): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The practicality of generating semantic trees for proofs of unsatisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Unit Proof and the Input Proof in Theorem Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2701741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seventy-five problems for testing automatic theorem provers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The TPTP problem library. CNF release v1. 2. 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics used by HERBY for semantic tree theorem proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank

Latest revision as of 13:48, 7 June 2024

scientific article; zbMATH DE number 2110859
Language Label Description Also known as
English
Exploiting parallelism: highly competitive semantic tree theorem prover
scientific article; zbMATH DE number 2110859

    Statements

    Identifiers