10.1 Ontological Engineering
An ontology specifies categories, relations, and constraints for a domain. Its vocabulary and level of detail should support the questions a system must answer.
AI · Knowledge, reasoning, and planning
Knowledge representation organizes concepts, objects, events, and defaults so a system can draw useful conclusions while respecting exceptions.
An ontology specifies categories, relations, and constraints for a domain. Its vocabulary and level of detail should support the questions a system must answer.
Categories group individuals and support inheritance: a robin is a bird, so properties of birds may apply to it. Taxonomies and part–whole relations capture different kinds of structure.
Event representations describe actions and changes over time, including participants, time, and resulting states. They help reason about what was true before and after an event.
Beliefs, knowledge, and other attitudes can be represented as relations between agents and propositions. Modal operators distinguish what is true from what an agent believes or knows.
Description-logic systems classify concepts and individuals using formal definitions, subsumption, and consistency checking.
Defaults are normally true but defeasible. An exception such as “penguins do not fly” can override the inherited bird default without making the knowledge base inconsistent.
Interactive inheritance
All birds normally fly. Penguins are birds, but the explicit exception blocks that default.
Conclusion about Fly(x)
The selected key (“robin,” “penguin,” or “bat”) directly retrieves a prewritten example record containing its path, conclusion, and explanation. The displayed chain is explanatory data; this demo does not traverse a general taxonomy or resolve arbitrary competing defaults.
Let C be the number of records. Time: O(1) average per selection/update using JavaScript object-key lookup (then a constant number of text/style updates). Auxiliary space: O(1) per update; the fixed example records and rendered labels occupy O(C) input/UI space. Here C = 3. A general inheritance engine would need bounds based on its graph and rules; these constant-time claims do not describe one.