On the complexities of consistency checking for restricted UML class diagrams

DOI10.1016/J.TCS.2009.04.030zbMath1186.68052OpenAlexW2032065721MaRDI QIDQ1044829

Ken Satoh, Ken Kaneiwa

Publication date: 15 December 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.04.030

zbMATH Keywords

tractable consistency checking of UML class diagrams

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Theory of software (68N99)

Related Items (1)

Paraconsistent computation tree logic

Cites Work

• Unnamed Item
• On the complexity of inferring functional dependencies
• EXPtime tableaux for ALC
• Generalized quantifiers and pebble games on finite structures
• Reasoning on UML class diagrams
• Foundations of Information and Knowledge Systems

This page was built for publication: On the complexities of consistency checking for restricted UML class diagrams