Generating Minimum Transitivity Constraints in P-time for Deciding Equality Logic (Q2864399): 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: Q2754075 / 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: The small model property: How small can it be? / rank | |||
Normal rank |
Revision as of 03:01, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generating Minimum Transitivity Constraints in P-time for Deciding Equality Logic |
scientific article |
Statements
Generating Minimum Transitivity Constraints in P-time for Deciding Equality Logic (English)
0 references
6 December 2013
0 references
equalities with uninterpreted functions
0 references