An average case analysis of a resolution principle algorithm in mechanical theorem proving. (Q1353997): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtrack programming techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pure Literal Rule and Polynomial Average Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Average Time for the Pure Literal Rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3827800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of regular resolution and the Davis-Putnam procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average time analyses of simplified Davis-Putnam procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: CNF-Satisfiability Test by Counting and Polynomial Average Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average Performance of Heuristics for Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Backtracking with Search Rearrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-average-time satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem-Proving on the Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank

Revision as of 12:25, 27 May 2024

scientific article
Language Label Description Also known as
English
An average case analysis of a resolution principle algorithm in mechanical theorem proving.
scientific article

    Statements

    An average case analysis of a resolution principle algorithm in mechanical theorem proving. (English)
    0 references
    0 references
    0 references
    13 May 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    satisfiability problem
    0 references