On the complexities of consistency checking for restricted UML class diagrams (Q1044829): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2009.04.030 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.04.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032065721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning on UML class diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: EXPtime tableaux for ALC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Information and Knowledge Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized quantifiers and pebble games on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of inferring functional dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291432 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2009.04.030 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:47, 10 December 2024

scientific article
Language Label Description Also known as
English
On the complexities of consistency checking for restricted UML class diagrams
scientific article

    Statements

    On the complexities of consistency checking for restricted UML class diagrams (English)
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    tractable consistency checking of UML class diagrams
    0 references

    Identifiers