A Term Rewriting Technique for Decision Graphs (Q5170280): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Solvable cases of the decision problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero, successor and equality in BDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4799892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: BDD based procedures for a theory of equality with uninterpreted functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2767014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Decision Procedures Based on Congruence Closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804898 / rank
 
Normal rank

Latest revision as of 19:37, 8 July 2024

scientific article; zbMATH DE number 6319815
Language Label Description Also known as
English
A Term Rewriting Technique for Decision Graphs
scientific article; zbMATH DE number 6319815

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references