Knowledge Representation & Information Systems

← Back to Domain-Specific Families

Abstractions about organizing, retrieving and reasoning over information, including knowledge acquisition, indexing, metadata standards and state-space models, spanning AI knowledge representation, information retrieval and structured data modeling.

31 abstractions in this family — domain-specific abstractions that sit near one another in structural-signature space (k-means over structural-signature embeddings). Each is shown with its short description.

• Automated planning and scheduling — Computational construction and temporal-resource organization of action sequences that move an agent system from an initial state toward specified goals.
• Boy or girl paradox — A probability puzzle showing that conditioning on family sex composition depends on how the information was selected and reported.
• Constraint satisfaction — The search for assignments to variables from declared domains such that every stated constraint is simultaneously satisfied.
• Data-flow diagram — A structured-analysis diagram representing how data moves among external entities, processes and stores within a system.
• Distributed artificial intelligence — The design and analysis of intelligent behavior produced by multiple computational agents or processes distributed across resources, knowledge and control.
• Empirical algorithmics — The systematic experimental study of algorithm behavior through implemented instances, controlled benchmarks and statistical analysis.
• Goal programming — A multiobjective optimization method that assigns target levels to several objectives and minimizes weighted or prioritized deviations from those targets.
• I-Space (conceptual framework) — A knowledge-management framework relating information's codification, abstraction and diffusion through a three-dimensional space and social learning cycle.
• Ignorance management — An organizational practice that makes unknowns, knowledge limits, suppressed questions, and missing expertise explicit so they can be prioritized, shared, investigated, or deliberately tolerated.
• Information model — A formal representation of the entity kinds, relationships, constraints, rules and operations that give data shared semantics within a chosen domain of discourse.
• Inverted index — An information-retrieval index mapping each content term or feature to the documents and positions in which it occurs.
• Knowledge acquisition — The elicitation, extraction and formal encoding of domain knowledge needed to build or maintain a knowledge-based system.
• Knowledge representation and reasoning — The AI discipline of encoding knowledge in formal structures whose semantics and inference procedures support machine reasoning about a domain.
• Level ancestor problem — A rooted-tree query problem asking for a node’s ancestor at a specified depth after preprocessing the tree.
• Merge algorithm — An algorithm that combines multiple already-sorted input sequences into one sorted output while preserving every input element and the declared ordering policy.
• Metadata standard — A shared specification defining metadata elements, meanings, structures and rules so information can be interpreted and exchanged consistently.
• Metapattern — A recurring organization among patterns themselves—a higher-order pattern that connects, transforms or generates patterns across instances or domains.
• Model-based reasoning — An inference approach deriving explanations, predictions or diagnoses by combining observations with an explicit declarative model of how a system works.
• Morphological analysis (problem-solving) — A method for enumerating and testing combinations of discrete dimensions in a complex nonquantified problem space.
• Partial sorting — Rearrangement that places the k smallest or largest elements in their fully sorted positions while leaving or discarding the remainder without requiring a total order output.
• Proximity search (text) — An information-retrieval query requiring separately matching terms to occur within a specified textual distance, optionally in a specified order.
• Records continuum model — An archival model treating record creation, capture, organization, and pluralization as simultaneous interacting dimensions rather than sequential life stages.
• Reification (knowledge representation) — The conversion of a relation or assertion into an addressable object about which further assertions can be made.
• Relevance (information retrieval) — The degree to which retrieved information satisfies a user’s information need within a task and context.
• Rhizome Navigation — An adaptive interface method that generates navigation links dynamically from user behavior and data relationships rather than relying only on a fixed hierarchy.
• State space (computer science) — The set of all possible system configurations together with transitions permitted between them.
• Tagged union — Represent a value as exactly one member of a fixed family of payload alternatives together with a discriminator that records the active alternative and governs safe elimination or pattern matching.
• Transclusion — The dynamic inclusion of content stored in one document within another document by reference rather than by copying.
• Tree (abstract data type) — A hierarchical abstract data type of nodes linked by parent–child relations, with one root and a unique parent for every other node.
• View model — An architecture-description framework that defines a coherent set of viewpoints for representing one system to different stakeholder concerns.
• Web navigation — Movement through linked web information using global, local, contextual and supplemental pathways exposed by a browser interface.