Transforming equality logic to propositional logic (Q4916229): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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: Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean satisfiability with transitivity constraints / 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: The propositional formula checker HeerHugo / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank

Revision as of 08:49, 6 July 2024

scientific article; zbMATH DE number 6156038
Language Label Description Also known as
English
Transforming equality logic to propositional logic
scientific article; zbMATH DE number 6156038

    Statements

    Identifiers