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

@@ Property / full work available at URL @@
-https://doi.org/10.1016/j.tcs.2009.04.030
-Normal rank
@@ Property / OpenAlex ID @@
-W2032065721
@@ Property / OpenAlex ID: W2032065721 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2009.04.030
+Normal rank
@@ Property / OpenAlex ID @@
+W2032065721
@@ Property / OpenAlex ID: W2032065721 / rank @@
+Normal rank
@@ Property / cites work @@
+Reasoning on UML class diagrams
@@ Property / cites work: Reasoning on UML class diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+EXPtime tableaux for ALC
@@ Property / cites work: EXPtime tableaux for ALC / rank @@
+Normal rank
@@ Property / cites work @@
+Foundations of Information and Knowledge Systems
@@ Property / cites work: Foundations of Information and Knowledge Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized quantifiers and pebble games on finite structures
+Normal rank
@@ Property / cites work @@
+On the complexity of inferring functional dependencies
+Normal rank
@@ Property / cites work @@
+Q4291432
@@ Property / cites work: Q4291432 / rank @@
+Normal rank