near-decomposability
E267833
Near-decomposability is a systems theory concept describing complex systems that can be understood as loosely coupled subsystems whose internal interactions are much stronger than their interactions with other subsystems.
All labels observed (1)
| Label | Occurrences |
|---|---|
| near-decomposability canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2455454 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: near-decomposability Context triple: [The Sciences of the Artificial, notableConcept, near-decomposability]
-
A.
N-DEx
N-DEx is a national FBI information-sharing system that integrates criminal justice data from agencies across the United States to support investigations and crime analysis.
-
B.
Neudeck
Neudeck is a village in former East Prussia (now Ogrodzieniec in Poland) historically known as the family estate and place of death of German President and World War I field marshal Paul von Hindenburg.
-
C.
nan
nan is the ISO 639-3 language code assigned to the Teochew (Chaoshan) Chinese language variety spoken primarily in eastern Guangdong, China, and among overseas Chinese communities.
-
D.
nde
nde is the ISO 639-2 code for Northern Ndebele, a Bantu language spoken primarily in Zimbabwe.
-
E.
Dehn complex
The Dehn complex is a topological construction introduced by Max Dehn in the study of group presentations and decision problems, encoding relations of a group as a 2-dimensional cell complex.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: near-decomposability Target entity description: Near-decomposability is a systems theory concept describing complex systems that can be understood as loosely coupled subsystems whose internal interactions are much stronger than their interactions with other subsystems.
-
A.
N-DEx
N-DEx is a national FBI information-sharing system that integrates criminal justice data from agencies across the United States to support investigations and crime analysis.
-
B.
Neudeck
Neudeck is a village in former East Prussia (now Ogrodzieniec in Poland) historically known as the family estate and place of death of German President and World War I field marshal Paul von Hindenburg.
-
C.
nan
nan is the ISO 639-3 language code assigned to the Teochew (Chaoshan) Chinese language variety spoken primarily in eastern Guangdong, China, and among overseas Chinese communities.
-
D.
nde
nde is the ISO 639-2 code for Northern Ndebele, a Bantu language spoken primarily in Zimbabwe.
-
E.
Dehn complex
The Dehn complex is a topological construction introduced by Max Dehn in the study of group presentations and decision problems, encoding relations of a group as a 2-dimensional cell complex.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
property of complex systems
ⓘ
systems theory concept ⓘ |
| appliedTo |
biological systems
ⓘ
cognitive architectures ⓘ economic systems ⓘ multi-agent systems ⓘ organizational structures ⓘ software architectures ⓘ |
| associatedWith |
Herbert A. Simon
ⓘ
linked to:
Herbert Simon
|
| assumes | interaction strengths within subsystems are much greater than between subsystems ⓘ |
| characterizes | complex systems ⓘ |
| contrastsWith | fully coupled systems ⓘ |
| enables | hierarchical decomposition of systems ⓘ |
| facilitates |
approximate analysis of global system behavior
ⓘ
local reasoning about subsystems ⓘ |
| hasAlternativeLabel | nearly decomposable system property ⓘ |
| hasConsequence |
inter-subsystem interactions can often be treated as perturbations
ⓘ
system behavior can be approximated by analyzing subsystems separately ⓘ |
| hasDefinition | a property of complex systems in which subsystems are more strongly coupled internally than they are to other subsystems ⓘ |
| hasKeyIdea |
long-run behavior of subsystems is influenced by weak interactions with other subsystems
ⓘ
short-run behavior of subsystems is largely independent of other subsystems ⓘ |
| implies |
perturbations tend to remain localized within subsystems
ⓘ
systems can be modeled as loosely coupled subsystems ⓘ |
| introducedInContextOf | hierarchical systems ⓘ |
| involves |
subsystems with strong internal interactions
ⓘ
subsystems with weak external interactions ⓘ |
| originatesFrom | work of Herbert A. Simon on complex systems ⓘ |
| reduces | analytical complexity of large systems ⓘ |
| relatedConcept |
bounded rationality
ⓘ
hierarchical complexity ⓘ system modularity ⓘ |
| relatesTo |
hierarchical organization
ⓘ
loose coupling ⓘ modularity ⓘ |
| reliesOn | time-scale separation between internal and external interactions ⓘ |
| supports |
divide-and-conquer problem solving
ⓘ
modular analysis of systems ⓘ |
| usedFor |
designing robust system architectures
ⓘ
explaining emergence of stable intermediate forms in evolution ⓘ simplifying mathematical models of complex systems ⓘ |
| usedInField |
cognitive science
ⓘ
complexity science ⓘ computer science ⓘ ecology ⓘ economics ⓘ engineering ⓘ organizational theory ⓘ systems theory ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: near-decomposability Description of subject: Near-decomposability is a systems theory concept describing complex systems that can be understood as loosely coupled subsystems whose internal interactions are much stronger than their interactions with other subsystems.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.