Unrestricted resolution versus N-resolution (Q1185013): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Resolution proofs of generalized pigeonhole principles / 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: The relative efficiency of propositional proof systems / 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: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682461 / 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: Hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution, Refinements, and Search Strategies: A Comparative Study / rank
 
Normal rank

Revision as of 16:16, 15 May 2024

scientific article
Language Label Description Also known as
English
Unrestricted resolution versus N-resolution
scientific article

    Statements