The search efficiency of theorem proving strategies (Q5210762): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: David Alan Plaisted / rank
Normal rank
 
Property / author
 
Property / author: David Alan Plaisted / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-58156-1_5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1520527482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3327746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving refutational completeness of theorem-proving strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first iterative-deepening: An optimal admissible tree search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplified Format for the Model Elimination Theorem-Proving Procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliminating dublication with the hyper-linking strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified problem reduction format / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Horn clause logic programming without contrapositives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Theorem Proving With Renamable and Semantic Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using resolution for deciding solvable classes and building finite models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency and Completeness of the Set of Support Strategy in Theorem Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a bound for the complexity of terms in the resolution method / rank
 
Normal rank

Latest revision as of 12:21, 21 July 2024

scientific article; zbMATH DE number 7154538
Language Label Description Also known as
English
The search efficiency of theorem proving strategies
scientific article; zbMATH DE number 7154538

    Statements

    The search efficiency of theorem proving strategies (English)
    0 references
    21 January 2020
    0 references

    Identifiers