Proving with BDDs and control of information (Q5210793): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Theorem Proving via General Matings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4860656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof Procedure Using Connection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear resolution with selection function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3821629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Unification Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seventy-five problems for testing automatic theorem provers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5801644 / rank
 
Normal rank

Latest revision as of 12:22, 21 July 2024

scientific article; zbMATH DE number 7154569
Language Label Description Also known as
English
Proving with BDDs and control of information
scientific article; zbMATH DE number 7154569

    Statements

    Identifiers