On the complexity of regular resolution and the Davis-Putnam procedure (Q1249435): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forest embeddings in regular graphs of large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Way to Simplify Truth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank

Latest revision as of 00:08, 13 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of regular resolution and the Davis-Putnam procedure
scientific article

    Statements