Refinements to depth-first iterative-deepening search in automatic theorem proving (Q582116): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3204066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of the complexity of A* / 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: Q5623241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and related enhancements for automated theorem-proving programs / 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: A Prolog technology theorem prover: Implementation by an extended Prolog compiler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical deduction / rank
 
Normal rank

Latest revision as of 12:12, 20 June 2024

scientific article
Language Label Description Also known as
English
Refinements to depth-first iterative-deepening search in automatic theorem proving
scientific article

    Statements

    Refinements to depth-first iterative-deepening search in automatic theorem proving (English)
    0 references
    0 references
    0 references
    1989
    0 references
    depth iterative-deepening seach
    0 references
    priority system
    0 references
    priority list
    0 references
    complexity
    0 references

    Identifiers