Generating Minimum Transitivity Constraints in P-time for Deciding Equality Logic (Q2864399): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.entcs.2008.04.077 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.entcs.2008.04.077 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020525563 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.ENTCS.2008.04.077 / rank
 
Normal rank

Latest revision as of 02:01, 20 December 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
    0 references
    0 references
    6 December 2013
    0 references
    equalities with uninterpreted functions
    0 references

    Identifiers